131. Palindrome Partitioning | Recursion | Backtracking | 2 Approaches

  Рет қаралды 3,018

Aryan Mittal

Aryan Mittal

Күн бұрын

Пікірлер: 13
@ARYANMITTAL
@ARYANMITTAL 6 ай бұрын
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
@anonymousftw6386
@anonymousftw6386 6 ай бұрын
Instead of writing palindrome You can use stl if(equal(s.begin(),s.end(),s.rbegin()))
@mayankshakya9200
@mayankshakya9200 6 ай бұрын
Bhaiya aapne apne time pe dsa kaha se seekha tha which course???
@hydrocy.9165
@hydrocy.9165 5 ай бұрын
wallahi im finished
@anonanon1305
@anonanon1305 6 ай бұрын
Leercode 1718
@vladpvl
@vladpvl 6 ай бұрын
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
@arijeetchakraborty117
@arijeetchakraborty117 6 ай бұрын
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.
@vladpvl
@vladpvl 6 ай бұрын
@@arijeetchakraborty117 thank you!!! I appreciate your advice
@pratikpandey6680
@pratikpandey6680 6 ай бұрын
Why are we doing pop_back() ? Can you please tell😊
@theslimeoxidizer3308
@theslimeoxidizer3308 6 ай бұрын
so that everytime we get empty vector for storing another palindrome after returning from the calls.
@WiFiWaLaaa
@WiFiWaLaaa 6 ай бұрын
it's a backTracking
@riddle-me-ruben
@riddle-me-ruben 6 ай бұрын
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).
@Algorithmswithsubham
@Algorithmswithsubham 6 ай бұрын
sir 4K per video recording kijya
Молодой боец приземлил легенду!
01:02
МИНУС БАЛЛ
Рет қаралды 2,1 МЛН
When Cucumbers Meet PVC Pipe The Results Are Wild! 🤭
00:44
Crafty Buddy
Рет қаралды 60 МЛН
How Much Tape To Stop A Lamborghini?
00:15
MrBeast
Рет қаралды 236 МЛН
Players push long pins through a cardboard box attempting to pop the balloon!
00:31
Making an Algorithm Faster
30:08
NeetCodeIO
Рет қаралды 151 М.
5 Simple Steps for Solving Any Recursive Problem
21:03
Reducible
Рет қаралды 1,2 МЛН
Palindrome Partitioning - Backtracking - Leetcode 131
10:24
NeetCode
Рет қаралды 137 М.
131. Palindrome Partitioning
12:47
Code with Alisha
Рет қаралды 3,5 М.
Dynamic Programming isn't too hard. You just don't know what it is.
22:31
DecodingIntuition
Рет қаралды 199 М.
773. Sliding Puzzle | BFS | Graph Traversal | Matrix | Array
15:06
Aryan Mittal
Рет қаралды 1,9 М.
Молодой боец приземлил легенду!
01:02
МИНУС БАЛЛ
Рет қаралды 2,1 МЛН