#Trie

Write a function to find the longest common prefix string amongst an array of strings. Initial implementations could use sorting with a time complexity of O(n log n), followed by a more efficient solution using a Trie with O(n).