Hi Santhosh. Your generosity and kind words mean the world to me ❤️❤️❤️ I will try my best to work even more hard to post more quality contents. Thank you 😇❤️🙏
I have never seen anyone doing a dry run this clean and sharing literally EVERY MINUTE DETAIL. I want to salute you for your consistency, dedication and patience ❤
Problem mast tha, itana hard nahi tha. Lekin question samajna usko solve karne se zyada hard tha. Isiliye mene aapka video dekha question samaj ne ke liye aur khud hi code kiya solution dekhe bina aur accept bhi ho gaya, aapke lectures bot helpful ho rahe he, me literally meri past-self se zyada achha perform kar raha hu. Thank you!!!!!
month starts with Recurrsion and ending with recurrsion also. In between the time period i have learned a lot of things from u. So thanku for everything sir.
@codestorywithMIK sir even though I don't know much about dsa, as I just completed 12; I still watch ur videos for ur better reach... Many people regret that they found ur channel late.. But even before my first semester starts, I feel very lucky that I found ur channel. Sir...
this is the first hard question I was able to do by myself I just needed the explanation of the question. the test cases were not soo helpful initially. Watching your previous 50+ DP videos surely helped :)
Excellent Solution mik bhai. I was close with the recursion part aka our khandani tareeka but was not able to figure the map intuition. love you bhai ❤❤❤❤🚀🚀🚀🚀
This question was way too easy because of your DP concepts playlist I was able to solve this on my own.🤝 One request please make similar concepts playlist for other topics also. It will be really helpful😍
I have made this question by own but still watching videos. One request from community : Sir can u please start to make the videos on weekly and biweekly leetcode contest solution ??
bro can you take this problem next Maximum Number of Non-overlapping Palindrome Substrings-2472 I was able to solve this problem but with time limit 2400 ms and beats just 5% I want to know your approach , and this problem is also very nice Thank you problem
first time k 1 hoga fir max k+1 hum usse bna skte ek baari mai so it will be 1 then 1+1=2, then 3 then 4 then max till stones length cuz k+1 hum utni baar hi krenge jitne stones ho skte hai
Hey Nikhil, I usually am not able to give contests because i travel during weekends mostly to give myself some rest. Also due to travelling my Sunday POTD videos are delayed (posted after noon) However i will solve them for sure when I am back home.
Hey @@aadil4236 , Currently Jaipur. And next month I will be going out of India for few months for traveling and some work as well. However, I will be posting videos for sure ❤.
Since the competition is increasing, I would suggest you to get good hands on dev side things as well or you can get basics of System Design as well. It will help a lot in future. You can choose the topic but it is always a good option to be good in multiple things + DSA.
result = result || solve() We call solve for 3 different possibilities. If anyone of the possibility returns True, we want the result to be true. So, taking or ‘||’ helps to achieve that.
I've seen a ton of your videos over past few weeks and they are GOLD. Keep up the great work man! 👏
Honestly wish that your channel has more reach!
Hi Santhosh.
Your generosity and kind words mean the world to me ❤️❤️❤️
I will try my best to work even more hard to post more quality contents.
Thank you 😇❤️🙏
Hi @saisanthosh8694 I am not aware how you did that (
True. The best I have found yet online.
@@wearevacationuncoverers super thanks button aside to download button
I have never seen anyone doing a dry run this clean and sharing literally EVERY MINUTE DETAIL.
I want to salute you for your consistency, dedication and patience ❤
Wow, thank you! ❤️😇
Problem mast tha, itana hard nahi tha. Lekin question samajna usko solve karne se zyada hard tha. Isiliye mene aapka video dekha question samaj ne ke liye aur khud hi code kiya solution dekhe bina aur accept bhi ho gaya, aapke lectures bot helpful ho rahe he, me literally meri past-self se zyada achha perform kar raha hu. Thank you!!!!!
Thank you so much 😃❤
Kya gajab ka explanation dete hain sir aap👏 unique solution and way of teaching.
Thank you so much ❤😊
iPad PDF Notes - github.com/MAZHARMIK/Interview_DS_Algo/blob/master/iPad%20PDF%20Notes/Leetcode-403-Frog%20Jump.pdf
**************************************** JAVA ****************************************
//Approach-1 (Recursion + Memo) - T.C : O(N^2)
class Solution {
HashMap mp = new HashMap();
int t[][] = new int[2001][2001];
int n;
boolean solve(int[] stones, int curr_stone_index, int prevJump) {
if(curr_stone_index == n-1)
return true;
boolean result = false;
if(t[curr_stone_index][prevJump] != -1)
return t[curr_stone_index][prevJump] == 1;
for(int nextJump = prevJump-1; nextJump 0) {
int next_stone = stones[curr_stone_index] + nextJump;
if(mp.containsKey(next_stone)) {
result = result || solve(stones, mp.get(next_stone), nextJump);
}
}
}
t[curr_stone_index][prevJump] = (result ? 1 :0);
return result;
}
public boolean canCross(int[] stones) {
n = stones.length;
if(stones[1] != 1)
return false;
for (int i = 0 ; i < stones.length; i++) {
mp.put(stones[i], i);
}
//Mark all states as -1 to denote they're not calculated.
for (int i = 0; i < 2000; i++) {
Arrays.fill(t[i], -1);
}
return solve(stones, 0, 0);
}
}
month starts with Recurrsion and ending with recurrsion also. In between the time period i have learned a lot of things from u. So thanku for everything sir.
Always a pleasure to see such comments 😇❤️🙏
You are just mesmerizing. Itna patiently koi kaise parha sakta ha. hats off to you
I always wait for your video. This is the best explanation I found so far since morning.
It's only because of you I am able to solve such ins on my own. Thank you LEGEND
"Khandani Tareeka" - Never heard this before by literally anyone 😅 But it's unique.
Hats off to your unique style of teaching
@codestorywithMIK sir even though I don't know much about dsa, as I just completed 12; I still watch ur videos for ur better reach...
Many people regret that they found ur channel late..
But even before my first semester starts, I feel very lucky that I found ur channel. Sir...
Same. I feel so lucky to have found this channel
It means a lot. Thank you so much 😃❤
@@codestorywithMIK still waiting sir kab aayega video
Travelling back to home. Video will come tonight
@@codestorywithMIK ok sir
full video OP hai bhai
Thank you so much Sajal ❣
I have done this question by my Own Thanks Bhaiya Again For Great Explanation
Thank you ❤️❤️🙏
I saw two more videos before watching this video and unable to understood problem. but your explanation made it easy.
❤️❤️🙏🙏
Out of the world explanation
This videos shows why Dryrun is most important until then problem seems difficult .Thankyou sir
Thank you 😇🙏
this is the first hard question I was able to do by myself I just needed the explanation of the question. the test cases were not soo helpful initially. Watching your previous 50+ DP videos surely helped :)
class Solution {
public:
unordered_map mp;
int n;
int t[2001][2010];
bool solve(vector& stones, int idx, int k){
if(idx>=n){
return false;
}
if(idx==n-1){
return true;
}
if(t[idx][k]!=-1){
return t[idx][k];
}
bool subOne = false;
if(k-1!=0 && mp.find(stones[idx]+k-1)!=mp.end()){
subOne = solve(stones, mp[stones[idx]+k-1], k-1);
}
bool same = false;
if(mp.find(stones[idx]+k)!=mp.end()){
same = solve(stones, mp[stones[idx]+k], k);
}
bool addOne = false;
if(mp.find(stones[idx]+k+1)!=mp.end()){
addOne = solve(stones, mp[stones[idx]+k+1], k+1);
}
return t[idx][k] = subOne || (same || addOne);
}
bool canCross(vector& stones) {
n=stones.size();
memset(t, -1, sizeof(t));
for(int i = 0; i
I am the happiest person when i see such comments.
I am so glad you solved it on your own. ❤️❤️
Awesome bro! really top noch content
Finally did it by myself. Debug karte karte pura din nikal gaya. but last tak kar diya. ab chain ki nind le sakta hu😁😁
So glad 😇❤️
Keep up the hard work. Time will come when you and all of us will be able to solve problems in minutes ❤️❤️
You have explained it so damn clear and precise... Nice work man, subscribed
😇🙏❤️
Excellent Solution mik bhai. I was close with the recursion part aka our khandani tareeka but was not able to figure the map intuition. love you bhai ❤❤❤❤🚀🚀🚀🚀
Always welcome ❤️😇
Love and respect to all of you guys 😇
Thanks Sir 🙏
Most welcome 😇
Simply THE Best
Thanks a lot Mohit 😇❤️
This question was way too easy because of your DP concepts playlist I was able to solve this on my own.🤝
One request please make similar concepts playlist for other topics also. It will be really helpful😍
Definitely
Thanks a lot 😇❤️
Awesome 👍
❤❤waited
Thank you 😇❤️🙏
Superb 🎉
Thank you so much 😃❤
Got it boss❤
Great Explanation mik bhai❤❤❤❤
Thank you so much 😇❤️
Bhaiya can you please explain solutions of contests problems also because your explanation is superb
Sahi baat h, medium hona chaiye tha, kyunki khud se solve hogya 😆
one word i can say thanks :)🥰🥰🥰🥰🥰🥰🥰🥰
Thank you 🙏😇
❤❤❤❤❤
Thank You :)
You're welcome! 😇
I have made this question by own but still watching videos.
One request from community : Sir can u please start to make the videos on weekly and biweekly leetcode contest solution ??
Hey,
Have you posted the bottom up approach as well?
11:38 that hits hard🤐
Indeed ❤️
Sir when will guidance video come
Coming tonight 😇❤️
@@codestorywithMIK ok sir waiting
Class solution {
Public boolean canCross (vector >mpp;
mpp[stones [0]+1]={1};
for(int i=1;i
sir i solve 400+ question consisently and i cant solve new problem or i cannot understand the problem .so what i should do please suggest me?
bhai Dryrun Krke kr Approach clear rahega code
ho jayega .Solution ke peeche mat bhago just concepts strong karo .
Hi there,
I will cover these qns in my next Guidance Video Part-II
(Noted)
@@codestorywithMIK okk bhai
@@k.vabhavmishra okk
how you figure out that prevjump will go from 0-2001 in memorization as it can be 2^31 also na
why we take dp size 2001X2001 , since jumps can go upto 2^31-1
bro can you take this problem next
Maximum Number of Non-overlapping Palindrome Substrings-2472
I was able to solve this problem but with time limit 2400 ms and beats just 5%
I want to know your approach , and this problem is also very nice
Thank you problem
thanks++ ;
bhai kaise pta chala ki "k" ki max value stones.length jitni hi hogi?
first time k 1 hoga fir max k+1 hum usse bna skte ek baari mai so it will be 1 then 1+1=2, then 3 then 4 then max till stones length cuz k+1 hum utni baar hi krenge jitne stones ho skte hai
@@YashSinghal got it, thanks brother 🥰
Correct @Yash.
Thank you 😇❤️
class Solution {
public:
int n;
unordered_map mpp;
int dp[2001][2001];
bool canCross(vector& nums) {
n = nums.size();
for(int i=0; i
bhaiya aaj ka conest mai kitna question bna aapka?
Hey Nikhil,
I usually am not able to give contests because i travel during weekends mostly to give myself some rest.
Also due to travelling my Sunday POTD videos are delayed (posted after noon)
However i will solve them for sure when I am back home.
@@codestorywithMIK oh ok got it loved your explanation bhaiya😌
@@codestorywithMIK Wow! Where did you go? I love traveling too!
@@nikhilkumartiwari7973 Thank you so much 😃❤
Hey @@aadil4236 , Currently Jaipur.
And next month I will be going out of India for few months for traveling and some work as well. However, I will be posting videos for sure ❤.
class solution {
Public boolean canCross(int []stones){
int n=stones. length ();
boolean [][]dp=new boolean [n][n+1];
dp[0][1]=true;
for(int i=1;i
Brother as a student what should I learn along with dsa
Since the competition is increasing, I would suggest you to get good hands on dev side things as well or you can get basics of System Design as well. It will help a lot in future.
You can choose the topic but it is always a good option to be good in multiple things + DSA.
Did not understand the line
result = result || solve()
result = result || solve()
We call solve for 3 different possibilities.
If anyone of the possibility returns True, we want the result to be true.
So, taking or ‘||’ helps to achieve that.