Shortest Palindrome

Given a string s, return the shortest palindrome obtainable by adding characters only to the front. This is equivalent to finding the longest palindromic prefix and prepending the reverse of the remaining suffix, typically solved in linear/near-linear time using KMP, Manacher, or rolling-hash techniques.