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 3% | |
#2 | 34 c. | Top 6% | |
#3 | 35 c. | Top 10% | c |
#4 | 36 c. | Top 16% | |
#5 | 37 c. | Top 29% | |
#6 | 38 c. | Top 32% | |
#7 | 39 c. | Top 35% | |
#8 | 65 c. | Top 39% | |
#9 | 67 c. | Top 42% | |
#10 | 71 c. | Top 45% | |
#11 | 75 c. | Top 48% | |
#12 | 76 c. | Top 52% | |
#13 | 77 c. | Top 55% | |
#14 | 78 c. | Top 58% | |
#15 | 79 c. | Top 68% | |
#16 | 81 c. | Top 74% | |
#17 | 84 c. | Top 81% | |
#18 | 87 c. | Top 84% | |
#19 | 99 c. | Top 87% | |
#20 | 150 c. | Top 90% | |
#21 | 344 c. | Top 94% | c |
#22 | 398 c. | Top 97% | |
#23 | 433 c. | Top 100% |