Merge pull request #167 from yolophg/main

Author: yolophg

graph-valid-tree/yolophg.js

@@ -0,0 +1,51 @@
+// Time Complexity: O(n)
+// Space Complexity: O(n)
+
+class Solution {
+  validTree(n, edges) {
+    // initialize Union-Find data structure
+    const parent = Array(n)
+      .fill(0)
+      .map((_, index) => index);
+    const rank = Array(n).fill(1);
+
+    // find function with path compression
+    function find(x) {
+      if (parent[x] !== x) {
+        parent[x] = find(parent[x]);
+      }
+      return parent[x];
+    }
+
+    // union function with union by rank
+    function union(x, y) {
+      const rootX = find(x);
+      const rootY = find(y);
+      if (rootX !== rootY) {
+        if (rank[rootX] > rank[rootY]) {
+          parent[rootY] = rootX;
+        } else if (rank[rootX] < rank[rootY]) {
+          parent[rootX] = rootY;
+        } else {
+          parent[rootY] = rootX;
+          rank[rootX] += 1;
+        }
+      } else {
+        // if rootX == rootY, there is a cycle
+        return false;
+      }
+      return true;
+    }
+
+    // process each edge
+    for (const [u, v] of edges) {
+      if (!union(u, v)) {
+        // if union returns false, a cycle is detected
+        return false;
+      }
+    }
+
+    // if all unions are successful, it's a valid tree
+    return true;
+  }
+}

house-robber-ii/yolophg.js

@@ -0,0 +1,26 @@
+// Time Complexity: O(n)
+// Space Complexity: O(n)
+
+var rob = function (nums) {
+  // to rob a linear list of houses
+  function robLinear(houses) {
+    let prev1 = 0;
+    let prev2 = 0;
+
+    for (let money of houses) {
+      let temp = Math.max(prev1, money + prev2);
+      prev2 = prev1;
+      prev1 = temp;
+    }
+
+    return prev1;
+  }
+
+  // 1. excluding the last house (rob from first to second-to-last)
+  // 2. excluding the first house (rob from second to last)
+  let robFirstToSecondLast = robLinear(nums.slice(0, -1));
+  let robSecondToLast = robLinear(nums.slice(1));
+
+  // return the maximum money
+  return Math.max(robFirstToSecondLast, robSecondToLast);
+};

house-robber/yolophg.js

@@ -0,0 +1,25 @@
+// Time Complexity: O(n)
+// Space Complexity: O(n)
+
+var rob = function (nums) {
+  // to store the maximum money that can be robbed up to each house
+  let memo = new Array(nums.length).fill(-1);
+
+  function robFrom(i) {
+    // if the index is out of bounds, return 0
+    if (i >= nums.length) return 0;
+
+    // 1. rob this house and move to the house two steps ahead
+    // 2. skip this house and move to the next house
+    // take the maximum of these two choices
+    let result = Math.max(nums[i] + robFrom(i + 2), robFrom(i + 1));
+
+    // store the result
+    memo[i] = result;
+
+    return result;
+  }
+
+  // start robbing from the first house
+  return robFrom(0);
+};

longest-palindromic-substring/yolophg.js

@@ -0,0 +1,31 @@
+// Time Complexity: O(n^2)
+// Space Complexity: O(1)
+
+var longestPalindrome = function (s) {
+  let start = 0,
+    maxLength = 1;
+
+  // to expand around the center and update the start and maxLength
+  function expandAroundCenter(left, right) {
+    while (left >= 0 && right < s.length && s[left] === s[right]) {
+      left--;
+      right++;
+    }
+    // update the start and maxLength if a longer palindrome is found
+    if (maxLength < right - left - 1) {
+      start = left + 1;
+      maxLength = right - left - 1;
+    }
+  }
+
+  // iterate through each character in the string
+  for (let i = 0; i < s.length; i++) {
+    // expand around the current character
+    expandAroundCenter(i, i);
+    // expand around the current and next character
+    expandAroundCenter(i, i + 1);
+  }
+
+  // return the longest palindromic substring
+  return s.substring(start, start + maxLength);
+};

number-of-connected-components-in-an-undirected-graph/yolophg.js

@@ -0,0 +1,39 @@
+// Time Complexity: O(n + m) m : number of edges
+// Space Complexity: O(n)
+
+class Solution {
+  countComponents(n, edges) {
+    // initialize the parent array where each node is its own parent initially
+    const parent = new Array(n).fill(0).map((_, index) => index);
+
+    // to find the root of a node with path compression
+    const find = (node) => {
+      if (parent[node] !== node) {
+        parent[node] = find(parent[node]);
+      }
+      return parent[node];
+    };
+
+    // to union two nodes
+    const union = (node1, node2) => {
+      const root1 = find(node1);
+      const root2 = find(node2);
+      if (root1 !== root2) {
+        parent[root1] = root2;
+      }
+    };
+
+    // union all the edges
+    for (let [a, b] of edges) {
+      union(a, b);
+    }
+
+    // count the number of unique roots
+    const uniqueRoots = new Set();
+    for (let i = 0; i < n; i++) {
+      uniqueRoots.add(find(i));
+    }
+
+    return uniqueRoots.size;
+  }
+}