Add solution #205

Author: JoshCrozier

README.md

@@ -133,6 +133,7 @@
 202|[Happy Number](./0202-happy-number.js)|Easy|
 203|[Remove Linked List Elements](./0203-remove-linked-list-elements.js)|Easy|
 204|[Count Primes](./0204-count-primes.js)|Medium|
+205|[Isomorphic Strings](./0205-isomorphic-strings.js)|Easy|
 206|[Reverse Linked List](./0206-reverse-linked-list.js)|Easy|
 207|[Course Schedule](./0207-course-schedule.js)|Medium|
 213|[House Robber II](./0213-house-robber-ii.js)|Medium|

solutions/0205-isomorphic-strings.js

@@ -0,0 +1,27 @@
+/**
+ * 205. Isomorphic Strings
+ * https://leetcode.com/problems/isomorphic-strings/
+ * Difficulty: Easy
+ *
+ * Given two strings s and t, determine if they are isomorphic.
+ *
+ * Two strings s and t are isomorphic if the characters in s can be replaced to get t.
+ *
+ * All occurrences of a character must be replaced with another character while preserving
+ * the order of characters. No two characters may map to the same character, but a character
+ * may map to itself.
+ */
+
+/**
+ * @param {string} s
+ * @param {string} t
+ * @return {boolean}
+ */
+var isIsomorphic = function(s, t) {
+  for (let i = 0; i < s.length; i++) {
+    if (s.indexOf(s[i], i + 1) !== t.indexOf(t[i], i + 1)) {
+      return false;
+    }
+  }
+  return true;
+};