Thank you for this video, I almost figured out the solution but had gaps in my approach. Your approach has helped me alot! Cheers :)
@deepakjadli_47Ай бұрын
1 ques kya hum else wale part me lps[ ] array me ye bhi to kr skte hai else{ len = lps[ 0 ]; lps[ i ] = 0; i++; } please ans anyone
@TheAditya-zt9pbАй бұрын
Wow i needed clarity in the explanation and the way you have approached is just amazing..thank you so much
@dilipkumar2k6Ай бұрын
Bro, this was amazing.
@ashishchoudhary16643 ай бұрын
Great Explanation!
@89pravinb5 ай бұрын
Very well explained. This video covers all possible scenarios where a person can have doubts. Thank you!!
@PrashantSingh-qr3vn6 ай бұрын
I only have one doubt if s.find(make_pair(L-1,R)==s.end()) then we will enter the loop shouldn't we code it like this !s.find(make_pair()) in case it returns false means pair is not present then we enter the loop and code there
@rohithsinghthakur9686 ай бұрын
Nice explanation 🥰
@qR7pK9sJ2t6 ай бұрын
This is the best explanation video on youtube for this question.. Believe Me!
@ris_colid3258 ай бұрын
Can you please explain why can't we use vector of 3 elements instead of pair of pairs ,to push in the priority queue? Wouldn't the first element (zero index) always be used as comparison criteria in a priority queue of vectors?
@hiteshbhandari70098 ай бұрын
maze aa gaye
@Manishkumar-mw2zw8 ай бұрын
Nicely explained
@douglas526010 ай бұрын
Thanks!!!
@ujjvalsharma505511 ай бұрын
Great explanation. You deserve more views.
@ronakslibrary8635 Жыл бұрын
Good explanation for NCr
@RohitKumar-dy2gc Жыл бұрын
hardest question of heap becomes easy when you knows approach
@piyushaggarwal9484 Жыл бұрын
Good explaination
@adityaband6919 Жыл бұрын
thanks that diagonal concept was helpful
@harrypotterfan9188 Жыл бұрын
Superb explanation bhai❤
@satvrii Жыл бұрын
❤❤❤❤
@arindam1249 Жыл бұрын
nice
@yogeshwhetwar6345 Жыл бұрын
superb explanation 😄
@user-dg7pu8oo6v Жыл бұрын
Gazab himanshu bhai ekdam bawal solution dil jit liya yaar apne
@derekspecial1771 Жыл бұрын
Thanks bro ❤
@ThanujaDil Жыл бұрын
Finally understood that line. Thanks.
@mihirsaini592 Жыл бұрын
Great explanation sir. Really good.
@vikram2760 Жыл бұрын
Nice explanation, whats the time complexity of this soln?
@pro3757 Жыл бұрын
Spent hours looking up resources on this topic because of that single line. Even the nptel guys did not bother explaining the "why". Good job bro. Thank you! ❤
@VineetKumar-pj1bk Жыл бұрын
awesome explanation bro❤
@kavishdadhich6547 Жыл бұрын
great explanation
@arunchauhan891 Жыл бұрын
Dil se keh raha hu...bahut achi explanation kri bro aapne....why you stop making more videos ... 😖
@nitilpoddar Жыл бұрын
yahi toh chahiye tha
@wtfun5465 Жыл бұрын
very good and short explanation
@brahmarathod Жыл бұрын
Thanks man!!
@dontcopy1244 Жыл бұрын
useless video, atleast put Hindi in the title...
@LucaS-ri3zq Жыл бұрын
u are a fucking legend
@user-yh4762yp2dgh Жыл бұрын
Min heap
@user-yh4762yp2dgh Жыл бұрын
Bht pyara smjaya sir apne
@ThisisCuriousclue Жыл бұрын
hey!! nice>>> btw whats the time complexity of it?
@chuckmcgill6673 Жыл бұрын
Finally after 4 hours I am able to understand lps[len-1], thank you.
@RAHULYADAV-zr5fq Жыл бұрын
Great!!
@atifhu Жыл бұрын
paon kaha hain tumhare🙇♂
@himanshutripathi6323 Жыл бұрын
Bhai bhai bhai :p
@Timolate Жыл бұрын
3:50 is exactly what I am looking for, and not explained so clearly in other videos. Thank you for the clear explanation.
@aryanjaiswal7978 Жыл бұрын
Such a nice video Himanshu cleared all my doubts in one go , really appreciate it
@virajkapurkar2463 Жыл бұрын
Great!!! Keep up the good work
@pranjalshinde1586 Жыл бұрын
Editor, please increase its volume
@rajsharma65992 жыл бұрын
how can we use it for undirected graph ?? do we need to change anything
@parasjain825310 ай бұрын
U can always see an undirected graph as a directed graph by replacing each edge with 2 edges of opp dir
@dakshsingh58913 күн бұрын
maintain a parent and check if adjnode==par then graph[adjnode].pop_back() rest is same.
Пікірлер
Thank you for this video, I almost figured out the solution but had gaps in my approach. Your approach has helped me alot! Cheers :)
1 ques kya hum else wale part me lps[ ] array me ye bhi to kr skte hai else{ len = lps[ 0 ]; lps[ i ] = 0; i++; } please ans anyone
Wow i needed clarity in the explanation and the way you have approached is just amazing..thank you so much
Bro, this was amazing.
Great Explanation!
Very well explained. This video covers all possible scenarios where a person can have doubts. Thank you!!
I only have one doubt if s.find(make_pair(L-1,R)==s.end()) then we will enter the loop shouldn't we code it like this !s.find(make_pair()) in case it returns false means pair is not present then we enter the loop and code there
Nice explanation 🥰
This is the best explanation video on youtube for this question.. Believe Me!
Can you please explain why can't we use vector of 3 elements instead of pair of pairs ,to push in the priority queue? Wouldn't the first element (zero index) always be used as comparison criteria in a priority queue of vectors?
maze aa gaye
Nicely explained
Thanks!!!
Great explanation. You deserve more views.
Good explanation for NCr
hardest question of heap becomes easy when you knows approach
Good explaination
thanks that diagonal concept was helpful
Superb explanation bhai❤
❤❤❤❤
nice
superb explanation 😄
Gazab himanshu bhai ekdam bawal solution dil jit liya yaar apne
Thanks bro ❤
Finally understood that line. Thanks.
Great explanation sir. Really good.
Nice explanation, whats the time complexity of this soln?
Spent hours looking up resources on this topic because of that single line. Even the nptel guys did not bother explaining the "why". Good job bro. Thank you! ❤
awesome explanation bro❤
great explanation
Dil se keh raha hu...bahut achi explanation kri bro aapne....why you stop making more videos ... 😖
yahi toh chahiye tha
very good and short explanation
Thanks man!!
useless video, atleast put Hindi in the title...
u are a fucking legend
Min heap
Bht pyara smjaya sir apne
hey!! nice>>> btw whats the time complexity of it?
Finally after 4 hours I am able to understand lps[len-1], thank you.
Great!!
paon kaha hain tumhare🙇♂
Bhai bhai bhai :p
3:50 is exactly what I am looking for, and not explained so clearly in other videos. Thank you for the clear explanation.
Such a nice video Himanshu cleared all my doubts in one go , really appreciate it
Great!!! Keep up the good work
Editor, please increase its volume
how can we use it for undirected graph ?? do we need to change anything
U can always see an undirected graph as a directed graph by replacing each edge with 2 edges of opp dir
maintain a parent and check if adjnode==par then graph[adjnode].pop_back() rest is same.
Nice explanation bro 👍
good explanation man
Thank you!
Nicee bro
Thank you