diff --git a/Find Anagram Mappings.py b/Find Anagram Mappings.py
new file mode 100644
index 0000000..87e9116
--- /dev/null
+++ b/Find Anagram Mappings.py	
@@ -0,0 +1,33 @@
+# -*- coding: utf-8 -*-
+"""
+Created on Wed May  9 09:36:51 2018
+
+@author: sun_y
+"""
+
+"""
+Given two lists Aand 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 ith 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 0th element of A appears at B[1], and P[1] = 4 because the 1st 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].
+"""
+class Solution:
+    def anagramMappings(self, A, B):
+        """
+        :type A: List[int]
+        :type B: List[int]
+        :rtype: List[int]
+        """
+
+        D = {x: i for i, x in enumerate(B)}
+        return [D[x] for x in A]
\ No newline at end of file