Java Utililty Methods Array Common Prefix

int longestCommonContiguousSubstring(String s, String t)
Computes the longest common contiguous substring of s and t.

if (s.isEmpty() || t.isEmpty()) {
 return 0;
int M = s.length();
int N = t.length();
int[][] d = new int[M + 1][N + 1];
for (int j = 0; j <= N; j++) {
 d[0][j] = 0;
...

String longestCommonPath(String... paths)
Returns the longest common path of a group of path strings.

if (paths.length == 0) {
 return "";
if (paths.length == 1) {
 return paths[0];
String prefix = longestCommonPrefix(paths);
int prefixLength = prefix.length();
...

int longestCommonPrefix(CharSequence str1, CharSequence str2)
longest Common Prefix

return longestCommonPrefix(str1, str2, 0);

int longestCommonPrefix(String a, String b)
longest Common Prefix

int i = 0;
char[] as = a.toCharArray();
char[] bs = b.toCharArray();
int aLen = as.length;
int bLen = bs.length;
while (i < aLen && i < bLen && as[i] == bs[i])
 ++i;
return i;
...

String longestCommonPrefix(String one, String two)
Returns the longest common prefix for two Strings or "" if no prefix is shared

if (one.equals(two)) {
 return one;
if (one.equals("") || two.equals("")) {
 return "";
String currentPrefix = "";
int size = 0;
...

String longestCommonPrefix(String s1, String s2)
longest Common Prefix

if (s1.length() > s2.length()) {
 String tmp = s1;
 s1 = s2;
 s2 = tmp;
int i = 0;
while (i < s1.length() && Character.toUpperCase(s1.charAt(i)) == Character.toUpperCase(s2.charAt(i))) {
 i++;
...

String longestCommonPrefix(String str1, String str2)
longest Common Prefix

int i = 0;
while (i < str1.length() && i < str2.length() && str1.charAt(i) == str2.charAt(i)) {
 i++;
String str = str1.substring(0, i);
return str;

String longestCommonPrefix(String... strs)
Returns the longest common prefix of a group of strings.

if (strs.length == 0) {
 return "";
if (strs.length == 1) {
 return strs[0];
int end = 0;
charLoop: do {
...

String longestCommonPrefix(String[] strArray)
longest Common Prefix

if (strArray.length == 0)
 return "";
if (strArray.length == 1)
 return strArray[0];
int maxLength = Integer.MAX_VALUE;
for (int i = 0; i < strArray.length; i++) {
 maxLength = Math.min(strArray[i].length(), maxLength);
if (maxLength == 0)
 return "";
for (int i = 0; i < maxLength; i++) {
 for (int j = 0; j < strArray.length - 1; j++) {
 if (strArray[j].charAt(i) != strArray[j + 1].charAt(i)) {
 return strArray[j].substring(0, i);
return strArray[0].substring(0, maxLength);

String longestCommonPrefix(String[] strs)
longest Common Prefix

if (strs.length == 0) {
 return "";
int minLen = findMin(strs);
String str0 = strs[minLen];
for (int k = 0; k < str0.length(); k++) {
 for (int i = 0; i < strs.length; i++) {
 String str = strs[i];
...