Leetcode Problem 899. Orderly Queue

899. Orderly Queue

Leetcode Solutions

Key approach of the solution

Check if k is equal to 1.
If k is 1, generate all rotations of s and keep track of the lexicographically smallest string.
If k is greater than 1, convert the string s into a list of characters and sort it.
Join the sorted list of characters into a string and return it.

Ask Question

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen

Loading...

Suggested Answer

Answer

Full Screen

Copy Answer Code

Loading...