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 | 35 c. | Top 12% | c |
#3 | 36 c. | Top 19% | |
#4 | 37 c. | Top 31% | |
#5 | 38 c. | Top 35% | |
#6 | 39 c. | Top 38% | |
#7 | 67 c. | Top 42% | |
#8 | 71 c. | Top 46% | |
#9 | 75 c. | Top 50% | |
#10 | 77 c. | Top 54% | |
#11 | 79 c. | Top 65% | |
#12 | 81 c. | Top 73% | |
#13 | 84 c. | Top 81% | |
#14 | 87 c. | Top 85% | |
#15 | 99 c. | Top 88% | |
#16 | 150 c. | Top 92% | |
#17 | 398 c. | Top 96% | |
#18 | 433 c. | Top 100% |