title: Check Given String Rotation Palindrome
signature: fun checkGivenStringRotationPalindrome(string_arg0: String): Boolean {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Boolean, expected:Boolean):Boolean{
    return actual.equals(expected)
  }
  fun driver(string_arg0: String, expected:Boolean):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(string_arg0), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver("aadaa", true)
      println("TEST-0...${result}")
      
      result = driver("2674377254", false)
      println("TEST-1...${result}")
      
      result = driver("11", true)
      println("TEST-2...${result}")
      
      result = driver("0011000", false)
      println("TEST-3...${result}")
      
      result = driver("26382426486138", false)
      println("TEST-4...${result}")
      
      result = driver("111010111010", false)
      println("TEST-5...${result}")
      
      result = driver("abccba", true)
      println("TEST-6...${result}")
      
      result = driver("5191", false)
      println("TEST-7...${result}")
      
      result = driver("1110101101", false)
      println("TEST-8...${result}")
      
      result = driver("abcdecbe", false)
      println("TEST-9...${result}")
      
          
  }
  
  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;
  }