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 9% | c |
#4 | 36 c. | Top 16% | |
#5 | 37 c. | Top 28% | |
#6 | 38 c. | Top 31% | |
#7 | 39 c. | Top 34% | |
#8 | 65 c. | Top 38% | |
#9 | 67 c. | Top 41% | |
#10 | 71 c. | Top 44% | |
#11 | 75 c. | Top 47% | |
#12 | 76 c. | Top 50% | |
#13 | 77 c. | Top 53% | |
#14 | 78 c. | Top 56% | |
#15 | 79 c. | Top 66% | |
#16 | 81 c. | Top 72% | |
#17 | 84 c. | Top 78% | |
#18 | 87 c. | Top 81% | |
#19 | 99 c. | Top 84% | |
#20 | 150 c. | Top 88% | |
#21 | 322 c. | Top 91% | |
#22 | 344 c. | Top 94% | c |
#23 | 398 c. | Top 97% | |
#24 | 433 c. | Top 100% |