MINIMUM NUMBER OF MOVES TO MAKE PALINDROME | LEETCODE 2193 | PYTHON SOLUTION

JOIN OUR DISCORD COMMUNITY: / discord
In this video we are solving a hard level Amazon interview question dealing with Leetcode's seemingly favorite string topic: Minimum Moves to Make Palindrome (Leetcode 2193).
This question is one of those that is tricky to figure out but the code is so simple and intuitive that once you see it, everything should just click and there you go.
TIMESTAMPS:
00:00 Intro
00:20 Question Prompt
00:45 Basic Example
02:25 Solution Intuition
07:49 Coding
12:25 Time/Space Complexity
13:50 Outro

[@AngadSingh97]

Awesome, thank you for explaining everything so neatly. Doesn't even feel like a Hard problem now.

[@varunshrivastava2706]

Unbelievable, I busted my ass for 2 long hours to think of a suitable algorithm yet couldn't solve it and you did it so elegantly.

[@crackfaang]

It happens. I'd personally recommend just looking at the solution after 20 minutes and not wasting your time. Sometime when you see it, things just click and you'll always remember how to solve it

[@akakartik]

We wait for your videos 😄😄

[@manishparab4427]

great solution and explanation buddy.

[@neelakshisoni6118]

Could u plz make a video on important topics and questions for Internship? and what else to study other than doing lc?

[@Nature-pb9dh]

Really good explanation. Do come up with better examples next time. The noting of the edge case was great

[@danielmelo6758]

random comment!

[@farzanaalaman3655]

aabb abab abba 2

[@nguyendatz]

acturelly, you didn't prove how this algorithm that leads to the minimum moves.

[@crackfaang]

I don’t ever prove answers. It’s not really necessary in an interview and a mathematical proof is a bit overkill to be honest

[@StellasAdi18]

Not as straight forward as you explained :)