Jump game | Leetcode #55 | Valley peak approach

This video explains a very important programming interview problem which is to find if it is possible to jump indices of an array and reach the last index of array or not. We have some given constraints which are, we can't jump from 0 valued index and that we always start at index 0. I have shown the solution using backtracking intuition and a very beautiful observation using valley peak approach. I have taken easily comprehend-able examples and finally explained the code for the same. As usual, CODE LINK is given in the description below. If you find any difficulty or have any query then do COMMENT below. This problem is from Day 25 of the leetcode 30 days April coding challenge. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
CODE LINK: gist.github.com/SuryaPratapK/...

[@techdose4u]

🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]
🔴 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/

[@preetibatra208]

To the world you may be just youtuber , but for us(learning geeks ";) you are the hero!! great work...

[@techdose4u]

Thanks for your appreciation 😅

[@rajatmishra6628]

🙌🏻🙌🏻

[@MadForCs16]

I thought you would say *To the world you may be just youtuber , but for us(learning geeks ";) you are our world!* xDDD

[@algorithmimplementer415]

I could not appreciate you more for your initiative of making video each day. BIG THANKS.

[@gurpreetchawla2066]

Whenever i am not getting clear Explaination of a problem in other channel , i jump to this channel and you solves it in such a way that anyone can understand comfortably .
You got the way of "How to Teach so that anyone can understands".

[@techdose4u]

❤️

[@pushkarkumarkanikicherla8812]

I just love the way you explain, even a novice programmer can understand the concept. Keep going.

[@techdose4u]

Thanks :)

[@hydieboyer886]

1:28

[@sajithtm4864]

Great explanation. Glad to see you posting more videos on DS.

[@ovipoddar2723]

You are an amazing teacher sir! Your all the explanations are beautiful and clears every concept! Words cannot describe your hard work!

[@techdose4u]

Thanks :)

[@shashankmehul02]

You are great man. Such simplification really helps a lot sometimes.

[@techdose4u]

Thanks :)

[@varunsadhu9060]

Dude, I made the mistake to look for a solution for this from other videos. But i must say i could only understand it by your explanation. Keep up the good work buddy.

[@techdose4u]

Thanks bro :)

[@rishabhpathak9916]

What an amazing teacher you are! Thanks a ton!!

[@techdose4u]

Thanks bro :)

[@soumitadalal6130]

The concepts you teach are so useful that I am bound to adore your vedios.. Keep teaching us like this.. And thanks a lot man..

[@techdose4u]

Welcome :)

[@mohammedsadiq5729]

Few more subscribers away from 10k!
Congratulations in advance!🤘🙌
This is just the beginning 💪😎

[@techdose4u]

Thanks bro :)

[@sajeesyed3384]

this lecture note is one of the masterpiece

[@ekengineer9868]

So cool explaination!
Impressed 🙌

[@6priyanshu]

very well explained...please keep uploading more such video's.....such explanation makes coding easier and interesting..thankyouuuuuuuuu

[@fullysimplified7139]

I can never thanks you enough as thanks is such a small word
I wish you all the best in your future journey

[@praveenchouhan6388]

you are the perfect engineer(also visualize physics) and nailed the intuitions of the approach !!!!!!!!!!!!awesome

[@techdose4u]

Thanks 😅

[@PersistentProgrammer]

Great explanation. I solved the same question today. I have linked your video in my description.

[@techdose4u]

Thanks :)

[@syamprasadupputalla8233]

Bro, trust me this is some serious content. So far, I have been solving problems with a different mindset and you blew me up. I have seen a lot of videos on Leetcode solutions, but never seen something like this, and explanation is very clear. Thank you so much brother :)

[@Code_Solver]

What an Explanation. Give a big round of Applause to this sir...

[@bookswithpriya]

Crystal clear explanation.. Thank you 🙌

[@ersinerdem7285]

wow, just wow! only thing I could add would be, exiting early after the reachable calculation by checking if you can reach the end.

[@unlockingitpotential575]

Your explanation understood KG level student ,that's a great work

[@AnantSanatanGyan]

this solution is just a master peace and you the master 🙌

[@willturner3440]

You again proof you are great, love u bro

[@downshots]

that was a great explanation i even dont need to see the whole video for getting the idea

[@AdarshSingh-vt4kw]

It would be much better if you also tell about the minimum number of steps required to move to at the end of the array

[@saket9363]

Thank you so much for all your videos! I am learning a lot!
Just one quick suggestion!
Can you please show the actual Leetcode question at the start of the video? It would be really helpful! Thanks once again!

[@techdose4u]

Actually the questions are easy to understand with lower constraints. So it would be very easy to understand. I read the questions first if it has more constraints.It saves TIME in video length 😅

[@scarywitcher]

finally understood brother. thanks to you

[@simmi641]

To the point explanation thank you ❤

[@alex-gz7ud]

Awesome explanation!!!! You saved my day!!!

[@techdose4u]

Welcome :)

[@Utkarshgg]

reachable

[@elasingh3151]

Great explanation! Please create more videos on leetcode problems.

[@techdose4u]

Sure 😃

[@indrajith2002]

bro you really explain with clarity just love it .Keep going

[@navinshyamkuwar9401]

Very Good Explanation.

[@ankitaraj1713]

Precisely explained!! Thanks!

[@techdose4u]

Welcome :)

[@shridivyasharma5536]

Very nice and neat explanation!

[@emmatime2016]

Great explanation! Thank you!

[@techdose4u]

Welcome :)

[@abhishekrai4325]

unique explanation ! Thank you sir

[@techdose4u]

Welcome :)

[@praphulyadav4471]

sir your explanation is awesome it becomes so easy to understand❤️👍

[@techdose4u]

Thanks :)

[@blitzkrieg5454]

Brilliant explanation!

[@rajendertanwar1881]

This explanation truly deserves ❤ 👍

[@techdose4u]

Thanks :)

[@phuwn]

awesome, thanks for this great lesson

[@techdose4u]

Welcome

[@skmixvlogs]

Great Explanation!!!

[@shantanukumar4081]

Amazing Explanation
Thanks bhaiya

[@ganeshkamath89]

Perhaps you can break the loop if the value of reachable reaches the last index, like this. Because, if at least one value reached last index then it is possible to reach the end.
if (reachable >= n - 1)
break;

[@harshpatel1385]

My coding skills improved a lot sir because of you❤

[@techdose4u]

Keep in coding and you will improve further :)

[@mystryb345]

Bro your every video has very good explanation.It is easy to understand

[@techdose4u]

Thanks

[@user-of7cs9vs8i]

its very easy and cool explanantion

[@hinata4661]

please upload the min jumps problem using dynamic programming. If already uploaded please share the link

[@charanpasupula3763]

After for loop I think we still need to have another if condition to check if reachable >= array.length - 1
otherwise this code is failing for the case of [1,0,1], do correct me if m wrong
edit: I was wrong in writing this condition in for loop i < array.length - 1 , it should be i < array.length

[@greyhat6599]

Great explaination Sir !
💝🔥

[@sagarksahoo4667]

explanation was very crystal clear, good work

[@techdose4u]

Thanks :)

[@creatorstudio5945]

Amazing explanation sir :))

[@pritishpattnaik4674]

Very much well explained

[@rbk.technology4747]

Really amazing

[@officialspock]

I wish I have your brain man, I wasn't able to think this kind of solution... you earn a new subscriber

[@techdose4u]

Thanks :) You will also be good in some time if you keep practicing.

[@RandomShowerThoughts]

great explanation

[@paragroy5359]

Nice explanation sir...thanks for the video

[@techdose4u]

Welcome :)

[@JaideepKumarSingh14]

Great explaination

[@CHIRANJIBNANDY1]

Dude... just an awesome explanation.

[@techdose4u]

Thanks :)

[@avinashpatil9662]

good explaination..totally understood the problem and its solution.

[@techdose4u]

Nice :)

[@zeinebkarma5038]

Thank you!

[@yaswanthp2294]

Again excellent explanation

[@tejaschougale5669]

Nice Explanation

[@dhanashreegodase4445]

I have no words to say ..lovely excellent video

[@techdose4u]

Thanks

[@marq_8976]

This is the solution that I can understand.

[@kabboghosh1853]

that's the best video on this topic ,sir plz upload some dynamic programming video

[@techdose4u]

Sure :)

[@prasenjitsingharoy9370]

Sir you are our savior and motivation 🙏

[@techdose4u]

Thanks

[@shridharsarraf2188]

Surya pratap sir, jab bhi leetcode se frustrate ho jata hun aapke videos dekhta hun. Aap itna calmly koi bhi problem batate ho aur that also calms me down. Lekin kya karun sir dp hai bhi aisa topic ki itni practice ke baad bhi basic medium questions bhi rula dete hain

[@575saisri4]

sir, u r really the best.. thank u so muchhhh..

[@techdose4u]

Thanks Sai :)

[@myvinbarboza3038]

So intutive love it

[@AMITKUMAR-nw5ns]

thank you sir, amazing.

[@RaviYadav-xg2hy]

we can also start from ending index of the array and keep updating the required jumps(starting from 1), and finally check for the first element if it has the required number of jumps !!

[@techdose4u]

Yes correct. Both ways are same only.

[@mr.naresh3004]

omg nice presentation to give us the logical intuition thankyou....

[@techdose4u]

Welcome 😄

[@arindamjain6892]

Thanks man!

[@divanshmahajan1769]

what will be time complexity of dp solution??

[@mikasaackerman2694]

Nice Explanation! Have you also uploaded a video of Jump game II(minimum jumps to reach end)?

[@techdose4u]

Not yet. I will make it once I start dynamic programming.

[@vibhasyadav6491]

@TECH DOSE please make a video on minimum jumps to reach the end.

[@monishnjs]

Wow, what a nice solution...thanks

[@techdose4u]

Welcome :)

[@codingwithneeraj1305]

exceptional approach have you thought of this approach on your own??

[@indian3412]

hey,
How do you develop such thinking and procedure to solve such problem.
Could you guide me how i can solve such tricky questions

[@rajbhushan3541]

good explanantion

[@beinghappy9223]

Thanks really helpful

[@vinaykumardahiya4260]

You might just be the best!

[@techdose4u]

Thanks

[@rajatbudania6181]

Loved it!

[@techdose4u]

👍

[@navyasri5077]

thankyou so much

[@abhijeetbhowmik2264]

How do we derive such methods on the spot. I tried this with recursion. Got TLE. Then tried maintaining a list which tells me what index I have already reached out to in previous recursion step to skip it. Then also TLE. And then here it is. Done in O(n). How to achieve this sort of critical thinking. You are awesome.

[@azizurrahman0375]

Sir, Why did you use pre-increment in for loop?

[@letsdoeverythinginoneweek9398]

how can we find max jumps to reach at end of array

[@rhinoara7119]

Another good approach with O(1) complexity will be start searching for 0 from ending of the array, when a zero is found check next number is greater than 1,if not check if its next greater than 2. Return false if this condition fails until index 0

[@funtalk4083]

Thanks sir. Great explanation.

[@techdose4u]

Welcome :)

[@AKASHSINGH-td7wx]

can you please give me the code of that backtracking approach u mention at the beginning...?

[@bestdeal3385]

thankuu sir you made this very easy 😃😃

[@techdose4u]

Welcome 😀

[@kamvatamia4146]

I like this video.

[@sugandhm2666]

Too good

[@stonecoldcold2941]

Really a great explanation

[@techdose4u]

Thanks :)

[@RohitThakur-oe6ws]

Thankyou for easy explaination

[@techdose4u]

Welcome :)

[@vivek.tiwary]

How many problems you solved to get the depth of this kind of problem? No one explained like you did. Thank you

[@avishekarora]

That's a really god solution