Reverse Linked List Iteratively

Author: joshguha

0-reverseLinkedList.js renamed to 206-reverseLinkedList.js

@@ -7,11 +7,10 @@ reverseList = (head) => {
         if (next === null) {
             return node;
         }
-        reverseListIteratively(node, next, next.next);
+        return reverseListIteratively(node, next, next.next);
     };
 
-    console.log(reverseListIteratively(null, head, head.next));
-    // return reverseListIteratively(null, head, head.next);
+    return reverseListIteratively(null, head, head.next);
 };
 
 function ListNode(val, next) {
@@ -32,15 +31,4 @@ printLinkedList = (head) => {
         console.log(node);
         node = node.next;
     }
-};
-
-let reverseListIteratively = (prev, node, next) => {
-    node.next = prev;
-    if (next === null) {
-        console.log(node);
-        return node;
-    }
-    reverseListIteratively(node, next, next.next);
-};
-
-console.log(reverseListIteratively(null, a, a.next));
+};

33-searchInRotatedSortedArray.js

@@ -0,0 +1,44 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var search = function (nums, target) {
+    if (middle === target) {
+        return Math.floor(nums.length / 2);
+    }
+    let firstHalf = nums.slice(0, Math.ceil(nums.length / 2));
+    let secondHalf = nums.slice(Math.ceil(nums.length / 2), nums.length);
+
+    console.log(middle);
+    console.log(firstHalf);
+    console.log(secondHalf);
+};
+
+let findPivot = (nums) => {
+    let findPivotRecursively = (nums, toAdd) => {
+        let middleIndex = Math.floor(nums.length / 2);
+        let middle = nums[middleIndex];
+        let firstHalf = nums.slice(0, middleIndex);
+        let secondHalf = nums.slice(middleIndex + 1, nums.length);
+        console.log("firstHalf", firstHalf);
+        console.log("secondHalf", secondHalf);
+
+        if (firstHalf[firstHalf.length - 1] < firstHalf[0]) {
+            return findPivotRecursively(firstHalf, 0);
+        } else if (secondHalf[secondHalf.length - 1] < secondHalf[0]) {
+            return findPivotRecursively(secondHalf, middleIndex + 1);
+        } else {
+            if (middle > nums[middleIndex + 1]) {
+                let value = middleIndex + 1 + toAdd;
+                return value;
+            } else {
+                let value = middleIndex + toAdd;
+                return value;
+            }
+        }
+    };
+
+    return findPivotRecursively(nums, 0);
+};
+console.log(findPivot([7, 0, 1, 2, 4, 5, 6]));