Tap here to switch tabs
Problem
Submissions

Problem: Minimum Insertion Steps to Make a String Palindrome

Minimum Insertion Steps to Make a String Palindrome asks for the fewest characters you can insert anywhere in a string so it reads the same forward and backward.

Statement

Given a string s, determine the minimum number of insertions needed to make s a palindrome.

Note: A palindrome is a string that reads the same forward and backward.

Constraints:

  • 1≤1 \leq s.length ≤500\leq 500

  • s consists of lowercase English letters.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Minimum Insertion Steps to Make a String Palindrome

Minimum Insertion Steps to Make a String Palindrome asks for the fewest characters you can insert anywhere in a string so it reads the same forward and backward.

Statement

Given a string s, determine the minimum number of insertions needed to make s a palindrome.

Note: A palindrome is a string that reads the same forward and backward.

Constraints:

  • 1≤1 \leq s.length ≤500\leq 500

  • s consists of lowercase English letters.