title: Lexicographically Minimum String Rotation
signature: lexicographicallyMinimumStringRotation(str_) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(String actual, String expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(str_, String expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(str_), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          "onWEchl", 
          "EchlonW")
      }");
  
      print("TEST-1...${driver(
          "2", 
          "2")
      }");
  
      print("TEST-2...${driver(
          "100", 
          "001")
      }");
  
      print("TEST-3...${driver(
          "GHbCZA", 
          "AGHbCZ")
      }");
  
      print("TEST-4...${driver(
          "50568798206105", 
          "05505687982061")
      }");
  
      print("TEST-5...${driver(
          "001011110001", 
          "000100101111")
      }");
  
      print("TEST-6...${driver(
          "lljpYhznnyu", 
          "Yhznnyulljp")
      }");
  
      print("TEST-7...${driver(
          "54499921759984", 
          "17599845449992")
      }");
  
      print("TEST-8...${driver(
          "11101", 
          "01111")
      }");
  
      print("TEST-9...${driver(
          "qvypgCYEjsyjwZ", 
          "CYEjsyjwZqvypg")
      }");
  
      return 0;
  }
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 ];
  }