You are given two strings s and t, and an integer k. Both strings have the same length, which is divisible by k.

You need to divide string s into k equal sized substrings. Determine whether it is possible to rearrange these substrings such that concatenating them in some order produces the string t.

Return true if t can be formed by rearranging the k substrings, or false otherwise.

Constraints:

• $1 \leq$ s.length $=$ t.length $\leq 2 imes 10^5$

• $1 \leq$ k $\leq$ s.length

• s.length is divisible by k.

• s and t consist only of lowercase English letters.

• The input is generated such that s and t are anagrams of each other.

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.