วีดีโอ

Great Explanation

nice

darryl saved me and my 6 hamsters from a burning building 2 years ago, i highly recommend you learn the lowest common ancestor of a binary tree in O(n) time and O(n) space from him

thanks to this video i was able to do simplify path in O(n) time and O(n) space, my dad will finally look me in the eye again, and my wife's boyfriend let me play the PS4 with him! you're the best!

Yo subbed🙌

How is it O(1)? You are initialising the dicts using 2 for loops which makes it O(m*n) or O(n^2)

👍

this shit ass yo

This video is different then my typical videos- just doing a freestyle mock interview with my friend 😄

first

🔥🔥🔥

For the space complexity, if you don't consider the space allocated for result, then it should be O(n), because you just use an array to store the intermediate result

hey Darryl lets go Nice bro One Day we will collaborate on some video

Honestly, the video quality is great and the explanation is great. Keep going man!!

Also, the adding function is O(log(n)); I mistakenly said it was O(1) in the video

Also the reason why the add function wasn't working before was due to it not guaranteeing that the length of the minheap would remain the same afterwards.

At 0:20 I mentioned that these problems have to be done in O(1)- they're not, I think I was just tired from work today LOL

If the problems on datacurve aren't as high quality as on LC, I might consider switching back to leetcode until I'm confident I can spot faulty questions fast!

Nice catch!

Impressive, congrats guys 🔥

Link to Github repo: github.com/darryltanzil/spot-boston-dynamics

Apologies for the lack of video footage for this one- school's been busy and I have a few interviews I'm prepping for, so my posting has been more erratic. Once I get school and my interviews out of the way, I'll return to a consistent uploading schedule!

My computer was experiencing lag while recording this video, which I didn't notice until post-production. The audio explanation may be of some use still so I'll continue to keep this up!

very good i will get into google with this information

Apologies again for lower mic quality and resolution! Once I complete my audio setup at UBC, the quality will return back to normal.

thanks <3

My mic was bugging out in this video- will fix for next time!

good job bro keep going👍

Audio issues while recording- these will be fixed in any subsequent videos!

There was an audio issue with my computer- I'll have it fixed for the next videos!

now do the entire bee movie script

Your voice is so relaxing

Thanks your explanation was really helpful!

Advice from Lincoln: Good: - I verified with interviewer that solution was valid before coding Improvements: - Should be looking at examples to gather details, not to see if my pre-emptive solution would be valid - Use small examples to figure out edge cases - Verify constraints with interviewer before beginning - Shouldn't be adding null values to a stack during iterative DFS, can use if guard to check for left and right values

For me to improve next time: Bad habit of writing code without fleshing out algorithm, would have saved me a lot of hiccups- will make sure to focus on next video

As I prepare to graduate next year, I'm getting more practice on leetcode in prep for the tech interviews. Seeing these mock tech interviews is actually very helpful to see how people think through their problem solving out loud!

Promo*SM 🎊

Either you mistyped "space" and "time", you dont understand how O works or I'm a complete idiot

thank u bro thank u very very much my phone was display green screen for two day I am very thankful to u for this help I am very happy

Thanks a lot for this excellent tip. It saved my day.