Available question text
Given a string s, compute the minimum number of character insertions anywhere to make it a palindrome. Key insight: this equals |s| minus the length of the longest palindromic subsequence (or LCS of s and reverse(s)), solvable with O(n^2) dynamic programming.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1312. Minimum Insertion Steps to Make a String Palindrome
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source