import java.util.*; public class Solution { int findMax(char[] arr, int sidx, int eidx){ int len = arr.length; int count = 0; while(sidx-count >= 0 && eidx + count < len && arr[sidx-count] == arr[eidx + count]){ count++; } ...