title: Longest Palindrome Subsequence Space
signature: function longestPalindromeSubsequenceSpace(s: string): number {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(s: string, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(s),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(" E", 1);
    console.log(`TEST-0...${result}`);
  
    result = driver("0845591950", 7);
    console.log(`TEST-1...${result}`);
  
    result = driver("00101011", 5);
    console.log(`TEST-2...${result}`);
  
    result = driver("pLSvlwrACvFaoT", 3);
    console.log(`TEST-3...${result}`);
  
    result = driver("7246", 1);
    console.log(`TEST-4...${result}`);
  
    result = driver("1010101100000", 8);
    console.log(`TEST-5...${result}`);
  
    result = driver("obPkcLSFp", 1);
    console.log(`TEST-6...${result}`);
  
    result = driver("914757557818", 7);
    console.log(`TEST-7...${result}`);
  
    result = driver("1", 1);
    console.log(`TEST-8...${result}`);
  
    result = driver("PKvUWIQ", 1);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
source_py: def longest_palindrome_subsequence_space(s):
      n = len(s)
      a = ([0] * n)
      for i in range((n - 1), (- 1), (- 1)):
          back_up = 0
          for j in range(i, n):
              if (j == i):
                  a[j] = 1
              elif (s[i] == s[j]):
                  temp = a[j]
                  a[j] = (back_up + 2)
                  back_up = temp
              else:
                  back_up = a[j]
                  a[j] = max(a[(j - 1)], a[j])
      return a[(n - 1)]
source_cpp: int longest_palindrome_subsequence_space(string & s) {
    int n = s . length ( );
    int a [ n ];
    for ( int i = n - 1;
    i >= 0;
    i -- ) {
      int back_up = 0;
      for ( int j = i;
      j < n;
      j ++ ) {
        if ( j == i ) a [ j ] = 1;
        else if ( s [ i ] == s [ j ] ) {
          int temp = a [ j ];
          a [ j ] = back_up + 2;
          back_up = temp;
        }
        else {
          back_up = a [ j ];
          a [ j ] = max ( a [ j - 1 ], a [ j ] );
        }
      }
    }
    return a [ n - 1 ];
  }