Find the longest common prefix string amongst an array of strings.
Write a program that takes an array of lowercase strings and returns the longest common prefix (LCP) that is shared amongst all strings. If there is no common prefix, return an empty string. The words are separated by a space character.
# | Size | % | Users |
---|---|---|---|
#1 | 32 c. | Top 5% | |
#2 | 36 c. | Top 16% | |
#3 | 37 c. | Top 32% | |
#4 | 38 c. | Top 37% | |
#5 | 39 c. | Top 42% | |
#6 | 71 c. | Top 47% | |
#7 | 75 c. | Top 53% | |
#8 | 77 c. | Top 58% | |
#9 | 79 c. | Top 74% | |
#10 | 81 c. | Top 79% | |
#11 | 84 c. | Top 89% | |
#12 | 99 c. | Top 95% | |
#13 | 150 c. | Top 100% |