Minimum number of jumps | Array | Love Babbar DSA Sheet

C++ Code Link : github.com/Ayu-99/Love-Babbar...
Python Code Link: github.com/Ayu-99/Love-Babbar...
Please like, share and subscribe if you found the video useful. Feel free to ask in comments section if you have any doubts. :)
#DataStructuresAndAlgorithms
#LoveBabbarDSASheet
#interviewpreparation
Minimum number of jumps solution
Minimum number of jumps Leetcode
Minimum number of jumps C++
Minimum number of jumps C++ Hindi
Minimum number of jumps Hindi
Checkout the series: 🔥🔥🔥
👉 Recursion : • Recursion
👉 Stack and Queue : • Stack And Queue
👉 Greedy : • Greedy
👉 Leetcode contests : • Leetcode contests
👉 Leetcode June Challenge : • Leetcode June Challenge
👉 Leetcode July Challenge : • Leetcode July Challenge
LIKE | SHARE | SUBSCRIBE 🔥🔥😊

[@aasthagracy7022]

Really, you are explaining everything very clearly...Hope to see you with some more DSA videos!🙏🙏

[@MrDevOps]

Hey Ayushi, thanks for the awesome series !! Please continue 🙂

[@AyushiSharmaDSA]

Sure thanks 😊

[@hitenbafna5095]

Effort is real! Thank you so much!

[@AyushiSharmaDSA]

Thank you Hiten 😊

[@niteshshahi924]

Thank u for explaining it. Finally understood.

[@shubhamkumar170]

Thank you so much Ayushi. I had watched 4 videos before this one and was still confused. But your video finally made the solution clear to me!! God bless you 🙂

[@AyushiSharmaDSA]

Thank you so much Shubham 🤗🤗

[@latchireddiekalavya4683]

confused a lot , but you cleared all my confusion , thank you mam!!!

[@AyushiSharmaDSA]

Welcome, glad it was helpful 😊

[@siddharthrai3486]

pura youtube search kiye koi itna accha nhi smjhaya .....

[@siddharthrai3486]

thanks a lot aap mera depresssion kam kr diye
yeh qs solve kr liye

[@shreyvardhandhiman]

Very Very simple and easy explanation. Thankyou Ma'am

[@AyushiSharmaDSA]

Welcome. Glad it helped :)

[@code-a-mania4100]

Vah yaar samaj gaya akhir!!thanks sub. Kr diya hai abhi apbhi mere dsa teacher me add ho gaye!🙂

[@edryn9368-cj5zb]

Very well explained!!!

[@sanketmane5838]

Great explanation, Thank you mam.

[@babhijit]

Good approach. Basically you are trying to simulate BFS like traversal.

[@meeraraj2163]

Can you please explain what do you mean by steps here? And when you say " Aaage badh rhe hai toh steps ghata denge". I don't understand why we are decreasing the value of "steps" variable (

[@VishalGupta-ki8dd]

same doubt.....

[@hariommishra4547]

Here the question states that if the element is 'n' here can take a leap of maximum n number means if the a[i] =5 we can take step 0 or 1 or 2 or 3 or 4 or 5.... So if we want to iterate till the step,,, we are first storing ar[5] in step variable then we are decreasing to iterate till the next 5 position

[@satyampatil7969]

Steps means possible choices to land so that after jump you get maximum reach

[@sahilsingh716]

Great effort keep it up!

[@AyushiSharmaDSA]

Thank you :)

[@gandhijainamgunvantkumar6783]

best explanation...Thanks for amazing explanation

[@AyushiSharmaDSA]

Welcome! glad it was helpful :)

[@abul_khasim1730]

I have never seen this kind of explanation. thanks

[@AyushiSharmaDSA]

Thanks a lot 🤗

[@Dineshsharma-ec6ys]

Tysm .I admire how u explained everything with patience.

[@AyushiSharmaDSA]

Thank you Dinesh😀 Glad it was helpful!

[@saurabhnikam]

Great explanation ma'am !

[@AyushiSharmaDSA]

Thank you :)

[@gouravkumar7949]

Add this in DP playlist as well :)

[@madhurimachowdhury9536]

Thank you soo much , finally understood the problem solution

[@AyushiSharmaDSA]

Welcome Madhurima😊

[@tanishsharma5440]

Thankyou mam, Much better explanation than Apni kaksha! I mean it

[@AyushiSharmaDSA]

Welcome Tanish, glad it was helpful :)

[@rabindradocument8934]

Gfg

[@ajit287]

Great explanation Hope to see more problems....

[@AyushiSharmaDSA]

Thank you :). Yes, I will try my best to cover the sheet asap

[@NitinKumar-gv4hs]

thanks Ayushi was nt able to understand this today while trying

[@AyushiSharmaDSA]

Welcome. Glad it helped :)

[@iambasera]

itna confuse kyu ho rhi h bhen tu sahi smjha rhi h 😂 or sbko smjh bhi aara h kudos 🎉

[@anshumansharma1069]

55 jump game Leetcode
Thank you so much for this wonderful video❤️🧿

[@AyushiSharmaDSA]

Welcome Anshuman, glad it was helpful 🤗🤗

[@aasifali9139]

thanks for the video.

[@rachaelgreene762]

thanks yaar ayushi. It was indeed helpful

[@AyushiSharmaDSA]

Welcome Shivani :)

[@RAHULKUMAR-rs5he]

in that some confusion i not understand properly in that my fault
but you explained very well. thank you

[@MusicbyMangesh]

perfect vidio finally

[@ashwani_kumar_rai]

really awesome explained thanks

[@AyushiSharmaDSA]

Thank you, I'm glad it was helpful :)

[@yourentertainer19]

why can we write if(maxreach>n) return jump;

[@RAJENDRASHARMA-xt8uu]

Very nice explanation thanks

[@AyushiSharmaDSA]

Welcome Rajendra, glad it was helpful :)

[@sanushgowdabr7217]

Plz Provide intution for this approach

[@kamleshlohani6149]

very nicely explained :)

[@AyushiSharmaDSA]

Thank you :)

[@InderjeetSingh-eb8py]

great explanation :D

[@AyushiSharmaDSA]

thank you :)

[@siddhartharawat7354]

great explaination

[@AyushiSharmaDSA]

thanks, glad it was helpful :)

[@sattwickghosh0697]

u explained it the besttt.

[@AyushiSharmaDSA]

thank you, glad it was helpful :)

[@sachinbagga5916]

Great Aayushi

[@AyushiSharmaDSA]

Thank you so much sir😃

[@testaccount3310]

Good upload

[@tusharvaish8096]

thanks finally samajh me aa gya .

[@AyushiSharmaDSA]

🤗🤗 welcome

[@tusharvaish8096]

@@AyushiSharmaDSA mam please iske recursive solution explain krdo.

[@bharatnihar]

Great teaching skills,Nice Explanation 😊

[@AyushiSharmaDSA]

Thank you :) . Please share channel with your friends and juniors 🙏

[@urvishrupareliya8210]

Nice Explanation

[@AyushiSharmaDSA]

Thank you Urvish, glad it was helpful :)

[@ujjwalgupta8725]

Not explained clearly. You are just dry running the code and not telling the intuition and reason behind it.

[@rahul08it]

When our maxReach becomes >= arr.length, can't we return jump from there rather than traversing whole loop?

[@m.kaviyarasanshan789]

Your videos and explanations are awesome mam please upload videos in English mam

[@OmSingh-ro2mj]

THANX

[@ICHIBAN722]

Thank you

[@AyushiSharmaDSA]

Welcome 🤗

[@aniketkirar1194]

thank you ma'am 😇😇

[@AyushiSharmaDSA]

Most welcome 😊

[@abhishekjagtap1069]

Queen🛐

[@AyushiSharmaDSA]

😊😊

[@jaykotak2698]

At index 3 maxReach=11 which is >=n-1, which means that we can reach at least at index 11(even if it does'nt exist) also we are taking maximum steps at each index, so we can also reach index 10 i.e last index so even after that why do we still continue?

[@AyushiSharmaDSA]

You can try adding a break after that and check if all test cases pass

[@jaykotak2698]

@@AyushiSharmaDSA No they don't. We get our answer after reaching at n-1 only.
What could be the reason?. I tried multiple cases but couldn't find the reason.

[@sidddddddoo7]

Your approach is correct, but implementation might be wrong, instead of break, just return jumps+1; also add a cehck initially that if arr[0]>=n-1 return jumps

[@sidddddddoo7]

Here is my implementation:
public class MinimumNumberOfJumps {
private static int getMinimumNumberOFJumps(int arr[]){
int n=arr.length;
if(n=n-1)
return jumps;
for(int i=1;i=n-1){ // We already have the last index inside the current radar from this ith element.
return jumps+1;
}
steps--;
if(steps==0){
// Before moving to the next jump, we check if we have reached zero valued elements and have reached index>=max_range
if(i>=max_range)
return -1;
jumps++;
steps=max_range-i;
}
}
return jumps;
}

[@shamssalehin2376]

why I don't know but I found it very difficult to understand?

[@om-qx7wo]

me also

[@AnantKumar-qf2ep]

The way you explained is quite impressive... just reiterating like others, I too had watched other videos but got clarity by watching this.. Subscribing to your channel right away.. Keep doing good work...keep inspiring...kudos!!

[@AyushiSharmaDSA]

So nice of you , thanks Anant 🤗🥹🤩

[@anveshreddy1245]

Sis from where can we practise questions coding which are asked in accenture, tcs , tech mahindra, wipro .

[@AyushiSharmaDSA]

check from gfg, prepinsta or faceprep

[@sandeepns4732]

It would be better if you could share the link to problem as well in the description!

[@AyushiSharmaDSA]

Okay. Thanks for suggestion. I will do from next video.

[@priyankajhamb7061]

Great teaching method..
Do you have any example for which we cannot reach to the end and we have to return -1? for the edge case of i>=maxreach?

[@ss-ny2oh]

2 1 0 3

[@rupalisharma2674]

Can you get this.. please explain

[@harshthakur9890]

@@rupalisharma2674 arr[0] :- step = 2, so we can move 1 step or 2 step. with the 2 step we reaches 0 , and with step 1 we reaches 1 and after one there is only one 1 step . with 1 one step we reaches 0 .
with both cases the solution is not possible thats why i>=maxrech, beacuse at zero maxreach =0, and i=2.

[@rupalisharma2674]

@@harshthakur9890 ohhk.get it... thankyou so much 👍🏻😇

[@abhishekrawat664]

Op yrr🧡🙌

[@AyushiSharmaDSA]

Thanks Abhishek :)

[@alt-f4gaming222]

Thank u so much , im just one year late in watching this video 😅😅 ....

[@AyushiSharmaDSA]

It’s never too late brooo, glad u liked it 🤗🤗🤩

[@okbye6979]

Can you please tell the time complexity of this approach? Thanks for the video btw!

[@harshthakur9890]

Time Complexity =O(n)

[@akashkumardas1130]

Very Good Didi...
just one thing...mention if it is greedy or dynamic in thumbnail pls

[@AyushiSharmaDSA]

Thank you Akash, sure :)

[@AmanSharma-vb5jl]

thanks

[@AyushiSharmaDSA]

Welcome :)

[@bhagyashrighuge4170]

one edge case is missing in python code
if len(arr) = 1
return 0

[@saunaknandi1814]

What u use for writing? Mouse or some type of other device

[@AyushiSharmaDSA]

Hi, I use mouse

[@sohel4633]

Nice

[@AyushiSharmaDSA]

Thanks :)

[@jaskaransingh5346]

Thanks mam
And those who are not understanding why i>=max
for them just use this
if(step==0){
step=maxReach-i;
if(step

[@AyushiSharmaDSA]

Thanks Jaskaran 😊🙌🏻

[@DhananjayKumar-vn5tc]

thx

[@AyushiSharmaDSA]

Welcome, glad it was helpful :)

[@tusharvaish8096]

How can a begginer will get this logic ?

[@aayushreejaiswal1568]

i didnt get this step
if( i>=max_reach )
return -1

[@avdharna1978]

no ones intuition clear in this question, just every one copied solution from gfg and making dry run here. please dont do this.

[@Rohitrootn]

you are only explaning the the code not the intution ,though efforts are lot !!

[@fuehrercheem2447]

The time complexity of the brute force approach is n! not exponential

[@shambhavisharma6283]

can you please explain line no 31 in more detail?

[@mohitkumarsuman8224]

edge case should be
if(n==1){
return 0;
}

[@Prathmeshnandurkar]

why can't we replace (maxReach - i) with just arr[i] ???????????????????????????

[@dhruvratra992]

Mam jo questions interview mein ask karte hai interview mein woo maximum questions leetcode ke hote hai yaa other platforms ke

[@AyushiSharmaDSA]

It's not specific.

[@dhruvratra992]

@@AyushiSharmaDSA okay mam

[@vatsalsrivastava4001]

Why do we write if(i>maxreach) condition pls explain

[@rishireji4313]

condition when the maxreach cannot reach the end or of a zero is present in between.

[@shreyashmalu2491]

It's Not DP based solution right? Because in DP based Solution The Minimum steps to reach to current element should be calculated from Minimum jumps of Previous elements.

[@kapil4457]

You can do with dp too as follows :
class Solution{
public:
int minJumps(int arr[], int n){
// Your code here
vector dp(n, 1e7+1);
int ans = solve(arr, dp, 0 , n);
if(ans == 1e7+1)return -1;

return ans;
}

int solve(int * nums, vector& dp, int pos , int n) {
if(pos >= n - 1) return 0;
if(dp[pos] != 1e7+1) return dp[pos];
for(int j = 1; j

[@tbmsahil8850]

kitna confusing ha yrr aap khud itna confuse ha baccho ki samjhao gi dii dii

[@ShivaniGupta-xj1sp]

Correct

[@tbmsahil8850]

@@ShivaniGupta-xj1sp which year

[@manasjena5124]

Bro your mind is so much disturbed and only thinking about lost things .so you are not able to understand this problem

[@tbmsahil8850]

@@manasjena5124 I a study platform so I am not saying anything but oversmart bna sa Tera Ghar nhi chalega

[@girdhar3224]

crisppp

[@m.kaviyarasanshan789]

Why if (i>=maxReach) explain in English mam

[@user-gq1ij]

wont work for the array 2,1,1

[@laxmidawane7892]

class Solution
{
public:
int minJumps(int arr[], int n)
{
int jump = 0,i=0,k=arr[0];
do
{
jump++;
i=i+k;
k=arr[i];
}while(i

[@Lokesh-po5jr]

Because in this code you always jump maxi no. If you on a place where 3 is present you jump only 3step not 2 or 1step if on 1step 9 is present and on 3step 1is present. you need first 1step then 9step not 3step then 1step

[@growmore1672]

step = maxReach - i;
if (step == 0) // for 2 1 0 3 test case
return -1;
&&
if (i == maxReach) // for 2 1 0 3 test case
return -1;
step = maxReach - i;
are same .
ab hum aagge steps he nahi le sakte toh return -1.

[@girdhar3224]

how to code this

[@vaibhavvanjani619]

@@girdhar3224 if (n

[@mayankjoshi8888]

Striver bhaiya ki sheet ke question bhi solved kijiye plz

[@AyushiSharmaDSA]

Hi Mayank, actually striver is solving that sheet, but kafi common ques hai, I will cover them. Thank you for suggesting. :)

[@mayankjoshi8888]

@@AyushiSharmaDSA ohk thanks😊💯

[@SHASHANKRUSTAGII]

Better than the Code explainer. I was fed up of this stupid voice. Good work

[@AyushiSharmaDSA]

Thank you :) glad it was helpful

[@SHASHANKRUSTAGII]

@@AyushiSharmaDSA yes it was and soon i am going to interview you on my youtube channel. If you are ready, please accept my LinkedIn connection request mam.

[@deepakkumarthakur8429]

The fumbles in between the explanation creates a lot of confusion.😣

[@jivanninawe3190]

Mam hindhi may padho na recurion 😁

[@akshaycodex9568]

badhya bateye laiken manna padga

[@anilph6389]

not good

[@deepakkumarthakur8429]

10:04 9+8 is 18 (mistake)

[@AyushiSharmaDSA]

😅😅

[@ravindrayadav6103]

chatgpt se chaap diya

[@harishreddythalla]

9+8=18 at 10:03 😂

[@AyushiSharmaDSA]

😂😂😂

[@chillmaccha6392]

Can u please explain in English

[@AyushiSharmaDSA]

Hi, Sure, this was old video, new videos are in English :)

[@praneeth871]

Referal milegaa kya

[@AyushiSharmaDSA]

Zaroor milega, job id Aur resume bhejo linkedin pe

[@karthikmamidishetti2528]

plz dont show the solution at the starting of the video .because i am to trying come up with the solution if you show the solution directly at the first i am getting the hints. plz cover the code and at last show mw the code(you are killing my thinking of the approuch.

[@AyushiSharmaDSA]

Hey, sure think, usually in my videos, I show code at end only. :)

[@hemesh5663]

could you explain i >= maxreach condition if possible

[@AyushiSharmaDSA]

If current index becomes greater than maxreach, then it means that we got minimum jumps

[@hemesh5663]

@@AyushiSharmaDSA so why are we returning -1 then

[@AyushiSharmaDSA]

@@hemesh5663 sorry, in the problem, we have to go till end, so if i had become greater than max Reach, so this is not ideal case as i should be less than max reach

[@AyushiSharmaDSA]

Dry run once with a test case

[@hemesh5663]

@@AyushiSharmaDSA so basically that condition will work if we encounter a zero right in our path that what I understood correct me if I am wrong pls