Add solution #899

Author: JoshCrozier

README.md

@@ -709,6 +709,7 @@
 896|[Monotonic Array](./0896-monotonic-array.js)|Easy|
 897|[Increasing Order Search Tree](./0897-increasing-order-search-tree.js)|Easy|
 898|[Bitwise ORs of Subarrays](./0898-bitwise-ors-of-subarrays.js)|Medium|
+899|[Orderly Queue](./0899-orderly-queue.js)|Hard|
 901|[Online Stock Span](./0901-online-stock-span.js)|Medium|
 905|[Sort Array By Parity](./0905-sort-array-by-parity.js)|Easy|
 909|[Snakes and Ladders](./0909-snakes-and-ladders.js)|Medium|

solutions/0899-orderly-queue.js

@@ -0,0 +1,28 @@
+/**
+ * 899. Orderly Queue
+ * https://leetcode.com/problems/orderly-queue/
+ * Difficulty: Hard
+ *
+ * You are given a string s and an integer k. You can choose one of the first k letters of s
+ * and append it at the end of the string.
+ *
+ * Return the lexicographically smallest string you could have after applying the mentioned
+ * step any number of moves.
+ */
+
+/**
+ * @param {string} s
+ * @param {number} k
+ * @return {string}
+ */
+var orderlyQueue = function(s, k) {
+  if (k === 1) {
+    let smallest = s;
+    for (let i = 0; i < s.length; i++) {
+      const rotated = s.slice(i) + s.slice(0, i);
+      if (rotated < smallest) smallest = rotated;
+    }
+    return smallest;
+  }
+  return [...s].sort().join('');
+};