title: Check Given String Rotation Palindrome
signature: func checkGivenStringRotationPalindrome(string_arg0 string) bool {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual bool, expected bool) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(string_arg0 string, expected bool) string {
      if validateSolution(PLACEHOLDER_FN_NAME(string_arg0),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver("aadaa", true)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver("2674377254", false)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver("11", true)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver("0011000", false)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver("26382426486138", false)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver("111010111010", false)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver("abccba", true)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver("5191", false)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver("1110101101", false)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver("abcdecbe", false)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }