Longest Increasing Subsequence - Leetcode 300 - Dynamic Programming (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@SemesterAtSeaHopeful]

I'm also interested in seeing a vid for the binary search approach!

[@ibraheem_Zain]

You and your video are great as usual. I am new in the field of programming and your chanel is being one of my resources to how i should think as a programmer. Thanks for those great videos.

[@GregHogg]

That's amazing! This one is pretty tricky for new programmers haha. I really appreciate it :)

[@julieirwin3288]

Excellent explanation!!! Thank you!

[@notsaad]

May be good to also go over the O(nlogn) binary search answer even if it is more difficult just to have the optimal solution presented.

[@Martinnnnnn-e5s]

I spent so much time on this question, and everyone in the discussion section says this question is hard. But it's actually sooooo easy whattttttttt

[@GregHogg]

No I think it's pretty hard lol

[@Martinnnnnn-e5s]

@@GregHogg well not hard after your explanation lol

[@mohammadrafi895]

​@@GregHogg Agreed. Coming up with a solution on your own is probably a nightmare.

[@abdulrahamanaslam5467]

Hi Greg,I hope you are fine, I can't seem to understand how you developed all these thought processes and problem solving skills,I want to be like you ,I'm currently in my second year cs ,tell me something

[@__RK__]

Thanks man ✌🏼

[@LawZist]

Great video! Can you explain how to use binary search here?

[@notsoeazy35]

What application do you use to write those notes?

[@fantastic-b2m]

leetcode

[@vxel]

he draws with miro