LeetCode #:121 Best Time to Buy and Sell Stock

A step-by-step visualization of #LeetCode question 121: Best Time to Buy and Sell Stock.
0:00 Intro
0:41 Brute Force O(n²) Solution
2:05 Optimized O(n) Solution
5:43 Code Walkthrough
7:33 Explanation of O(n²) Solution

#coding #programming #algorithms

[jeevithanumalla]

I am so disappointed for not finding this channel all these years, such a delight to watch and learn from this channel

[myspeed]

Dude, I'm blown away by the quality of this video. It's perfect. You're a great speaker, have simple explanations, and include excellent graphics for clarity. I'm just getting into leetcode myself and was frustrated by this problem, which I thought would be easy, but I struggled with it until I gave and found your solution. Now it makes complete sense to me. Thank you so much for the time you put into these videos. I'll definitely be coming back for more. —Ben

[MultiYT]

I'm absolutely amazed by the quality of this video. I have never seen someone explain a solution better than you have. Thanks a lot!

[mailsiraj]

very nice explanation of the two pointers in a lucid way and very clear animation - thank you so much.

[lol_chief]

Very detailed and clear. Excellent explanation!

[LuisMedina-dkvc]

Amazing explanation once again. Thank you so much

[SDic]

The graphic is the killer, I'm also struggle with this easy problem, thanks

[st-lucia]

Thank you very much for the explanation!

[contumacysgwy]

This is the best leetcode tutorial channel I have ever seen on Youtube, thank you.

[yuriynicom]

Super fast solution, thank you so much. How we can call this algorithm?

[Demonic]

My mind was clarified by the visualized explanations in this video. Thanks a lot!
BTW, could I say the O(n) improvement was implemented by Greedy Algorithm?

[shubhamgattani]

Who else thinks that one like is not enough for this video? 🙂