Longest Increasing Subsequence - Dynamic Programming - Leetcode 300

Показать описание

0:00 - Read the problem
1:45 - Brute Force Solution
2:58 - DFS Solution
10:55 - Dynamic Programming Solution
15:35 - Coding Solution

leetcode 300

#LIS #subsequence #python

Disclosure: Some of the links above may be affiliate links, from which I may earn a small commission.

NeetCode

Рекомендации по теме

Комментарии

Will never forget my first day on the job where a customer requested a feature to find the longest increasing sub-sequence. A totally valid way to test someones competency as a developer

Herald

Please keep that tone and speed of voice. It really helps to "understand" the solution. All of us are here to "understand" the solution not just for a solution. You will do great my dude.

lugiadark

You sir. Are the savior. Your made it so simple - some times you make me guilty why I could not think of it. Keep them coming!

srinadhp

"I really doubt your interviewer is going to expect you to get this without a hint; if they do I'd just walk out of the room"

Probably worked great up until the layoffs 😥

djx

Thank you for letting us know when we should walk out of the room. And what difficulty to expect in the interview :)

jagrutitiwari

Thanks, great explanation as usual, who needs cracking the coding interview when this exists!

director

You're the best at actually explaining the reasoning behind these problems and all your views are so well deserved. I'm absolutely dreadful at these despite being a senior dev but you don't know how much your channel has helped, thank you!!!

Golipillas

This explanation went down so smooth -your voice was very easy to follow and your diagrams weren't sloppy and not complex to understand -this might be the cleanest solution I have seen for this problem for beginners to study!

DanhWasHere

Thank you for the clear explanation! For those wondering why going backwards in dynamic programming, you can actually solve this in forward dynamic programming, start from the beginning, too.

jerrybao

Your explanation is so great. The tone, voice, and the way you say are so clear. Thank you so much <3

quocnguyeninh

That was so simple and an epic explanation of how you can start thinking about approaching this problem.
Being a beginner at dp, your videos help me understand how to start approaching a problem :)
Thankyou!

anushkachakraborty

this is brilliant, I wonder who can think of this solution for the first time during the interview

sathyanarayanankulasekaran

thank you omgosh this really is the best explanation one can find for this question on youtube

redomify

Easily the best channel for leetcode solutions. So easy to understand and code is always clean and concise. Hats off to you, Neetcode!

thatguy

excellent! This taught be how to choose subarrays recursively, and then the problem is trivial. Thanks a bunch.

medievalogic

Clear explanation! I believe you are the rising star in solving leetcode problem.

alex-gzud

Superb Explanation.Anyone having doubt in leetcode can refer this channel.Excellent video bro.I was struggling for this problem you made it clear.Thank you.

BadriBlitz

Great demostration starting from brute force, work way up to memoization and then leads naturally to dp!!! So Nice and easy it becomes with your approach!
1 question though: Why work from end backwords? How did you get the instinct?Could you please share your thougghts?

juliahuanlingtong

Yeah, I agree that being expected to find the O(nlogn) solution is walkout tier. I came damn close to figuring it out: use an ordered set to keep track of the elements you've inserted so far so that you can easily find the greatest value that's smaller than or equal to your current one. From here, assuming nums[i] is not your maximum thus far, there are two ways, and figuring out either of them is easily upper Hard level: either you actually delete the value you've found (the fact that this works because it means you can just return the size of your set at the end is incredibly unintuitive), or you mess with the way you store everything in the set so that you can still retrieve the index of the value corresponding to your found value (which is awful to implement).

christendombaffler

"I'd just walk outta the room" you solve your own problem Mr interviewer LOL

akhtarzaman

Longest Increasing Subsequence - Dynamic Programming - Leetcode 300

Longest Increasing Subsequence - Dynamic Programming - Leetcode 300

Longest Increasing Subsequence

Find The Longest Increasing Subsequence - Dynamic Programming Fundamentals

Dynamic Programming | Set 3 (Longest Increasing Subsequence) | GeeksforGeeks

Longest increasing subsequence

Longest Increasing Subsequence (Dynamic Programming)

Longest Increasing Subsequence Dynamic Programming

Longest Increasing Subsequence O(n log n) dynamic programming Java source code

Longest Increasing Subsequence - Leetcode (Two Solutions)

5 Simple Steps for Solving Dynamic Programming Problems

16. Dynamic Programming, Part 2: LCS, LIS, Coins

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

Longest Increasing Subsequence | Dynamic Programming

Longest Increasing Subsequence (LeetCode 300) | Detailed solution with animations and diagrams

Longest Increasing Subsequence (Python)

Longest Increasing Subsequence in nlogn time

4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming

DP 43. Longest Increasing Subsequence | Binary Search | Intuition

Longest Increasing Sub-sequence(LIS).

Longest Increasing Subsequence (LIS) - O(NlogN) | Searching - Animation - Solutions - inDepth

LeetCode 300. Longest Increasing Subsequence - O(n log n)

The Longest Increasing Subsequence

Longest Increasing Subsequence Problem Dynamic Programming In Arabic

Longest Increasing Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.8