title: Minimum Characters Added Front Make String Palindrome
signature: minimumCharactersAddedFrontMakeStringPalindrome(s) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(s, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(s), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          "aadaa", 
          true)
      }");
  
      print("TEST-1...${driver(
          "2674377254", 
          false)
      }");
  
      print("TEST-2...${driver(
          "11", 
          true)
      }");
  
      print("TEST-3...${driver(
          "0011000 ", 
          false)
      }");
  
      print("TEST-4...${driver(
          "26382426486138", 
          false)
      }");
  
      print("TEST-5...${driver(
          "111010111010", 
          false)
      }");
  
      print("TEST-6...${driver(
          "abccba", 
          true)
      }");
  
      print("TEST-7...${driver(
          "5191", 
          false)
      }");
  
      print("TEST-8...${driver(
          "1110101101", 
          false)
      }");
  
      print("TEST-9...${driver(
          "abcdecbe", 
          false)
      }");
  
      return 0;
  }
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;
  }