title: Minimum Characters Added Front Make String Palindrome
signature: function minimum_characters_added_front_make_string_palindrome(s)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(s, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(s), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver("aadaa", true);
      @printf("TEST-0...%s\n",result);
      
      result = driver("2674377254", false);
      @printf("TEST-1...%s\n",result);
      
      result = driver("11", true);
      @printf("TEST-2...%s\n",result);
      
      result = driver("0011000 ", false);
      @printf("TEST-3...%s\n",result);
      
      result = driver("26382426486138", false);
      @printf("TEST-4...%s\n",result);
      
      result = driver("111010111010", false);
      @printf("TEST-5...%s\n",result);
      
      result = driver("abccba", true);
      @printf("TEST-6...%s\n",result);
      
      result = driver("5191", false);
      @printf("TEST-7...%s\n",result);
      
      result = driver("1110101101", false);
      @printf("TEST-8...%s\n",result);
      
      result = driver("abcdecbe", false);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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;
  }