Add solution #796

Author: JoshCrozier

README.md

@@ -105,6 +105,7 @@
 722|[Remove Comments](./0722-remove-comments.js)|Medium|
 739|[Daily Temperatures](./0739-daily-temperatures.js)|Medium|
 791|[Custom Sort String](./0791-custom-sort-string.js)|Medium|
+796|[Rotate String](./0796-rotate-string.js)|Easy|
 804|[Unique Morse Code Words](./0804-unique-morse-code-words.js)|Easy|
 819|[Most Common Word](./0819-most-common-word.js)|Easy|
 821|[Shortest Distance to a Character](./0821-shortest-distance-to-a-character.js)|Easy|

solutions/0796-rotate-string.js

@@ -0,0 +1,25 @@
+/**
+ * 796. Rotate String
+ * https://leetcode.com/problems/rotate-string/
+ * Difficulty: Easy
+ *
+ * Given two strings s and goal, return true if and only if s can become goal
+ * after some number of shifts on s.
+ *
+ * A shift on s consists of moving the leftmost character of s to the rightmost
+ * position.
+ *
+ * For example, if s = "abcde", then it will be "bcdea" after one shift.
+ */
+
+/**
+ * @param {string} s
+ * @param {string} goal
+ * @return {boolean}
+ */
+var rotateString = function(s, goal) {
+  for (let i = 0; i < s.length; i++) {
+    if (s.slice(i) + s.slice(0, i) === goal) return true;
+  }
+  return false;
+};