A small correction, LIS till 6 will be length 2 with count 4, and not 5.
@pranav9653
2 жыл бұрын
How many more video are there in these playlist??
@shaswataraha7124
2 жыл бұрын
Why not lis till 6 will be length 2 I think it will be of length 3 and its count should be 4
@Superheroic_Anime
2 жыл бұрын
@@shaswataraha7124 you are right maximum length of lis ending till 6 will be 3 Example 1,2,6 But not a problem small mistake although intitution is very good😁
@sagarmittal8627
2 жыл бұрын
@@pranav9653 till DP-60
@sameersahu4569
2 жыл бұрын
Thank you for the correction..i had a doubt regarding that stuff...
@dropshotOP
2 жыл бұрын
On point explanation!! One small correction for explanation part: LIS of value 6 is 3 with count 4 {(1,5,6),(1,4,6),(1,3,6),(1,2,6)} and LIS of value 7 is 4 with count 4 {(1,5,6,7),(1,4,6,7),(1,3,6,7),(1,2,6,7)}. Keep posting more such videos ❤️
@takeUforward
2 жыл бұрын
Thank you :)
@aditheorigin4926
2 жыл бұрын
Yes Prasad, but very nicely explained @TakeUForward. Kudos.
@techspecstm7032
2 жыл бұрын
Please pin this comment!! I wasted what is going wrong for 1hour
@arnabdutta4662
2 жыл бұрын
pin this comment so that every one can see it :)
@praveend3348
Жыл бұрын
@@takeUforward bro could you please add a note during that calculation, so we don't get confused.
@abhishekgupta1471
Жыл бұрын
Thank you so much for this series. There was a time when I was scared just listening to the name of dp but thanks to you now it is now the most interesting topic for me. You developed the confidence in me to tackle dp problems. Thank you so much Striver!!
@rajat_singla
2 жыл бұрын
If you want to verify, this is how the solution should look: array: 1 5 4 3 2 6 7 10 8 9 length: 1 2 2 2 2 3 4 5 5 6 count: 1 1 1 1 1 4 4 4 4 4
@kms8320
2 жыл бұрын
++
@pk4288
2 жыл бұрын
Wrong count array should be : 1 1 1 1 1 4 4 4 8 8
@thomasshelby6780
Жыл бұрын
@@pk4288 you've clearly made a mistake
@piyushjain6909
Жыл бұрын
@@pk4288 no
@tsk1217
7 ай бұрын
@@pk4288 no , he wrote the Right count array .
@subhajitdutta5216
2 жыл бұрын
Bhaiya ek video bana do ki how to take a good random example for dry run while explaining my code in an interview
@sonit9707
5 ай бұрын
Use your 🧠
@khanakpatwari2587
10 ай бұрын
TIP: skip the dry run of first example to save yourself from confusion for the next hour :) . Directly jump to example 2's dry run
@khushalkumawat2254
7 ай бұрын
example 2's dry run is also wrong
@sarthakbehera8324
5 ай бұрын
@@khushalkumawat2254 not wrong
@shreyaagrawal8916
Жыл бұрын
I think except LIS all other parts of DP were explained well. This part is a bit confusing.
@adeshkumar1728
5 ай бұрын
same for me also
@SahilThakur26
3 ай бұрын
Bro got super excited and made a mistake during explanation :) This is the first video of the series which i have to watch twice to understand :) . BTW thanks for all the lectures.
@shalabhbhatiya2146
Ай бұрын
yes i bit confuse then i realised that its his fault
@sameersahu4569
2 жыл бұрын
Completed LIS..on to the next ones....Thank you for this amazing series
@shrishrajgupta1689
8 ай бұрын
12:40 dp[j] + 1 > dp[i] *correction
@JoyAcharyatvl
Жыл бұрын
I wan unable to understand this problem without this lecture. Thank you for this lecture.
@shuvo9131
2 жыл бұрын
1, 1, 1, 2, ,2 , 2, 3, 3, 3 ans=27 simulate the testcase and you will find why cnt[ i ] += cnt[ j ] is used.
@parthsalat
2 жыл бұрын
Maybe you don't realise what you just did. YOU SAVED MY LIFE! Due to the mistakes striver made in the first example of this video, I was going to commit suicide. I had the chair, rope and fan ready. But then I came across your comment, did a dry run of the test case, and I was enlightened. Thanks a lot, keep saving lives!
@alisaquibraza6870
Жыл бұрын
@@parthsalat xD
@UECAshutoshKumar
2 ай бұрын
Understood!!! Thank You!!
@amanpatel8575
8 ай бұрын
Understood LIS Type from DP series. Thanks a lot Striver for making this series.
@rittwickbhabak7348
Жыл бұрын
Understood, Thank You striver, now I am very comfortable in the LIS patter. Thank you very much.
@raghavmanish24
27 күн бұрын
thanku striver ......finally ye bhi complete kr liya .....very close to finish this extra ordinary dp series .....thnaku thanku thanku striver
@Shivam-yp8xq
12 күн бұрын
Blessed to have ur channel bhaiya❤
@durgaprasad-gn4dk
2 ай бұрын
I understood the complete series. And I am confident about the LIS questions. Thank you for the explanations and the videos.
@shreyash184
4 ай бұрын
There is only one mistake in the video and which hampers the complete understanding of this question !!! Will refer some other video, Thanks for the content
@simranvedpathak7112
4 ай бұрын
True
@devendrapratapsingh6636
Жыл бұрын
UNDERSTOOD. Also a special thanks to the comment section for the help.
@girishbhargava6367
2 жыл бұрын
Striver, shouldn't the length of LIS till 6 should be 3, since {1 , 5 , 6} , {1 , 4 , 6} , {1 , 3 , 6} and so many other subsequences can be added. You have written 2 in the dp array. Please tell if I am thinking correct.......
@vipulmaheshwari2321
2 жыл бұрын
Yes you are. He did that by mistake.
@prabhakaran5542
4 ай бұрын
Understood ❤
@aayushranjan3675
Жыл бұрын
Sir, The LIS ending at 6 should be of length 3 and not 2
@mohaimenchowdhury
6 ай бұрын
Yes that part is confusing me every time
@sahilrepuriya3205
5 ай бұрын
Understood! i am now falling in love with your teaching style💙
@adarshanku7988
2 жыл бұрын
Pretty much comfortable on LIS. Thank you.
@KeigoEdits
4 күн бұрын
Did it on my own, Understood and thanks :)
@shinewanna3959
Жыл бұрын
Subscribed, u are really great, the reteriving focus from us is the best, best and clear explaination that I ever seen
@stith_pragya
8 ай бұрын
UNDERSTOOD......Thank You So Much for this wonderful video.......🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
@ritikshandilya7075
2 ай бұрын
Thanks for amazing thought process Striver
@hardikarora684
2 жыл бұрын
Thanks striver for this amazing series and also for this question as threre are less variation of lis available on youtube Kudos
@nilimsankarbora5911
8 ай бұрын
Understood LIS Type from DP series. Thanks a lot Striver for making this series. ❤❤❤
@shrishtysingh1853
Жыл бұрын
best explanation ever!!!!
@Abcd-jt1qs
2 ай бұрын
Understood Striver! Thank you so so much :)
@lakshmand8413
Ай бұрын
Very well explained
@adarshjain-wc9zv
3 ай бұрын
Thanks Feeling confident about LIS
@ritikshandilya7075
2 ай бұрын
Thankyou for amazing series Striver
@tempaccnt9128
2 жыл бұрын
Hi, thanks for helping each of us and sharing your valuable knowledge. Can you also make some short videos that will be helpful for revision of basic concepts, common problems, applying DP/DSA in daily life to relate problems?
@LBK3
Жыл бұрын
understood ❤
@twinklelight9829
5 ай бұрын
i have understood this series thank you striver
@mudavathsrikanth1944
Жыл бұрын
Thank you so much for this series.
@preetmhaski6317
2 жыл бұрын
Plz explain Binary search O(nlogn) approach for this problem.
@mohitsingh7793
Жыл бұрын
If u come from a CP background then is very habitual to understand the intitution very easily.Otherwise it is very difficult to understand it at a very first time.
@akashpal7748
Жыл бұрын
Understood
@VikashYadav-px8ei
Жыл бұрын
Understood 🎉
@energy_00
Жыл бұрын
I understood👍
@NoBakwas
Жыл бұрын
Thank you !! :)
@saurabhtiwari9614
2 жыл бұрын
understood bhai ... u teaches absolutly well sir
@nookalareshwanth1785
3 ай бұрын
Yoooo Great videso :0
@SWE_69
Жыл бұрын
if u have watch his graph series where we need to calculate the no of ways . you can understand how he uses
@chinu_.16
Жыл бұрын
Understood , solved without watching the video you are the besttttttttttt
@anmolagarwal5950
Жыл бұрын
Heavenly explanation!!!
@verma_jay
10 ай бұрын
understood
@cinime
2 жыл бұрын
Understood! Thank you soooooooo much as always!!
@XLR8_Aatma
5 ай бұрын
Understood very well😊😊
@LowkeyCoder
9 ай бұрын
understood and thank you !
@SahilAli-uq7ym
9 ай бұрын
Understood 👍
@harshbhardwaj2379
Жыл бұрын
As always understood . Great explanation sir. Thank you
@RohitKumar-dy2gc
10 ай бұрын
u made LIS so easy😎
@dhaya_98
2 ай бұрын
Bro teaching wrongly but confidently 💪
@DevashishJose
8 ай бұрын
Thank you, understood.
@prashantgoswami5321
2 жыл бұрын
Thank you sir for making this type of question so easy👏👏
@samridhigarg3489
2 жыл бұрын
Amazing videos, step by step approaches
@ratinderpalsingh5909
Жыл бұрын
Understood, sir. Thank you very much.
@coding8000
2 жыл бұрын
US, understood, thanks man,. Video is getting blurred in between.,, anyone else ?
@arihantjammar8888
10 ай бұрын
Understood 😊😊😊😊
@vasanthgk02
Жыл бұрын
Everything looks fine! What I am wondering is how I can get this intuition on the go?
@pulkitjain5159
Жыл бұрын
currently i am on 12:50 but not getting the intution till yet , i think what bhaiya is doing may be wrong but kuch itna samajh aya ki count for any value will be that na ki use chote bande dhoodho , unme se jiska maxTillYetLIS jitni baar occur karega wahi unka count hojayega , i mean for value 6 , the maxTillYetLis occured 4 times so Lis for 6 will be 3 but count will be 4 , kyuki abhi tak jo maximum lis chalta ara hai unme hi toh naya number add karenge honge unme hi toh add karoge. similarly , ab 7 ke liye maxTillYetLIS sirf 6 pe occur kiya and count for 6 is 4 only toh in charo me 7 jodd denge. now suppose kisi value ke liye maxTillYetLIS do baar occur kara hai aur dono pe hi unka count 4 aur 4 pada hai i mean ki array lelo {.............., 8 , 7 , 9} inse peeche 8 , 7 , 9 se chote numbers hai 8 ko include karke lis kuch banra hai aur count bhi kuch banra hai similiar 7 ko include karke lis kuch banra hai aur count kuch banra hai toh 9 pe kitne banege ? , offcourse count of 7 + count of 8 na kyuki tum 7 tak ke maximum ke aage 9 jod sakte ho aur 8 tak ke maximum aage 9 jod sakte ho aur koi option do dikhta ni , toh simple count m dono ka add kardo.
@jimspatel2407
2 жыл бұрын
Totally understand!! 😊
@niyammuliya5787
2 жыл бұрын
understood the all LIS varients.
@VinayKumar-ze2ww
2 жыл бұрын
Amazing video, well understood
@saurabhsangam2737
Жыл бұрын
Python Solution: def solution(nums, n): dp, count = [1] * n, [1] * n ml = 1 for i in range(n): for prev in range(i): if nums[prev] < nums[i]: if dp[prev] + 1 > dp[i]: dp[i] = dp[prev] + 1 count[i] = count[prev] # inherit elif dp[prev] + 1 == dp[i]: count[i] += count[prev] # increase the combination count ml = max(ml, dp[i]) ans = 0 for i,l in enumerate(dp): if l == ml: ans += count[i] return ans
@aeshwer
4 ай бұрын
UNDERSTOOD
@kumarpurushottam632
Жыл бұрын
Understood Thank You Striver❤
@PrashantKumar-wk1xb
Жыл бұрын
Bhaiya please make one system design playlist
@sarankumaar6009
Жыл бұрын
Iam happy was able to solve my self. I wrote the exact same code as yours :)
Пікірлер: 351