Longest Increasing Subsequence (Dynamic Programming)

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

Find longest increasing subsequence using dynamic programming.

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

Комментарии

thank you so much! it was an excellent explanaition!

Lisa

thank you bro
after watching 5 videos related to LIS
i came here and get a clear explanation thank you so much

vishnuv

Finally i found a proper explaination. Thanks 💖

zannatprome

sir i had watched more than 10 videos and read many blogs but i didnt understand...but now i understood :)

rahulkumargupta

Excellent explanation!! Thanks for making it easier to understand and making a complete video.

AnandaMGhosh

Hats off of your videos! Clearly and neatly explained. Good job Vivek

balajibala

I like your style, your explanations are much clearer than others'. Thanks!

ericfricke

You are really great!! Thank you so much. No more words to express...You explained it the best way possible

abhijithvs

m-ai salvat de o restanta, mersi fain coaiemiu, ai o bere!!!

andreiardelean

WOW, you gave the best explanation for LIS. All your lectures are super! Thanks lots!

chrisogonas

Thank you very much .
i did not understand in the class but you are the who help me to feel happy

i appreciate your effort

ramadanaxmed

Lots of thanks for your explanation. I did the code according it:

public int lengthOfLIS(int[] nums) {
int n = nums.length;
int[] l = new int[n];
int[] idx = new int[n];
int max = 1;

for (int i = 0; i < n; i++){
l[i]=1;
int j = 0;
while(j < i){
if (nums[i]>nums[j]){
int temp = l[j]+1;
if (temp >= l[i]){
l[i]=temp;
idx[i]=j;
}
}
j++;
}
max = Math.max(max, l[i]);

}
return max;
}

leereid

Amazing best explanation i have seen so far.

shyam

ur way of teaching is too easy to understand. Thank you, so much!

jeyavanicm

Awesome video! All explained very carefully and clearly.

davidkreft

Very thorough explanation. Pro tip: Watch at 1.5x speed :)

MiralkumarPatel

Very beautiful explaination.thank you so much

mohammedsuhailbasha

WONDERFUL explanation sir !
This video helped me a lot👍

fabulouscsk

excellent explanantion and hatsoof for ur tireless efforts ..worthy video compared to all other on this topic..keep continuing sir

kavithapriyacj

Thank you so much! Really appreciate your effort in explaining the algorithms in such depth. :)
I usually watch your videos for the algorithms and it has helped me a lot.

aishwaryasingh

Longest Increasing Subsequence (Dynamic Programming)

Longest Increasing Subsequence - Dynamic Programming - Leetcode 300

Find The Longest Increasing Subsequence - Dynamic Programming Fundamentals

Longest Increasing Subsequence

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

Longest Increasing Subsequence (Dynamic Programming)

Number of Longest Increasing Subsequence - Dynamic Programming - Leetcode 673 - Python

Longest Increasing Subsequence Dynamic Programming

Longest increasing subsequence

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

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

DP 41. Longest Increasing Subsequence | Memoization

5 Simple Steps for Solving Dynamic Programming Problems

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

Dynamic Programming #1: Longest Increasing Subsequence

DP 43. Longest Increasing Subsequence | Binary Search | Intuition

Longest Increasing Subsequence (LIS) | Dynamic Programming | CP Course | EP 92

Longest Increasing Subsequence + Dynamic Programming

Longest Increasing Subsequence in nlogn time

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

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

Longest increasing subsequence dynamic programming

DP 42. Printing Longest Increasing Subsequence | Tabulation | Algorithm

The Longest Increasing Subsequence

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