Minimum number of Jumps to reach end of an array (DP approach) | Q10 | Love Babbar DSA Sheet

#coding #competitiveprogramming #interviewquestions #dsaseries
In this video I have explained the 10th problem.
Here I have explained DP approaches whose time complexity is O(N²).
One more approach is their whose time complexity is O(N), Link of the video-- • Minimum number of Jump...
String question Playlist = • Love Babbar DSA 450 Qu...
Array question Playlist = • Love Babbar DSA 450 Qu...
Love Babbar DSA sheet : drive.google.com/file/d/1FMdN...
Hope you like it. If have any doubt then just comment down below.
LIKE | SHARE | SUBSCRIBE

[@amartyachoudhary6793]

I find O(N) solution much tougher than DP one. Can't understand it

[@ishanikasingh9321]

Great solution!

[@abhishek2116]

bro i am having TLE in gfg, should i go O(n)}? need some modifications?

[@hirakmondal6174]

Is this solution currently being accepted by GFG? In my case it is giving TLE for this O(n^2) approach, though it was accepted few months back.
Kindly confirm.
I guess they have now set the time constraints w.r.t O(N) solution.

[@AyushGupta-kp9xf]

agree.. i tried just now, it isn't accepting it now

[@rachitjain4985]

@@AyushGupta-kp9xf yes, I'm facing the same issue

[@ankitsharma8078]

The approach discussed here is o(n^2) dp that will not pas gfg . Gfg requires o(n)

[@rohankumar393]

Watch rachit jain's video, he has done this problem using dynamic programming.

[@ayushagrawal6473]

Bro, please try that once more in the GFG I guess constraints are changed and you might get TLE this time.

[@jolly_dollyyy]

same issue

[@ayushagrawal6473]

@@jolly_dollyyy try the other approach.
I guess they have uploaded a video for nlogn solution.

[@captainamerica2992]

thanks alot u are awesome

[@SushilaDevi-zp9le]

Osm video 👍👍

[@pranaykrmajee1432]

can someone explain why we are adding 1 in line 29?

[@prasannathapa1024]

🔥🔥🔥

[@CodeLibrary]

Thanks

[@abhishekprasad9276]

U guys are great 🔥

[@CodeLibrary]

Thanks

[@sonishaw]

Good .

[@rishikayadav5622]

How to remove driver code on gfg

[@sudinjana4402]

Please make a video series about dynamic programming and greedy algorithm please vaiya I can't solve the question from DP and greedy

[@CodeLibrary]

After this series we will be uploading videos related to dp also

[@its_neel_ok]

one Q how are u pasting your own code in IDE. most of the Q tells us to complete the function instead of writing the code from scratch :(

[@bhaveshsoni9140]

pls make video on minimize the heights question.

[@CodeLibrary]

ya we will make that shortly😀

[@SushilaDevi-zp9le]

Great 👍👍

[@CodeLibrary]

Thank you 👍

[@Arora-Sir]

I've tried with DP approach on my own. That shows Time limit exceed.
Then found this approach and then again time limit exceed. Yuo've really explained it well ❤
abhi going to watch your last video of O(N) hope that works :/

[@Jk-tr1fb]

@Codelibrary please complete the course fast ,I'm final year student

[@priyanshushrivas9534]

got TLE with this code

[@RaxyzGaming]

Bro i solve with complete O(n) till got TLE

[@yash_verma]

you can make video in 1080p

[@shivangisingh2297]

Can you tell me how do we get to know where to apply dp

[@anshulgarg6146]

jha par overlapping subproblems dikh rahi ho

[@divyanshpurohit4556]

nicely explained ...bas number of steps/jumps ko number of ways bol rhe the is liye confusion ho rahi thi thodi

[@pawankanttiwari8173]

well explained bro
Keep it up

[@CodeLibrary]

Thanks 🙂

[@dutt_2302]

@@CodeLibrary plz share the code recursive way

[@rohandevaki4349]

whenever i see these type of questions, I always think of recursion method and not dynamic programming , how to think a solution for dynamic programming, it is very tough to think a solution for DP
please give any suggestion or tutorial on DP with examples

[@shivanshuamitabh831]

Check Aditya Verma DP Playlist!

[@rohandevaki4349]

@@shivanshuamitabh831 link ?

[@shivanshuamitabh831]

czcams.com/play/PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go.html

[@soumavanag5025]

try to draw the recursion tree, if u find same subproblems , then its dp, i,e, use memoization

[@sanjeevkumarray1941]

plz explain o(N) make a video and also write code java

[@CodeLibrary]

We have uploaded O(N) solution go and have a look to our channel 😀

[@Southground]

why you skipped 9th one?

[@bhargavsai2449]

why is it dp[j]+1
Somebody plz

[@dibyendubar8920]

TLE!!!!!!!!!

[@sagargoyal7540]

TLE Op

[@dailydestress6189]

Cant get it from your explanation . IDK why : (

[@deepanshukumar7290]

n wale video banao

[@CodeLibrary]

We have uploaded O(N) solution go and have a look to our channel 😀

[@56_shekharshinde84]

bhai please make videos in hindi

[@sanjeevkumarray1941]

plz java code

[@CodeLibrary]

Actually if we write in all languages then video will become long... that's why try to understand the logic and implement by yourself.😀

[@nandhinirajavell9747]

Bro please upload videos in English alone. As it can be understood by everyone.. I understood your previous videos but not this one.

[@sanjivmadhavan5705]

Don't just assume the entire world knows Hindi

[@ashishkumaryadav5252]

bhaiya, hindi use kara karo, usme bestter samaajh me aata hai

[@kartikchausali1598]

Are ye jabardasti ki english bolni jaruri h kya
Seedha seedha hindi m smjha do agr nhi bola jara english m toh

[@amyanktiwari]

Bhai mai bhi yhi soch rha tha ,pr shadad South walo ke liye bolta hoga English me shayad

[@yogeshyts]

@@amyanktiwari m bhi same yhi soch rha tha

[@gokulnaathb2627]

@@amyanktiwari 💝

[@RaxyzGaming]

Bhai yrr tu boht confuse krta hai yrr

[@mdzikrullah9575]

I really think you need to improve your explanation.

[@sanjaymadhavan1893]

Talk in English/Hindi. Half way through, changing a language made this video useless

[@SaurabhSingh-wp2cm]

bakwas