You are given two strings s and t. In a single step, you can append any character to either s or t.

Return the minimum number of steps required to make s and t anagrams of each other.

Note: An anagram is a string that contains the same characters with the same frequencies as another string, but the order of characters can be different.

Constraints:

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

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