title: Check Given String Rotation Palindrome
signature: function checkGivenStringRotationPalindrome($string_arg0) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($string_arg0, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($string_arg0), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        "aadaa", 
        true));
      
      printf("TEST-1...%s\n",driver(
        "2674377254", 
        false));
      
      printf("TEST-2...%s\n",driver(
        "11", 
        true));
      
      printf("TEST-3...%s\n",driver(
        "0011000", 
        false));
      
      printf("TEST-4...%s\n",driver(
        "26382426486138", 
        false));
      
      printf("TEST-5...%s\n",driver(
        "111010111010", 
        false));
      
      printf("TEST-6...%s\n",driver(
        "abccba", 
        true));
      
      printf("TEST-7...%s\n",driver(
        "5191", 
        false));
      
      printf("TEST-8...%s\n",driver(
        "1110101101", 
        false));
      
      printf("TEST-9...%s\n",driver(
        "abcdecbe", 
        false));
      
  }
  
  main();
  ?>
source_py: def check_given_string_rotation_palindrome(string):
      l = 0
      h = (len(string) - 1)
      while (h > l):
          l += 1
          h -= 1
          if (string[(l - 1)] != string[(h + 1)]):
              return False
      return True
source_cpp: bool check_given_string_rotation_palindrome(string str) {
    int l = 0;
    int h = str . length ( ) - 1;
    while ( h > l ) if ( str [ l ++ ] != str [ h -- ] ) return false;
    return true;
  }