You are given two strings s and target of equal length.

Return the lexicographically smallest permutation of s that is strictly greater than target. If no such permutation exists, return an empty string "".

Constraints:

• $1 \leq$ s.length $=$ target.length $\leq 300$

• s and target consist only 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.