title: Lexicographically Minimum String Rotation
signature: pub fn lexicographically_minimum_string_rotation(str_: String) -> String {
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: String, expected: String)->bool{
  return actual==expected
  }
  pub fn driver(str_: String, expected: String)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(str_), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        "onWEchl".to_string(), 
        "EchlonW".to_string()
      ));
      
      println!("TEST-1...{}", driver(
        "2".to_string(), 
        "2".to_string()
      ));
      
      println!("TEST-2...{}", driver(
        "100".to_string(), 
        "001".to_string()
      ));
      
      println!("TEST-3...{}", driver(
        "GHbCZA".to_string(), 
        "AGHbCZ".to_string()
      ));
      
      println!("TEST-4...{}", driver(
        "50568798206105".to_string(), 
        "05505687982061".to_string()
      ));
      
      println!("TEST-5...{}", driver(
        "001011110001".to_string(), 
        "000100101111".to_string()
      ));
      
      println!("TEST-6...{}", driver(
        "lljpYhznnyu".to_string(), 
        "Yhznnyulljp".to_string()
      ));
      
      println!("TEST-7...{}", driver(
        "54499921759984".to_string(), 
        "17599845449992".to_string()
      ));
      
      println!("TEST-8...{}", driver(
        "11101".to_string(), 
        "01111".to_string()
      ));
      
      println!("TEST-9...{}", driver(
        "qvypgCYEjsyjwZ".to_string(), 
        "CYEjsyjwZqvypg".to_string()
      ));
      
  }
source_py: def lexicographically_minimum_string_rotation(str_):
      n = len(str_)
      arr = ([0] * n)
      concat = (str_ + str_)
      for i in range(n):
          arr[i] = concat[i:(n + i)]
      arr.sort()
      return arr[0]
source_cpp: string lexicographically_minimum_string_rotation(string str) {
    int n = str . length ( );
    string arr [ n ];
    string concat = str + str;
    for ( int i = 0;
    i < n;
    i ++ ) arr [ i ] = concat . substr ( i, n );
    sort ( arr, arr + n );
    return arr [ 0 ];
  }