The longest common prefix is a problem in that we can find the prefix in every string of the array.
str = [ "flower", "flow", "flight" ]
output: fl (every string in the array contains the "fl" as its prefix.
public class LogestCommonPrefix {
public...
