Solution: Shortest Palindrome
Let's solve the Shortest Palindrome problem using the Knowing What to Track pattern.
We'll cover the following...
We'll cover the following...
Statement
Given a string s, you may prepend any number of characters to the front of s to make it a palindrome.
Return the shortest palindrome that can be formed by only prepending characters to s.
Constraints:
s.length...