No Matter what, make sure to understand time complexities of different Recursive approaches discussed, atleast get some benefit of watching this channel 🌚 . BIT MANIPULATION Crash Course 📈 | All Tricks & Pattern with Intuition for DSA & CP - kzbin.info/www/bejne/enWsh4eYltmoZ7s
@anonymousftw63866 ай бұрын
Instead of writing palindrome You can use stl if(equal(s.begin(),s.end(),s.rbegin()))
@mayankshakya92006 ай бұрын
Bhaiya aapne apne time pe dsa kaha se seekha tha which course???
@hydrocy.91655 ай бұрын
wallahi im finished
@anonanon13056 ай бұрын
Leercode 1718
@vladpvl6 ай бұрын
Hello brother, I have an issue. I know a lot of theory, but can't use it in practise. When I read excercise I understand how to do it, but I cant write code. Maybe you can help me with advice
@arijeetchakraborty1176 ай бұрын
okay, now if you know how to do it, means you understand the question properly and you can at least figure out one approach to solve it, be it a very efficient approach or not that optimal way. I can suggest you from my personal experience that if you are facing these kind of problem, you should first break down the code in small modules. Try the very easy parts first and then move on to the harder parts. And feel free to take help from anywhere you can get until you can just understand what is happening. This technique helped me a lot.
@vladpvl6 ай бұрын
@@arijeetchakraborty117 thank you!!! I appreciate your advice
@pratikpandey66806 ай бұрын
Why are we doing pop_back() ? Can you please tell😊
@theslimeoxidizer33086 ай бұрын
so that everytime we get empty vector for storing another palindrome after returning from the calls.
@WiFiWaLaaa6 ай бұрын
it's a backTracking
@riddle-me-ruben6 ай бұрын
as we go into the recursive calls and add things to the current path, when we return back to explore other paths, if we did not delete the stuff then our other paths we are trying to explore will contain those extra strings. Thus, we delete it so that the other paths have a fresh start. (And also if we do not delete, then at the end we will have one giant list).