Add solution #242

Author: JoshCrozier

README.md

@@ -48,6 +48,7 @@
 219|[Contains Duplicate II](./0219-contains-duplicate-ii.js)|Easy|
 226|[Invert Binary Tree](./0226-invert-binary-tree.js)|Easy|
 234|[Palindrome Linked List](./0234-palindrome-linked-list.js)|Easy|
+242|[Valid Anagram](./0242-valid-anagram.js)|Easy|
 263|[Ugly Number](./0263-ugly-number.js)|Easy|
 264|[Ugly Number II](./0264-ugly-number-ii.js)|Medium|
 268|[Missing Number](./0268-missing-number.js)|Easy|

solutions/0242-valid-anagram.js

@@ -0,0 +1,17 @@
+/**
+ * 242. Valid Anagram
+ * https://leetcode.com/problems/valid-anagram/
+ * Difficulty: Easy
+ *
+ * Given two strings s and t, return true if t is an anagram of s, and false otherwise.
+ */
+
+/**
+ * @param {string} s
+ * @param {string} t
+ * @return {boolean}
+ */
+var isAnagram = function(s, t) {
+  const sort = str => str.split('').sort().join('');
+  return sort(s) === sort(t);
+};