Minimum Insertion Steps to Make a String Palindrome - LeetCode 1312 - Python Solution

Показать описание

Solution Blog: (sign into leetcode to view)

Use 2 pointers.

left pointer that starts @ index 0
right pointer that starts @ last index
If they point to the same value - move pointers inward.

If they don't add 1 and take the minimum of the two possible paths:

increment left pointer by 1
decrement right pointer by 1
When the left pointer passes the right pointer you've finished processing so return 0.

Time complexity: O(N^2)
Space complexity: O(N^2)

Hope this helped! Have an awesome day!
#python #leetcode #tutorial

Code with Carter

Рекомендации по теме

Комментарии

so much easier to follow than others sources i found. this channel will grow!

joshuablanchard

Hey can this be written in tabulation. I mean in the same way that you wrote the memoization?
Because i tried but couldn't able to make it

dharanyuvi

Minimum Insertion Steps to Make a String Palindrome - LeetCode 1312 - Python Solution

Minimum Insertion Steps to Make a String Palindrome | Recur+Memo | GOOGLE | Leetcode-1312 🧑🏻‍💻...

LeetCode 1312. Minimum Insertion Steps to Make a String Palindrome

Minimum Insertion Steps to Make a String Palindrome - LeetCode 1312 - Python Solution

1312. Minimum Insertion Steps to Make a String Palindrome - Day 22/30 Leetcode April Challenge

Minimum Insertion Steps to Make a String Palindrome - LeetCode #1312 - Python, JavaScript, Java, C++

Minimum Insertion Steps to Make a String Palindrome - Leetcode 1312 - Python

Minimum Insertion Steps to Make a String Palindrome | Blue Print | DP On Strings | Leetcode 1312

Mastering DSA in C++ for Placements | Session 9 : Continuation to Linked List

Minimum Insertion Steps to Make a String Palindrome || Longest Palindromic Subsequence || DP

32 Minimum number of insertion in a string to make it a palindrome

1312. Minimum Insertion Steps to Make a String Palindrome | LeetCode Daily Challenge | LeetCode POTD

1312. Minimum Insertion Steps to Make a String Palindrome | LEETCODE HARD | DYNAMIC PROGRAMMING

1312. Leetcode Minimum Insertion Steps to Make a String Palindrome

Minimum Insertion Steps to Make a String Palindrome Explained - Leetcode Hard Interview Preparation

DAY 51 | 1312. Minimum Insertion Steps to Make a String Palindrome | LeetCode 1312 | JAVA

Minimum Insertion Steps to Make a String Palindrome | Programming in Tamil | Dynamic Programming

Minimum Insertion Steps to Make a String Palindrome | 1312 | Leetcode | C++

LEETCODE - HARD | Minimum Insertion Steps to Make a String Palindrome |

Minimum Insertion Steps to Make a String Palindrome - Leetcode 1312 - JavaScript

Minimum Insertion Steps to Make a String Palindrome leetcode python solution

Leetcode 1312: Minimum Insertion Steps to Make a String Palindrome (Leetcode Hard)

Leetcode 1312. Minimum Insertion Steps to Make a String Palindrome

Leetcode: Problem of the Day: #1312. Minimum Insertion Steps to Make a String Palindrome Apr 17,2023

Dynamic Programming-22 | Form a palindrome | Minimum Insertion Steps to Make a String Palindrome