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_0 ) {
    int [ ] [ ] var_1 = new int [ var_0 . length ( ) + 1 ] [ var_0 . length ( ) + 1 ] ;
    String var_2 = new StringBuilder ( var_0 ) . reverse ( ) . toString ( ) ;
    for ( int var_3 = 1 , var_4 = var_0 . length ( ) ;
    var_3 <= var_4 ;
    var_3 ++ ) for ( int var_5 = 1 ;
    var_5 <= var_4 ;
    var_5 ++ ) {
      var_1 [ var_3 ] [ var_5 ] = ( var_0 . charAt ( var_3 - 1 ) == var_2 . charAt ( var_5 - 1 ) ) ? var_1 [ var_3 - 1 ] [ var_5 - 1 ] + 1 : Math . max ( var_1 [ var_3 - 1 ] [ var_5 ] , var_1 [ var_3 ] [ var_5 - 1 ] ) ;
    }
    return var_1 [ var_0 . length ( ) ] [ var_0 . length ( ) ] ;
  }
  