diff --git a/javascript/anagrams/README.md b/javascript/anagrams/README.md
new file mode 100644
index 0000000..f987f1b
--- /dev/null
+++ b/javascript/anagrams/README.md
@@ -0,0 +1,21 @@
+What is an anagram? Well, two words are anagrams of each other if they both contain the same letters. For example:
+
+```js
+'abba' & 'baab' == true
+
+'abba' & 'bbaa' == true
+
+'abba' & 'abbba' == false
+
+'abba' & 'abca' == false
+```
+
+Write a function that will find all the anagrams of a word from a list. You will be given two inputs a word and an array with words. You should return an array of all the anagrams or an empty array if there are none. For example:
+
+```js
+anagrams('abba', ['aabb', 'abcd', 'bbaa', 'dada']) => ['aabb', 'bbaa']
+
+anagrams('racer', ['crazer', 'carer', 'racar', 'caers', 'racer']) => ['carer', 'racer']
+
+anagrams('laser', ['lazing', 'lazy',  'lacer']) => []
+```