comefrom: <gouthampradhan>dynamic_programming_LongestPalindromicSubsequence_1.java
code: public int longestPalindromeSubseq(String s) {
      int[][] dp = new int[s.length() + 1][s.length() + 1];
      String sI = new StringBuilder(s).reverse().toString();
      for (int i = 1, l = s.length(); i <= l; i++)
        for (int j = 1; j <= l; j++) {
          dp[i][j] =
              (s.charAt(i - 1) == sI.charAt(j - 1))
                  ? dp[i - 1][j - 1] + 1
                  : Math.max(dp[i - 1][j], dp[i][j - 1]);
        }
      return dp[s.length()][s.length()];
    }
masked: public int sample_funcname ( String var_1 ) {
    int [ ] [ ] var_4 = new int [ var_1 . length ( ) + 1 ] [ var_1 . length ( ) + 1 ] ;
    String var_8 = new StringBuilder ( var_1 ) . reverse ( ) . toString ( ) ;
    for ( int var_9 = 1 , var_10 = var_1 . length ( ) ;
    var_9 <= var_10 ;
    var_9 ++ ) for ( int var_11 = 1 ;
    var_11 <= var_10 ;
    var_11 ++ ) {
      var_4 [ var_9 ] [ var_11 ] = ( var_1 . charAt ( var_9 - 1 ) == var_8 . charAt ( var_11 - 1 ) ) ? var_4 [ var_9 - 1 ] [ var_11 - 1 ] + 1 : Math . max ( var_4 [ var_9 - 1 ] [ var_11 ] , var_4 [ var_9 ] [ var_11 - 1 ] ) ;
    }
    return var_4 [ var_1 . length ( ) ] [ var_1 . length ( ) ] ;
  }
  