Lecture Notes/C++/Java Codes: takeuforward.org/data-structu...
Problem Link: bit.ly/3JPcoOx
Make sure to join our telegram group for discussions: linktr.ee/takeUforward
Pre-req for this Series: • Re 1. Introduction to ...
Full Playlist: • Striver's Dynamic Prog...
In this video, we have discussed how to solve the frog jump problem. I have taught you how you should write a 1D recurrence. Also, I have given you a follow-up problem to which you can answer in the comments. We will solve that follow-up problem in the L4.
If you have not yet checked our SDE sheet, you should definitely do it: takeuforward.org/interviews/s...
You can also get in touch with me at my social handles: linktr.ee/takeUforward
Негізгі бет DP 3. Frog Jump | Dynamic Programming | Learn to write 1D DP
Пікірлер: 2 М.