Lecture Notes/C++/Java Codes: takeuforward.o...
Problem Link: atcoder.jp/con...
Make sure to join our telegram group for discussions: linktr.ee/take...
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 with K distance allowed. I have taught you how you should write a 1D recurrence. This problem is a follow-up to Lecture 3's follow-up question.
If you have not yet checked our SDE sheet, you should definitely do it: takeuforward.o...
You can also get in touch with me at my social handles: linktr.ee/take...
Негізгі бет DP 4. Frog Jump with K Distance | Lecture 3 Follow Up Question
No video
Пікірлер: 2 М.