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 7% | |
#3 | 35 c. | Top 10% | c |
#4 | 36 c. | Top 17% | |
#5 | 37 c. | Top 28% | |
#6 | 38 c. | Top 31% | |
#7 | 39 c. | Top 34% | |
#8 | 67 c. | Top 38% | |
#9 | 71 c. | Top 41% | |
#10 | 75 c. | Top 45% | |
#11 | 76 c. | Top 48% | |
#12 | 77 c. | Top 52% | |
#13 | 78 c. | Top 55% | |
#14 | 79 c. | Top 66% | |
#15 | 81 c. | Top 72% | |
#16 | 84 c. | Top 79% | |
#17 | 87 c. | Top 83% | |
#18 | 99 c. | Top 86% | |
#19 | 150 c. | Top 90% | |
#20 | 344 c. | Top 93% | c |
#21 | 398 c. | Top 97% | |
#22 | 433 c. | Top 100% |