neetcode-gh
diff --git a/‎articles/build-a-matrix-with-conditions.md
Lines changed: 526 additions & 0 deletions b/‎articles/build-a-matrix-with-conditions.md
Lines changed: 526 additions & 0 deletions
diff --git a/‎articles/car-pooling.md
Lines changed: 469 additions & 0 deletions b/‎articles/car-pooling.md
Lines changed: 469 additions & 0 deletions
diff --git a/‎articles/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.md
Lines changed: 9 additions & 8 deletions b/‎articles/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.md
Lines changed: 9 additions & 8 deletions
@@ -578,28 +578,28 @@ class UnionFind {
      * @param {number} n
      */
     constructor(n) {
-        this.n = n;
         this.Parent = Array.from({ length: n + 1 }, (_, i) => i);
         this.Size = Array(n + 1).fill(1);
+        this.n = n;
     }
 
     /**
-     * @param {number} v1
+     * @param {number} node
      * @return {number}
      */
-    find(v1) {
+    find(node) {
         if (this.Parent[node] !== node) {
             this.Parent[node] = this.find(this.Parent[node]);
         }
         return this.Parent[node];
     }
 
     /**
-     * @param {number} v1
-     * @param {number} v2
+     * @param {number} u
+     * @param {number} v
      * @return {boolean}
      */
-    union(v1, v2) {
+    union(u, v) {
         let pu = this.find(u);
         let pv = this.find(v);
         if (pu === pv) return false;
@@ -612,6 +612,9 @@ class UnionFind {
         return true;
     }
 
+    /**
+     * @return {number}
+     */
     isConnected() {
         return this.n === 1;
     }
@@ -960,8 +963,6 @@ class Solution:
                 if edges[i][2] == edges[ind][2]:
                     pseudo.add(i)
                     pseudo.add(ind)
-                    mstEdge.add(i)
-                    mstEdge.add(ind)
 
         return [list(mstEdge - pseudo), list(pseudo)]
 ```