title: Minimum Characters Added Front Make String Palindrome
signature: function minimumCharactersAddedFrontMakeStringPalindrome(s: string): boolean {
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: boolean, expected: boolean): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(s: string, expected:boolean): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(s),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver("aadaa", true);
    console.log(`TEST-0...${result}`);
  
    result = driver("2674377254", false);
    console.log(`TEST-1...${result}`);
  
    result = driver("11", true);
    console.log(`TEST-2...${result}`);
  
    result = driver("0011000 ", false);
    console.log(`TEST-3...${result}`);
  
    result = driver("26382426486138", false);
    console.log(`TEST-4...${result}`);
  
    result = driver("111010111010", false);
    console.log(`TEST-5...${result}`);
  
    result = driver("abccba", true);
    console.log(`TEST-6...${result}`);
  
    result = driver("5191", false);
    console.log(`TEST-7...${result}`);
  
    result = driver("1110101101", false);
    console.log(`TEST-8...${result}`);
  
    result = driver("abcdecbe", false);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
source_py: def minimum_characters_added_front_make_string_palindrome(s):
      l = len(s)
      i = 0
      j = (l - 1)
      while (i <= j):
          if (s[i] != s[j]):
              return False
          i += 1
          j -= 1
      return True
source_cpp: bool minimum_characters_added_front_make_string_palindrome(string s) {
    int l = s . length ( );
    int j;
    for ( int i = 0, j = l - 1;
    i <= j;
    i ++, j -- ) {
      if ( s [ i ] != s [ j ] ) return false;
    }
    return true;
  }