Hi Arayn , first of all thank you so much for putting so much efforts and create videos. I know it is not very easy to record video and explain the solution of daily leetcode problem solution on every day. Your way of explaining the solution is really good. I would like to request you to explain in each video that why you are not picking other Data structure and how you are coming to this solution. Basically it would be good if you would explain on why other solutions won't work and where they will be messed up and why this solution works. Sometimes your videos becomes only the explanation which is given in leetcode editorial tab. Your code looks same what is there. I would love to see some other way of writing the code or conditions which can help to understand more. Please don't treat this as criticism. Keep growing and keep making more good videos. I always refer your videos when I don't understand problem or don't understand leetcode editorial solution.
Hey man, your way of explaining problems and approach are pretty good but I think you explain things pretty fast and if you slow it down a little bit then everyone will be able to grasp your explaination :)
Hello Aryan Bhaiya... I love your videos and your way of explaining solutions is just awesome. It makes is so easy to see the approach once you explain it thank you so much for such great videos and i request you to please keep making them.. Your energy and your vibes makes these videos 10x better...🤩
const string s - this when passed into other recursive calls creates copy of the original string each time we call it. this is called pass by value. const string &s - with this syntax we are passing the reference of the original string, avoiding creation of copies of the original. this is called pass by reference (meaning the address of the original string) .
passing as "string &s" or "&dp" means we are passing it as reference so our function doesn't need to make a copy of the string everytime it gets called(it directly works on the original string). so it sometimes significantly reduces the unnecessary memory requirements. check out pass by reference articles. might help.
I love his expressions and for me this is the reason why i did subsribe to this channel , the way of speaking makes it more interesting and easier to understand if u can followup imo
The key part in the solution is if s[i] == s[j], we need to subtract 1. Your explanation to why we need to subtract 1 is not sufficient. You are explaning as if you have mugged up the solution.
Same thought. After finding another video I think the intuition here is that if both ends are equal then we can just print all the way to the end thus saving us one printing action. This is also because the partition is actually the act of printing the char on i, from i to k. Then we cut the problem into two parts.
Throw the printer out .
Problem solved
Hi Arayn , first of all thank you so much for putting so much efforts and create videos. I know it is not very easy to record video and explain the solution of daily leetcode problem solution on every day.
Your way of explaining the solution is really good. I would like to request you to explain in each video that why you are not picking other Data structure and how you are coming to this solution. Basically it would be good if you would explain on why other solutions won't work and where they will be messed up and why this solution works.
Sometimes your videos becomes only the explanation which is given in leetcode editorial tab. Your code looks same what is there. I would love to see some other way of writing the code or conditions which can help to understand more.
Please don't treat this as criticism. Keep growing and keep making more good videos.
I always refer your videos when I don't understand problem or don't understand leetcode editorial solution.
Hey man, your way of explaining problems and approach are pretty good but I think you explain things pretty fast and if you slow it down a little bit then everyone will be able to grasp your explaination :)
😅
Go to settings and change the playback speed to 0.5x or 0.75x for better results
Apprication...!! finally found a perfect solution with proper explaination...
Best solution ever for this question 🔥🔥
It's amazing how you make the problem look much easier.
Great explanation as always. Thank you
Clear explanation. Thanks a lot.
Great explanation❤❤
brilliant explanation, thanks :)
Immediately solved the problem after your hint.
amazing content keep moving ahead
Great explanation bro ❤
Very well explained😇
Hello Aryan Bhaiya... I love your videos and your way of explaining solutions is just awesome. It makes is so easy to see the approach once you explain it thank you so much for such great videos and i request you to please keep making them..
Your energy and your vibes makes these videos 10x better...🤩
Hey after your explanation it makes sense but you didn't explain what are all the factors leads to MCM
Hey Aryan your explanations are really great. 🔥
bro how did u got to this recursive code,..
wow thank you so much
excellent approach and intution building .
now your video time is good brother. keep your video duration in this range 15min- 20min only
💯
Bro where have you disappeared?
koi iss method ka tabulation batado plz, global variable ke bina tle de rha hai
can you explain why u check s[i]==s[j] ?? It should be s[i]==s[k+1] ?? Please explain its confusing
Please let me know, why we use this " const string& s " in solve function, i use simple "const string s" this solution give TLE.
const string s - this when passed into other recursive calls creates copy of the original string each time we call it. this is called pass by value.
const string &s - with this syntax we are passing the reference of the original string, avoiding creation of copies of the original. this is called pass by reference (meaning the address of the original string) .
passing as "string &s" or "&dp" means we are passing it as reference so our function doesn't need to make a copy of the string everytime it gets called(it directly works on the original string). so it sometimes significantly reduces the unnecessary memory requirements. check out pass by reference articles. might help.
you should improve your communication skill , don't try to be oversmart, be calm while teaching.❤
Bro He is SMART as he makes a hard sum understandable in under 15 minutes. Be grateful for what u get for free.
I love his expressions and for me this is the reason why i did subsribe to this channel , the way of speaking makes it more interesting and easier to understand if u can followup imo
Speak properly instead of jumping 🤣
gr8!!!
Kaha gayab ho sirrrrr 🙏
you will break your back 😂
The key part in the solution is if s[i] == s[j], we need to subtract 1. Your explanation to why we need to subtract 1 is not sufficient. You are explaning as if you have mugged up the solution.
Same thought. After finding another video I think the intuition here is that if both ends are equal then we can just print all the way to the end thus saving us one printing action. This is also because the partition is actually the act of printing the char on i, from i to k. Then we cut the problem into two parts.
y r u in so hurry brother aaram se koi jaldi nhi h ...
bro what did you say at the start ie from 0:00 to 0:05 🤣🤣
urgently request youtube to remove such worst video at earliest possible
This is not mcm this is type of front partition
Bhaiya Gutka thook ke video start kia kro
Laut aao ab