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 5% | |
#2 | 36 c. | Top 14% | |
#3 | 37 c. | Top 27% | |
#4 | 38 c. | Top 32% | |
#5 | 39 c. | Top 36% | |
#6 | 67 c. | Top 41% | |
#7 | 71 c. | Top 45% | |
#8 | 75 c. | Top 50% | |
#9 | 77 c. | Top 55% | |
#10 | 79 c. | Top 68% | |
#11 | 81 c. | Top 77% | |
#12 | 84 c. | Top 86% | |
#13 | 99 c. | Top 91% | |
#14 | 150 c. | Top 95% | |
#15 | 398 c. | Top 100% |