title: Check Given String Rotation Palindrome
signature: check_given_string_rotation_palindrome <- function(string_arg0) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(string_arg0, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(string_arg0), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          "aadaa", 
          TRUE
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          "2674377254", 
          FALSE
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          "11", 
          TRUE
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          "0011000", 
          FALSE
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          "26382426486138", 
          FALSE
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          "111010111010", 
          FALSE
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          "abccba", 
          TRUE
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          "5191", 
          FALSE
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          "1110101101", 
          FALSE
      )))
  
      cat(sprintf("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;
  }