title: Check Given String Rotation Palindrome
signature: pub fn check_given_string_rotation_palindrome(string_arg0: String) -> bool {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: bool, expected: bool)->bool{
  return actual==expected
  }
  pub fn driver(string_arg0: String, expected: bool)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(string_arg0), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        "aadaa".to_string(), 
        true
      ));
      
      println!("TEST-1...{}", driver(
        "2674377254".to_string(), 
        false
      ));
      
      println!("TEST-2...{}", driver(
        "11".to_string(), 
        true
      ));
      
      println!("TEST-3...{}", driver(
        "0011000".to_string(), 
        false
      ));
      
      println!("TEST-4...{}", driver(
        "26382426486138".to_string(), 
        false
      ));
      
      println!("TEST-5...{}", driver(
        "111010111010".to_string(), 
        false
      ));
      
      println!("TEST-6...{}", driver(
        "abccba".to_string(), 
        true
      ));
      
      println!("TEST-7...{}", driver(
        "5191".to_string(), 
        false
      ));
      
      println!("TEST-8...{}", driver(
        "1110101101".to_string(), 
        false
      ));
      
      println!("TEST-9...{}", driver(
        "abcdecbe".to_string(), 
        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;
  }