4 solutions

Author: nowrobin

find-minimum-in-rotated-sorted-array/nowrobin.js

@@ -0,0 +1,20 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMin = function(nums) {
+    let left = 0;
+    let right = nums.length - 1;
+
+    while (left < right) {
+        const mid = Math.floor((left + right) / 2);
+
+        if (nums[mid] > nums[right]) {
+            left = mid + 1;
+        } else {
+            right = mid;
+        }
+    }
+
+    return nums[left];
+};

maximum-depth-of-binary-tree/nowrobin.js

@@ -0,0 +1,20 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+var maxDepth = function(root) {
+    if (root === null) return 0;
+    
+    const left = maxDepth(root.left);
+    const right = maxDepth(root.right);
+
+    return Math.max(left, right) + 1;
+};

merge-two-sorted-lists/nowrobin.js

@@ -0,0 +1,29 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} list1
+ * @param {ListNode} list2
+ * @return {ListNode}
+ */
+var mergeTwoLists = function(list1, list2) {
+    let dummy = new ListNode(0);
+    let current = dummy;
+    while (list1 !== null && list2 !== null) {
+        if (list1.val < list2.val) {
+            current.next = list1; 
+            list1 = list1.next;     
+        } else {
+            current.next = list2;  
+            list2 = list2.next;     
+        }
+        current = current.next;     
+    }
+    current.next = list1 !== null ? list1 : list2;
+
+    return dummy.next;
+};

word-search/nowrobin.js

@@ -0,0 +1,37 @@
+/**
+ * @param {character[][]} board
+ * @param {string} word
+ * @return {boolean}
+ */
+var exist = function(board, word) {
+    const rows = board.length;
+    const cols = board[0].length;
+
+    function dfs(r, c, index) {
+        if (r < 0 || c < 0 || r >= rows || c >= cols) return false;
+        if (board[r][c] !== word[index]) return false;
+
+        if (index === word.length - 1) return true;
+
+        const temp = board[r][c];
+        board[r][c] = "#";
+
+        const found =
+            dfs(r + 1, c, index + 1) ||
+            dfs(r - 1, c, index + 1) ||
+            dfs(r, c + 1, index + 1) ||
+            dfs(r, c - 1, index + 1);
+
+        board[r][c] = temp;
+
+        return found;
+    }
+
+    for (let r = 0; r < rows; r++) {
+        for (let c = 0; c < cols; c++) {
+            if (dfs(r, c, 0)) return true;
+        }
+    }
+
+    return false;
+};