comefrom: <gouthampradhan>greedy_BurstBalloons_1.java
code: public int findMinArrowShots(int[][] points) {
      if (points.length == 0) return 0;
      Arrays.sort(points, ((o1, o2) -> o1[1] - o2[1]));
      int count = 0;
      int leftMost = points[0][1];
      for (int i = 1; i < points.length; i++) {
        if (leftMost < points[i][0]) {
          count++;
          leftMost = points[i][1];
        }
      }
      return count + 1;
    }
masked: public int sample_funcname ( int [ ] [ ] var_0 ) {
    if ( var_0 . length == 0 ) return 0 ;
    Arrays . sort ( var_0 , ( ( var_5 , var_6 ) -> var_5 [ 1 ] - var_6 [ 1 ] ) ) ;
    int var_8 = 0 ;
    int var_9 = var_0 [ 0 ] [ 1 ] ;
    for ( int var_10 = 1 ;
    var_10 < var_0 . length ;
    var_10 ++ ) {
      if ( var_9 < var_0 [ var_10 ] [ 0 ] ) {
        var_8 ++ ;
        var_9 = var_0 [ var_10 ] [ 1 ] ;
      }
    }
    return var_8 + 1 ;
  }
  