In this post we will solve LeetCode 760. Find Anagram Mappings problem using the Java programming language.
You are given two integer arrays nums1 and nums2 where nums2 is an anagram of nums1. Both arrays may contain duplicates. Return an index mapping array mapping from nums1 to nums2 where mapping[i] = j means the ith element in nums1 appears in nums2 at index j. If there are multiple answers, return any of them. An array a is an anagram of an array b means b is made by randomizing the order of the elements in a. Constraints: o 1 <= nums1.length <= 100 o nums2.length == nums1.length o 0 <= nums1[i], nums2[i] <= 10^5 o nums2 is an anagram of nums1. Related Topics: o Array o Hash Table
We are provided with two int[] holding two anagrams. We need to write a function that returns an index mapping array mapping from nums1 to nums2 where mapping[i] = j means the ith element in nums1 appears in nums2 at index j. Continue reading “LeetCode 760. Find Anagram Mappings in Java”