You are given a string s of length n.

You may choose an integer k such that $1 \leq k \leq n$, and reverse either the prefix of s of length k or the suffix of s of length k.

Return the lexicographically smallest string that can be obtained after applying this operation.

Constraints:

• $1 \leq n ==$ s.length $\leq 1000$

• s consists of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.