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

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

In this video I discuss longest increasing subsequence problem of dynamic programming and also solve related leetcode question

Practice Questions :

Timestamps:
Explanation : (0:00)
Code : (7:23)

Be a part of our awesome Community. Join

You can follow me on below platforms for all the latest updates

Blog(Not frequently updated)

Hashtags
#lis #dp #leetcode #questions #tutorial

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

Комментарии

Allahabad ka asar : "jaun" "jaun" se digits 😂😂. Great education as always.

AdityaSingh-qlke

your way of explaination is very cool😄👍

himanshupathak

Thanks bhai because of your technique now I am able to solve medium-level DP problem easily(I mean with less effort than I was making are god

fgffgf

This is also a good approach to understand LIS

CodingJoySoul

Thanku so much ... Easy to understand explanation

anutyagi

This series is better than all NETFLIX series 💛💛

animeshmaru

💛 as you said thanks for such a helpful content sir. luv you a lot😄

samirbhauraojigiripunje

Music name please which is at beginning and ending of the lecture...

Knowledgeatfingertips-dn

Wouldn't the time complexity be (n^3) ?? As we are also running a loop from 0 to n in the main function, and we are calling the LIS function in each iteration which is (n^2) .

yath

love you bro to teach me dp in spectacular way

strugglingprogrammer

bhaiya in the recursion call each time we are calling lis(j) but where are we incrementing it each time j is starting at 0 and we are calling it where is it increasing?

ajaysasank

sir one confusion...Where is the base condition for recursive lis function?

ravirana

Please discuss also iterative approach

SajanKumar-ecus

vaiya music ka reference di jiye please....apka video bohot accha raha vaiya.Thank you.

otismaeve

Loved ur video. Suggested by sheldon tauro

glenntauro

Please also consider to explain tabulation method as well . It will be helpful for all..💛 Thanks

ChandraShekhar-bycd

Sir aapki college ID chal rhi hai kya abtak?

abhijeetsingh

💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛THANKING U SO MUCH BHAIYA FOR DELIVERING SUCH AN AMAZING CONTENT💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛

snehamandal

what does below statement do?
return a = b;

anshulagarwal

Bina base case ke kaise run ho rha code, please explain someone?

divitgoyal

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

Longest Increasing Subsequence - Dynamic Programming - Leetcode 300

Longest Increasing Subsequence

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

Longest Increasing Sub-sequence(LIS).

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

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

DP 43. Longest Increasing Subsequence | Binary Search | Intuition

Longest increasing subsequence

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

Longest Increasing Subsequence in nlogn time

Find The Longest Increasing Subsequence - Dynamic Programming Fundamentals

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

DP 41. Longest Increasing Subsequence | Memoization

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

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

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

Longest Increasing Subsequence (Dynamic Programming)

5 Simple Steps for Solving Dynamic Programming Problems

Longest Increasing Subsequence NlogN | Leetcode #300 | LIS

Longest Increasing Subsequence (LIS) Dynamic Programming

Longest Increasing Subsequence (Python)

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

DP 42. Printing Longest Increasing Subsequence | Tabulation | Algorithm

LIS in O(nlogn) with printing solution | Day 4 Part 1 | Dynamic Programming workshop | Vivek Gupta