# Coding Problems #001

## Introductory Note

*Playing with Problems* is a standalone article series where I discuss in-depth the solution and concepts behind technical puzzles. The format for this series allows the reader to read the problem, solution, and problem analysis.

## Problem

Given two lists `A`

and `B`

, and `B`

is an anagram of `A`

. `B`

is an anagram of `A`

means `B`

is made by randomizing the order of the elements in `A`

.

We want to find an *index mapping* `P`

, from `A`

to `B`

. A mapping `P[i] = j`

means the `i`

th element in `A`

appears in `B`

at index `j`

.

These lists `A`

and `B`

may contain duplicates. If there are multiple answers, output any of them.

For example, given

`A = [12, 28, 46, 32, 50]`

B = [50, 12, 32, 46, 28]

We should return

`[1, 4, 3, 2, 0]`

as `P[0] = 1`

because the `0`

th element of `A`

appears at `B[1]`

, and `P[1] = 4`

because the `1`

st element of `A`

appears at `B[4]`

, and so on.

**Note:**

`A, B`

have equal lengths in range`[1, 100]`

.`A[i], B[i]`

are integers in range`[0, 10^5]`

.

## Solution

Resource: LeetCode #760 - Find Anagram Mappings