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

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

Find the longest path in a tree where no two adjacent nodes on the path have the same character. The tree is defined by parent-child relationships and each node has an associated character.