title: Lexicographically Minimum String Rotation
signature: fun lexicographicallyMinimumStringRotation(str_: String): String {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:String, expected:String):Boolean{
    return actual.equals(expected)
  }
  fun driver(str_: String, expected:String):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(str_), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver("onWEchl", "EchlonW")
      println("TEST-0...${result}")
      
      result = driver("2", "2")
      println("TEST-1...${result}")
      
      result = driver("100", "001")
      println("TEST-2...${result}")
      
      result = driver("GHbCZA", "AGHbCZ")
      println("TEST-3...${result}")
      
      result = driver("50568798206105", "05505687982061")
      println("TEST-4...${result}")
      
      result = driver("001011110001", "000100101111")
      println("TEST-5...${result}")
      
      result = driver("lljpYhznnyu", "Yhznnyulljp")
      println("TEST-6...${result}")
      
      result = driver("54499921759984", "17599845449992")
      println("TEST-7...${result}")
      
      result = driver("11101", "01111")
      println("TEST-8...${result}")
      
      result = driver("qvypgCYEjsyjwZ", "CYEjsyjwZqvypg")
      println("TEST-9...${result}")
      
          
  }
  
  main()
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 ];
  }