Day 5 Done ✅ Congratulations Guys, if you are consistent from last 5 days because 5th & 10th day are the most difficult day of consistency ⚡ By the time you'll reach 21st day you will be champ. 👑 Hope this motivates you all❤😊
Points - 1. Basic solution is to use two pointers from middle, from ends OR reverse the string. 2. In recursion, we will only take the loop and convert it to recursion. i.e. we still will have left and right end chars in same call (and not have some mechanism to store and compare in appropriate number of call). L and R represent the substring which needs to be checked for substring. [hence the 0 and n-1 initial values as we need to check whole string at first.] 3. Since, we return boolean as final answer, we will return true/false in base and invalid cases (here base case is a valid case). For Induction step(where we make next call), we don't need to take and/or since this is a Unary recursion tree. *Note - Recursive solution is "inferior" to iterative solution in terms of space complexity (expected due to stack)
One small suggestion Fraz bhai ..!! The logic explanation is superb.! In one go I am able to understand. It would be good if you can explain the code also so that it will be easy for us to understand and this helps us to explain to interviewer also in much smoother way. Because these days interviewers are preferring the explanation of code which we write. I know it might look silly suggestion but it helps us a lot.
video best like previous.n/2 is write because there is 0 to 4 and all i assumen .baki no doubts.ur videos is like 6 baj gaya aaaj ka video chalo kar lete hai .im student .but ik working professional ke liye ye daily challange time ki waje se kaffi accha lag raha hoga superb bhaiya.consistent op
With this course, you are giving us more than DSA lessons You are teaching us discipline perseverance and to show up every day no matter what(which will stay for life) Thank you so much bhaiya♥
A small request Fraz to cover more in one video and also plz dry run the code for a few cases. Gives loads of insight like in last video you did ♥️♥️!!! #missionamazon
Bhaiya lectures are really good. Like as a beginner I am understanding this recursion series very well but pls suggest how to gain confidence over topic of time and space complexity
Thank you for so good digestible content. One request can you come up with a small scenario of real time project where we are using these DSA concepts. As of filling a form where next questions are based on previous one and have a concept of DSA. Thank you in advance...
I always do the problem using iterative solution 😂 learnt the recursion approach from this video. Thank you so much for hard work and regularity. Keep on doing that, enjoying so much big bro ❤️❤️
@@LearnYardYT Yeah i love these videos so much because I badly waiting for such bootcamp which covers everything and not wasting time much. I know how you work hard for us. So it is a greatfulness towards you. ❤️
Can you share 1 problem as a homework like after discussing 1 problem in video, you can give us that topic related problem for solving. I understood the recursion concept well thanks to you.
Please take more examples or questions on logarithmic time complexity. N also tell please bhaiyaa how to find or think when we can say this is taking log time/space
started from watching yesterday....today is my day 2 and had completed 5 episodes.......love to watch this serious its motivates me thankyou @leadcodingbyfraz
Bro it's is good example but I think if we do by two pointer approach then space complexity will be constant as compared to recursive one which O(n) space but good for recursive understanding ❤❤❤❤❤❤
Sir, please cover data structures like vectors, maps stacks, queues etc in details. Please sir it will be very helpful for people like me who are absolute beginner .
Bhaiya I am submitting my codes in python language I am getting TLE errors in code studio platform the code was similar to the code which you posted in GitHub what I need to do please do reply
Bhaiya , I have doubt for the recursion tree, I mean we are "returning" the function inside the function right so the function will not be there in the stack call to return back to . I think at the end when l = r then we return true and that marks the end of the recursion tree. pls clarify my doubt.
bhaiya can you increase the number of videos uploading to the channel because a video of a question hardly does anything, but though enjoying the course
Sir in this question what is best iteration or recursion can you tell us in every video that with the help of iteration or recursion we can solve it fastly
Day 5 Done ✅
Congratulations Guys, if you are consistent from last 5 days because 5th & 10th day are the most difficult day of consistency ⚡ By the time you'll reach 21st day you will be champ. 👑 Hope this motivates you all❤😊
Absolutely correct 💯
Points -
1. Basic solution is to use two pointers from middle, from ends OR reverse the string.
2. In recursion, we will only take the loop and convert it to recursion. i.e. we still will have left and right end chars in same call (and not have some mechanism to store and compare in appropriate number of call). L and R represent the substring which needs to be checked for substring. [hence the 0 and n-1 initial values as we need to check whole string at first.]
3. Since, we return boolean as final answer, we will return true/false in base and invalid cases (here base case is a valid case). For Induction step(where we make next call), we don't need to take and/or since this is a Unary recursion tree.
*Note - Recursive solution is "inferior" to iterative solution in terms of space complexity (expected due to stack)
I have solving palindrome problems using loop, today i learnt new thing that we can solve it using recursions as well. thanks bro.
Sorry for the late Fraz bhaiya. But EP 5 is DONE. Thank you for your consistency and I always appreciate you for your 0 to pro
type content.
One small suggestion Fraz bhai ..!! The logic explanation is superb.! In one go I am able to understand. It would be good if you can explain the code also so that it will be easy for us to understand and this helps us to explain to interviewer also in much smoother way. Because these days interviewers are preferring the explanation of code which we write. I know it might look silly suggestion but it helps us a lot.
You are hard working for us until finish this series I will never give up
I will watch your daily lectures and be consistent
video best like previous.n/2 is write because there is 0 to 4 and all i assumen .baki no doubts.ur videos is like 6 baj gaya aaaj ka video chalo kar lete hai .im student .but ik working professional ke liye ye daily challange time ki waje se kaffi accha lag raha hoga superb bhaiya.consistent op
The way of explaination is mindblowing. Keep it up.
With this course, you are giving us more than DSA lessons
You are teaching us discipline perseverance and to show up every day no matter what(which will stay for life)
Thank you so much bhaiya♥
A small request Fraz to cover more in one video and also plz dry run the code for a few cases. Gives loads of insight like in last video you did ♥️♥️!!! #missionamazon
Eagerly waiting for the video daily same as i used to wait for a show on TV in my childhood😄😁
the simplest explanation ever.. loved it.
take a bow for ur consistency
Concept cleared !!!amazing
bhai bht acha kaam kra h ....lots of love :)
Yeah, now catch your speed.. Feeling confident. 👍
Bhaiya lectures are really good. Like as a beginner I am understanding this recursion series very well but pls suggest how to gain confidence over topic of time and space complexity
I think we should increase pace of this course its just a suggestion and you know better than me fraz bhaiya
thank you
Done understood day 5✅
superb video
having no doubt😊
you are one of the best teacher keep uploading videos brother...
Thanks a ton
Present ! I'm owner to you for this lovely video ! Please make more video on recursion ! It Will help me more to strong my DSA Knowledge !🙌✔
Ep5 also done successfully ✅
Abhi tk sbkuchh mst samajh aa ra 😌
Awesome 🔥
Day 5 completed
Please give more questions for practice and homework
Thanks for the video
Day 5
Consistency✌✌✌
Very well explained ! ..Thanks for your support
Nice explanation bhaiya.
Thank you for this video
Bhaiya we want more questions🔥🔥 great explaination
Palindrome problem is now bit easier 🔥🔥
#DAY_5
Consistency OP🔥🔥🔥🔥
Fraz bhai 🔥🔥
Thank you for so good digestible content. One request can you come up with a small scenario of real time project where we are using these DSA concepts. As of filling a form where next questions are based on previous one and have a concept of DSA. Thank you in advance...
Thnq bhaiya for ur every effort
watched till end 👍
I always do the problem using iterative solution 😂 learnt the recursion approach from this video. Thank you so much for hard work and regularity. Keep on doing that, enjoying so much big bro ❤️❤️
Woow I see your comment daily ❤️.
Thanks for writing ☺️
@@LearnYardYT Yeah i love these videos so much because I badly waiting for such bootcamp which covers everything and not wasting time much. I know how you work hard for us. So it is a greatfulness towards you. ❤️
@@LearnYardYT l==r right for base condition why L>=r
@@LearnYardYT can you pls tell me why L>=R in the base condition L== R what is the difference in that
@@ramakrishna4092 it helps when size of string is even , do dry run of {1 2 1 1 2 1},you will understand
Provide assignments for practice daily. This will help everyone.
Very useful video because since 5 days I solve this question but this solution is best .
Bhaiya can you make a video for iteratively Approach please.
Can you share 1 problem as a homework like after discussing 1 problem in video, you can give us that topic related problem for solving.
I understood the recursion concept well thanks to you.
+1
Waiting for next topics!
Thankyou bhaiya for this session
nice explanation keep up the good work.
Great video !
very good series
Please take more examples or questions on logarithmic time complexity. N also tell please bhaiyaa how to find or think when we can say this is taking log time/space
Nicely explained!
this is very expensive seriese
🥰🥰🥰
great lecture😊
waiting for more such content!!!
Sorry for the late bhaiya 🥲
But covering all your videos
Keep making , its very effective ❤️
Complete Day 5 ❤️
wonderful video
bhaiya, can you please share the syllabys plan for your course? means expected dates for completion of topics.
😊😊😊Thank u bhaiya
Thank you soo much bhiya for your efforts 🙌 present
Thanks for writing ❤️
started from watching yesterday....today is my day 2 and had completed 5 episodes.......love to watch this serious its motivates me thankyou @leadcodingbyfraz
Done✅
So ideally , out depends on inner output is varied in this recurssion
so great brother
Lecture 5 - ☑
#Dsabyfaraz
#recursion❤
day 5 done
Video is good with the analysis.
Good Video
oosm explanation
Bro it's is good example but I think if we do by two pointer approach then space complexity will be constant as compared to recursive one which O(n) space but good for recursive understanding ❤❤❤❤❤❤
Very much enjoying 😊
❤️❤️ 😊
Very clear
I like yours video's 🥰
Can you also provide practice problems and also what will be the total duration and topics covedered for the entire DSA series?
very helpful
Episode 5 done ✅
Class 5 done☑
Hi Fraz,
For Palindrome question, java code is not working could you please look on that once and reply me if possible for you.
Sir, please cover data structures like vectors, maps stacks, queues etc in details.
Please sir it will be very helpful for people like me who are absolute beginner .
Please all these data structures just after this recursion sessions !!
Day 5
Done✅✅
done bhaiya..completed
Ep: 5 Done !
Lec 5 Done
Thanks bhaiya
How this function in 2nd iteration returning true ?It is not either the base case or the that false case(s[l]!=s[e])..how is it returning true?
Sir will the space complexity will also be O(n/2) for the recursive solution?
Bhaiya I am submitting my codes in python language I am getting TLE errors in code studio platform the code was similar to the code which you posted in GitHub what I need to do please do reply
Day 5 Done🙂
thank you sir
It is very good
Edit the video to zoom on the code you are writing , it will be more comfortable and good for viewing
Thanks!
can anyone explain the l >=r, what is l>r?
Now revision 💪
Hai sir, I didn't see the code in java, Could you please upload from Episode: 4
completed👍
Thanks
Bhaiya , I have doubt for the recursion tree, I mean we are "returning" the function inside the function right so the function will not be there in the stack call to return back to . I think at the end when l = r then we return true and that marks the end of the recursion tree.
pls clarify my doubt.
bhaia plz tell me is the best case complexity is big O(1)
nice video
Can you provide detailed schedule for dsa series
JAVA CODE
public class Solution {
public static void main(String []args){
Solution ans= new Solution();
String obj="level";
ans.isPalindrome(obj);
}
public static Boolean Palindrome(int i, int j,String s) {
if(i>=j) return true;
if(s.charAt(i)!=s.charAt(j)) return false;
return Palindrome(i+1,j-1,s);
}
public static Boolean isPalindrome(String s) {
System.out.println(Palindrome(0,s.length()-1,s));
return Palindrome(0,s.length()-1,s);
}
}
iss it necessary tom take the helper functions
bhaiya can you increase the number of videos uploading to the channel because a video of a question hardly does anything, but though enjoying the course
Sir in this question what is best iteration or recursion can you tell us in every video that with the help of iteration or recursion we can solve it fastly
solved this problem using recursion for the first time...
Forgot to comment, now done😁
Thanks 😁