Leetcode 899. Orderly Queue

Given a string s and integer k where you may repeatedly take one of the first k characters and append it to the end, return the lexicographically smallest reachable string — if k == 1 this is the problem of finding the lexicographically minimal rotation of s, while for k > 1 you can effectively fully reorder the string so the answer is s sorted.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 899. Orderly Queue

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact