How should I practice Minimum Insertions to Make a Palindrome?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen problems in FastPrep.

Is Minimum Insertions to Make a Palindrome associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen coding practice problem when the problem catalog has that company and stage context.

Minimum Insertions to Make a Palindrome

Bloomberg LP● HardNEW GRADPHONE SCREEN

Learn

Problem statement

Return the minimum number of single-character insertions needed to turn text into a palindrome. Insertions may occur at any positions.

Function

minInsertionsPalindrome(text: String) → int

Examples

Example 1

text = "apple"return = 3

Three insertions suffice; equivalently, apple has a longest palindromic subsequence of length 2.

Constraints

0 <= text.length <= 2000.
The text contains lowercase English letters.