comefrom: <awangdev>1216. Valid Palindrome III_1.java
code: private int findLpsLength(String s) {
  
          int n = s.length();
          int[][] dp = new int[n][n];
          for (int i = n - 1; i >= 0; i--){
              dp[i][i] = 1;
              for (int j = i + 1; j < n; j++) {
                  if (s.charAt(i) == s.charAt(j)) dp[i][j] = dp[i + 1][j - 1] + 2;
                  else dp[i][j] = Math.max(dp[i + 1][j], dp[i][j - 1]);
              }
          }
          return dp[0][n - 1];
      }
masked: private int sample_funcname ( String var_0 ) {
    int var_1 = var_0 . length ( ) ;
    int [ ] [ ] var_2 = new int [ var_1 ] [ var_1 ] ;
    for ( int var_3 = var_1 - 1 ;
    var_3 >= 0 ;
    var_3 -- ) {
      var_2 [ var_3 ] [ var_3 ] = 1 ;
      for ( int var_4 = var_3 + 1 ;
      var_4 < var_1 ;
      var_4 ++ ) {
        if ( var_0 . charAt ( var_3 ) == var_0 . charAt ( var_4 ) ) var_2 [ var_3 ] [ var_4 ] = var_2 [ var_3 + 1 ] [ var_4 - 1 ] + 2 ;
        else var_2 [ var_3 ] [ var_4 ] = Math . max ( var_2 [ var_3 + 1 ] [ var_4 ] , var_2 [ var_3 ] [ var_4 - 1 ] ) ;
      }
    }
    return var_2 [ 0 ] [ var_1 - 1 ] ;
  }
  