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

[@AdityaSingh-ql9ke]

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

[@kshitijmishra2716]

same here jaun jaun se 😂😂😂😂

[@animeshmaru16]

This series is better than all NETFLIX series 💛💛

[@PIYUSH-lz1zq]

why after for loop we r storing in DP why not after if loop ????

[@ApoorvaRajBhadani]

Need video for NlogN approach

[@himanshupathak3574]

your way of explaination is very cool😄👍

[@sahilanand30]

Crystal clear explanation

[@CodingJoySoul]

This is also a good approach to understand LIS

[@fgffgf9844]

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 previously).......u are god

[@wolfrikz7238]

Great Explanation ❤️

[@satyamgupta4808]

explained very clearly. i like it

[@leftover3857]

💛 This was something different

[@ROHITKADYANJI]

Literally bhai too good 🙌

[@anutyagi1002]

Thanku so much ... Easy to understand explanation

[@nishanttyagi3665]

which course and year

[@Knowledgeatfingertips-d1n]

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

[@yath3681]

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) .

[@abcefg7045]

no, because if you carefully observe for the loop in main function the lis() will behave like O(n) time complexity as we already calculated all the dp[] form 0 to i - 1 beforely

[@namansharma5128]

LIS fxn is called N times from the main fucntion and each LIS fxn call is calling at max N times for all the calls from main fxn cuz we are storing the results in dp array. Thus TC is O(N^2) if we would not be using the dp array , then for each LIS call from the main fxn, LIS will be running for N! times. TC--> O(N* N!) .

[@bhavyramani4055]

@@abcefg7045 yes so if we talk about accurate answer then complexity will O(N²) + O(N) which is equal to O(N²)

[@jitendrakumar-vv8ho]

what if it give tle then? it requires o(nlogn) complexity in codingninjas studio @@namansharma5128

[@UltraKillpc]

int dp[N]={-1}; will do memset

[@magamindplanet8930]

trial 01 abc 9:22 testing ei34 dai34

[@samirbhauraojigiripunje6796]

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

[@Claire-uw1qv]

4:31

[@strugglingprogrammer1487]

love you bro to teach me dp in spectacular way

[@PIYUSH-lz1zq]

why after for loop we r storing in DP why not after if loop ????

[@ravirana5261]

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

[@SajanKumar-ec2us]

Please discuss also iterative approach

[@himanshukumar-uh4ce]

Paji Tusi great ho ❤️

[@ajaysasank3655]

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?

[@otismaeve6167]

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

[@bhavishyamehar3122]

Awesome video bro

[@glenntauro6307]

Loved ur video. Suggested by sheldon tauro

[@PIYUSH-lz1zq]

why after for loop we r storing in DP why not after if loop ????

[@saranshkumar4777]

Nice Explainaintion !!!!!

[@vineetkumar2899]

thanks bhaiya

[@harrypottah9862]

Important part 11:20

[@deepmaurya3257]

[@prabhatmishra5667]

THanks

[@abhijeetsingh9796]

Sir aapki college ID chal rhi hai kya abtak?

[@ChandraShekhar-by3cd]

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

[@samagrapathak3854]

Bhai vo to sab jae he this is something different

[@leftover3857]

int lengthOfLIS(vector& nums) { int n = nums.size(); int ans = 1; vector dp(n+1, 0); for(int i = 0 ; i < n; i++){ for(int j = 0 ;j < i; j++){ if(nums[j] < nums[i]){ dp[i] = max(dp[i] , 1 + dp[j]); } } } for(int i = 0 ; i < n; i++){ dp[n] = max(dp[i] , dp[n]); } return dp[n]+1; }

[@ChandraShekhar-by3cd]

@@leftover3857 Thanks

[@anshulagarwal6682]

what does below statement do? return a = b;

[@tusharnain6652]

it stores b in a, and then return it;

[@snehamandal5376]

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

[@ArpitSingh-ty7gf]

bhiyaa o(nlogn) waala bhi please explain kardo

[@iamluv]

its not dp, hence not covered

[@yogeshrocks5729]

tabulation ka code bhi bata dete na bhayya.... if anyone know send it...

[@yogeshrocks5729]

#include #include using namespace std; int lis(vector &nums) { int n = nums.size(); vector dp(n, 1); int max_length = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { if (nums[i] > nums[j]) { dp[i] = max(dp[i], dp[j] + 1); } } max_length = max(max_length, dp[i]); } return max_length; } int main() { vector nums = {10, 9, 2, 5, 3, 7, 101, 18}; cout

[@varshasingh6627]

gfg pe it is giving Runtime Error

[@NeverGiveUp_oo7]

Hello LUV ...can you write a program to parse a nested structure into json or other format....or anyone who is reading this comment???

[@abhinavshukla970]

Can you explain the problem?

[@sailesh307]

Which language???

[@NeverGiveUp_oo7]

Python or anyone

[@leninsingh5264]

I don't understand why add 1 in lis(j)+1? please explain

[@arunrongala5064]

We add that because upto j we get lis(j) and here we need upto i so we take j to i so we add that 1

[@leninsingh5264]

@@arunrongala5064 I have a doubt lis() is a function and ans is a variable, In==> cout

[@arunrongala5064]

@@leninsingh5264 here lis () is a function with a return value of integer na . So after the function execution completes it will store the returned value which is an integer and then compares it with the ans and it stores the max of the both

[@leninsingh5264]

@@arunrongala5064 okay I got that it's not storing all, only max is storing and keep comparing that keeps only max value. Thank you

[@leninsingh5264]

Can you please tell about dp[2515], I find it difficult others too like N=2e5+10. How to write such size?

[@mrrishiraj88]

Good day

[@divitgoyal5901]

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

[@anutyagi1002]

Hnnn ye b h

[@harshitsingh4764]

compare to other videos isme explanation thoda kam acha tha. you should have solved an example fully on the board, because this is a bit tricky for me understand

[@harshitsingh4764]

💛

[@gamingstars8956]

sir isme base case ki zaroorat kyon nhi padi

[@laconic7119]

recusive function call sirf array ke elements ke liye hi hogi.

[@prabhatgupta9843]

💛

[@The-fc1fi]

I want video in 1 day 1 video please 🙏

[@satyammaurya165]

💚

[@krishchandrasekaran]

Wish its on english, Unable to understand hindi

[@pranjalsingh3071]

💛💛💛💛💛💛💛

[@ENGCS_JaiSaxena]

time complexity zyada hai bro try reducing it

[@unknown_coder7960]

Bhaiya bas 888 questions aur 🙂

[@unknown_coder7960]

@@aadigoyal8400 leemtcomde :)

[@unknown_coder7960]

@@aadigoyal8400 thamk youm!

[@ashutoshkumarchoudhary6420]

♥♥

[@sakshiawadhiya7267]

Sublime me comptitive programming ke setup me problem aa rhi hai kaise solve kare

[@soumavachakraborty9858]

💛💛💛💛💛

[@hemantsingh2331]

💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛

[@ankitkumarmahato4318]

bhaiya aap ulta kyu sochte ho mtlb piche se main to saare problems ko saamne se sochta hu , isse koi problem hai kya, accept ho jata hai lekin

[@tusharnain6652]

recursive solution me peechhe se karna jyaada sense banata hai.

[@Varun-hz2hb]

code is giving wrong ans

[@funenjoynilaypatel4553]

16-aug 2022

[@prathamverma5955]

💛💛💛💛💛💛💛💛💛💛💛💛💛

[@_gauravkumar]

💛💛💛💛💛💛💛💛

[@do_not_want_to_show]

This problem can also be solved in O(nlogn).

[@fariahasan3965]

Would you provide the process?

[@do_not_want_to_show]

@@fariahasan3965 Nope I don't know but it's on GFG.

[@mrboon8856]

bhaiya web dev ke liyea bhi road map batta do atleast

[@p38_amankuldeep75]

🧡🧡💛🧡🧡

[@AbhishekSingh-sl3zc]

where i can copy code to run in my own vs code

[@vinaykumarkhardoniya9639]

you have to type it yourself

[@sakawat_tanveer]

👒

[@yashovardhanmishra5632]

Heart

[@30harshkumawat31]

100th like

[@sig0001]

unoptimized asf

[@chiraggoyal9646]

Thanx bhaiya

[@subhasishpanda5390]

💛

[@anuragbhattacharya2720]

💚

[@sachinupreti7159]

💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛💛

[@dipubiswas8359]

💛💛💛💛💛💛💛💛💛💛💛

[@vivekpandey8867]

💕💕

[@no-body7286]

💚

[@rickk3300]

💛

[@aarushiagarwal8938]

💛💛💛💛💛💛

[@Ravi-jl2bb]

💚

[@076_praveenkumar9]

💛

[@anowlwithinternet9125]

💛💛💛💛💛💛💛

[@adarshsingh2630]

💛💛💛💛💛💛

[@learncode6477]

💚

[@shivasaini4097]

💛

[@champion5946]

💛

[@nishchayshroff7334]

💚💚

[@jinniesrego]

💛

[@jatinkumar-bd2nw]

💛

[@pulkitmittal584]

💛

[@divyampatro8586]

💛

[@mehoneybadger999]

💛

[@manishkumar-uw5mw]

💚💚

[@abhishekchaudhary3693]

💚💚

[@sayondeep5050]

💛

[@TechnoPrefix]

💛

[@niteshgyanani9947]

💛💛💛

[@princhipawansaikia]

💛💛

[@mantrarajgotecha3055]

💛

[@adarshjha9188]

💛

[@shaamidrees6036]

💛

[@divyansh2212]

💛💛