Problem
1. Given a string X of length n and a string Y of length m, describe an O(n + m)-time algorithm for finding the longest prefix of X that is a suffix of Y
2. Give an efficient algorithm for deleting a string from a standard trie and analyze its running time.