Given two strings s and t, determine whether s can be transformed into t in at most k moves.

In the $i^{ ext{th}}$ move, where $1 \leq i \leq k$, you can perform one of the following actions:

• Select an index j (where $0 \leq j <$ s.length) that has not been chosen in any prior move, and shift the character s[j] forward in the alphabet cyclically by $i$ positions (for example, shifting 'z' forward by $1$ position gives 'a').

• Skip the move and do nothing.

Return true if s can be transformed into t in at most k moves, or false otherwise.

Constraints:

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

• $0 \leq$ k $\leq 10^9$

• s and t contain only 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.