You are given two integer arrays nums1 and nums2, where nums2 is an anagram of nums1. Both arrays have the same length.

An anagram mapping is an array mapping of indices such that nums1[i] == nums2[mapping[i]] for each index i.

Return an index mapping array mapping. If multiple valid mappings exist, return any of them.

Constraints:

• $1 \leq$ nums1.length $\leq 100$

• nums2.length $==$ nums1.length

• $0 \leq$ nums1[i], nums2[i] $\leq 10^5$

• nums2 is an anagram of nums1.

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.