Available question text
Given two arrays A and B where B is a permutation (an anagram) of A, return an index array P such that for each i, B[P[i]] == A[i]; when values repeat, each occurrence must map to a distinct matching index. The task is to construct this index mapping efficiently (linear time/space).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 760. Find Anagram Mappings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source