Target

Find the longest string that is a prefix of all strings in a given array. If no common prefix exists, return an empty string.

You're given an array containing only 0s, 1s, and 2s. Sort the array in place so that elements of the same value are grouped together.

Find the longest palindromic substring within a given string. A palindromic substring reads the same forwards and backward.