Solution for linearIn problem in the Array-3 java section on codingbat.com (uses only one array pass)

linearIn.java

public boolean linearIn(int[] outer, int[] inner) {
  int i=0, j=0, out, in;
  
  while (i<outer.length && j < inner.length){
    
    out = outer[i]; in = inner[j];
    
    if (out<in){
      i++;
    }
    else if (out==in){
      i++;
      j++;
      while (i<outer.length-1 && outer[i]==in){ // skip past repeating numbers
        i++;
      }
    }
    else { // i>o so no matches
      return false;
    }
    
  }
  
  if (j != inner.length){ // not all numbers in inner were matched
    return false;
  }
  return true;
}