comefrom: <gouthampradhan>greedy_MaximumLengthOfPairChain_1.java
code: public int findLongestChain(int[][] pairs) {
      Arrays.sort(
          pairs,
          (o1, o2) -> o1[1] == o2[1] ? Integer.compare(o1[0], o2[0]) : Integer.compare(o1[1], o2[1]));
      int count = 1;
      int[] curr = pairs[0];
      for (int i = 1; i < pairs.length; i++) {
        if (pairs[i][0] > curr[1]) {
          count++;
          curr = pairs[i];
        }
      }
      return count;
    }
masked: public int sample_funcname ( int [ ] [ ] var_0 ) {
    Arrays . sort ( var_0 , ( var_3 , var_4 ) -> var_3 [ 1 ] == var_4 [ 1 ] ? Integer . compare ( var_3 [ 0 ] , var_4 [ 0 ] ) : Integer . compare ( var_3 [ 1 ] , var_4 [ 1 ] ) ) ;
    int var_9 = 1 ;
    int [ ] var_10 = var_0 [ 0 ] ;
    for ( int var_11 = 1 ;
    var_11 < var_0 . length ;
    var_11 ++ ) {
      if ( var_0 [ var_11 ] [ 0 ] > var_10 [ 1 ] ) {
        var_9 ++ ;
        var_10 = var_0 [ var_11 ] ;
      }
    }
    return var_9 ;
  }
  