comefrom: <gouthampradhan>breadth_first_search_BusRoutes_1.java
code: private boolean intersect(int[] A, int[] B) {
      for (int i = 0, j = 0; i < A.length && j < B.length; ) {
        if (A[i] == B[j]) return true;
        else if (A[i] < B[j]) i++;
        else j++;
      }
      return false;
    }
masked: private boolean var_0 ( int [ ] var_1 , int [ ] var_2 ) {
    for ( int var_4 = 0 , var_5 = 0 ;
    var_4 < var_1 . length && var_5 < var_2 . length ;
    ) {
      if ( var_1 [ var_4 ] == var_2 [ var_5 ] ) return true ;
      else if ( var_1 [ var_4 ] < var_2 [ var_5 ] ) var_4 ++ ;
      else var_5 ++ ;
    }
    return false ;
  }
  