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 | 34 c. | Top 7% | |
#3 | 35 c. | Top 11% | c |
#4 | 36 c. | Top 19% | |
#5 | 37 c. | Top 30% | |
#6 | 38 c. | Top 33% | |
#7 | 39 c. | Top 37% | |
#8 | 67 c. | Top 41% | |
#9 | 71 c. | Top 44% | |
#10 | 75 c. | Top 48% | |
#11 | 77 c. | Top 52% | |
#12 | 79 c. | Top 63% | |
#13 | 81 c. | Top 70% | |
#14 | 84 c. | Top 78% | |
#15 | 87 c. | Top 81% | |
#16 | 99 c. | Top 85% | |
#17 | 150 c. | Top 89% | |
#18 | 344 c. | Top 93% | c |
#19 | 398 c. | Top 96% | |
#20 | 433 c. | Top 100% |