Longest Substring Without Repeating Characters

 public int lengthOfLongestSubstring(String s) {
  int len = s.length();
  if (len == 0)
   return 0;

  int maxLen = 1;
  int iLen = len - 1;
  for (int i = 0; i < iLen; i++) {
   int cLen = 1;
   int[] idxArr = new int[128];
   idxArr[s.charAt(i)] = 1;

   for (int j = i + 1; j < len; j++) {
    int idx = s.charAt(j);
    if (idxArr[idx] == 0) {
     idxArr[idx] = 1;
     cLen++;
    } else {
     break;
    }
   }

   if (cLen > maxLen)
    maxLen = cLen;
  }

  return maxLen;
 }