added problem smallest_sort_window

Author: RubinderS

easy/smallest_sort_window/README.md

@@ -0,0 +1 @@
+Given an array of integers out of order, determine the bounds of the smallest window that must be sorted in order for the entire array to be sorted. For example, given [3, 7, 5, 6, 9], you should return (1, 3).

easy/smallest_sort_window/smallest_sort_window.js

@@ -0,0 +1,24 @@
+/**
+ * @param {number[]} arr
+ * @returns {number[]}
+ */
+function smallestSortWindow(arr) {
+  let s = -1;
+  let f = -1;
+
+  for (let i = 0; i < arr.length; i++) {
+    if (s !== -1) {
+      if (arr[s] > arr[i]) {
+        f = i;
+      } else if (arr[i] > arr[i + 1]) {
+        f = i + 1;
+      }
+    } else if (arr[i] > arr[i + 1]) {
+      s = i;
+    }
+  }
+
+  return [s, f];
+}
+
+module.exports = smallestSortWindow;

easy/smallest_sort_window/test.json

@@ -0,0 +1,20 @@
+{
+  "title": "smallest_sort_window",
+  "tests": [
+    {
+      "desc": 1,
+      "args": [[3, 7, 5, 6, 9]],
+      "exp": [1, 3]
+    },
+    {
+      "desc": 2,
+      "args": [[1, 2, 3, 7, 5, 6, 4, 8]],
+      "exp": [3, 6]
+    },
+    {
+      "desc": 3,
+      "args": [[2, 6, 4, 8, 10, 9, 15]],
+      "exp": [1, 5]
+    }
+  ]
+}