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 4% | |
#2 | 36 c. | Top 13% | |
#3 | 37 c. | Top 26% | |
#4 | 38 c. | Top 30% | |
#5 | 39 c. | Top 35% | |
#6 | 67 c. | Top 39% | |
#7 | 71 c. | Top 43% | |
#8 | 75 c. | Top 48% | |
#9 | 77 c. | Top 52% | |
#10 | 79 c. | Top 65% | |
#11 | 81 c. | Top 74% | |
#12 | 84 c. | Top 83% | |
#13 | 99 c. | Top 87% | |
#14 | 150 c. | Top 91% | |
#15 | 398 c. | Top 96% | |
#16 | 433 c. | Top 100% |