title: Check Given String Rotation Palindrome
signature: def checkGivenStringRotationPalindrome(string_arg0: String) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Boolean , expected: Boolean): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(string_arg0: String, expected: Boolean): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(string_arg0),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        "aadaa", 
        true    
      )}")   
  
  
      println(s"TEST-1...${driver(
        "2674377254", 
        false    
      )}")   
  
  
      println(s"TEST-2...${driver(
        "11", 
        true    
      )}")   
  
  
      println(s"TEST-3...${driver(
        "0011000", 
        false    
      )}")   
  
  
      println(s"TEST-4...${driver(
        "26382426486138", 
        false    
      )}")   
  
  
      println(s"TEST-5...${driver(
        "111010111010", 
        false    
      )}")   
  
  
      println(s"TEST-6...${driver(
        "abccba", 
        true    
      )}")   
  
  
      println(s"TEST-7...${driver(
        "5191", 
        false    
      )}")   
  
  
      println(s"TEST-8...${driver(
        "1110101101", 
        false    
      )}")   
  
  
      println(s"TEST-9...${driver(
        "abcdecbe", 
        false    
      )}")   
  
  }
  
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;
  }