Given two strings s and t, determine whether it is possible to transform s into t by applying the following operation any number of times:

• Choose any contiguous substring of s and sort its characters in ascending order.

Return true if s can be transformed into t, or false otherwise.

Constraints:

• s.length $==$ t.length

• $1 \leq$ s.length $\leq 10^5$

• s and t consist of only digits.

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.