Bhaiya ye coding to theek h but ye jo interviews me dbms os etc. etc. Puchte h can you make one video of giving insights on how deep we need to study that when and from where we have to study? What subjects are asked??
Nice video ,🙌👍, just a request i am mentioning again, can u please a make video on dfs or minimum jumps to reach at the end of array, because that code requires how use a loop inside a recursion code(some what like backtracking)
Anuj bhaiya apka jo Java ka video the Apni Kakshya channel pe wo kyu remove ho gye suddenly ? please wo cource dubara apki khud ki channel me upload kijiye atleast ya fir fir se java ka video banayine jisme basic se advance ka topic cover ho just like Apni Kashya. Please reply jarur kijiye. It was great content. why removed ? 😭
I loved the way you explained the code and dry runned the code ... It is easy for us to understand the code . Such a wonderfull DSA course on UA-cam.
static int floor(Node root,int k){
Node curr=root;
int ans=Integer.MAX_VALUE;
while(curr!=null){
if(curr.data >= k) ans=Math.min(ans,curr.data);
// if(temp.data == k) return temp.data;
if(curr.data > k){
if(curr.left!=null)
curr=curr.left;
else
return ans;
}
else{
if(curr.right!=null)
curr=curr.right;
else
return ans;
}
}
return ans;
}
Thanks bhayia a learnt allot of from you
I appreciate your effort put in to teach us difficult topic in easy way
Thank you so much bhaiya for this video 😘
very nice process providing video .
At 1:48 why floor of 4 is (+Infinity)?
Same doubt
Hello Anuj… thanks for the wonderful series… Will you please start similar series on Graphs
Bhaiya can u please tell me how many topics are still left?
Bhaiya ye coding to theek h but ye jo interviews me dbms os etc. etc. Puchte h can you make one video of giving insights on how deep we need to study that when and from where we have to study? What subjects are asked??
Thanks bhai for such an amazing content...Also when will you start Dynamic Programming Questions?
Nice video ,🙌👍, just a request i am mentioning again, can u please a make video on dfs or minimum jumps to reach at the end of array, because that code requires how use a loop inside a recursion code(some what like backtracking)
same as Inorder successor and predecssor
Anuj bhaiya kya DP important he DS ke liye
Bhaiya i want to start you to teach us c++ language from zero please it's a humble request
Hello sir is course ka name kiya hai
Bhaiya plss videos thora jaldi dalia , placements start hone wala hi hai hamara....
Hello sir please send me your opinion about acciojob?? Should I join it or not??
Flutter dart roadmap
Anuj Bhaiya I need your help personally.
bhaiya please make video on next permutation problem (leetcode31)
bhaiya please new playlist add kariyea , placement question solved in laptop, explain on board which question in your sheet .
please, please please, please please, please please, please please, please please, please please, please
Anuj bhaiya apka jo Java ka video the Apni Kakshya channel pe wo kyu remove ho gye suddenly ? please wo cource dubara apki khud ki channel me upload kijiye atleast ya fir fir se java ka video banayine jisme basic se advance ka topic cover ho just like Apni Kashya. Please reply jarur kijiye. It was great content. why removed ? 😭
Second 😂❤️
C++ and java kis par based hai
Hi, this is primarily based on Java. but you can continue in C++ as well. The Course is called The DSA One Course.
@@AnujBhaiya thanku bhai
App code ka
Melaye
First