Mar 22

Author: siddydutta

2025-03-March-LeetCoding-Challenge/Count the Number of Complete Components.py

@@ -0,0 +1,45 @@
+from collections import defaultdict
+
+
+class Solution:
+    def countCompleteComponents(self, n: int, edges: list[list[int]]) -> int:
+        graph = defaultdict(list)
+        for u, v in edges:
+            graph[u].append(v)
+            graph[v].append(u)
+        visited = set()
+
+        def dfs(u: int) -> tuple[int, int]:
+            nonlocal visited, graph
+            visited.add(u)
+            nodes, edges = 1, len(graph[u])
+            for v in graph[u]:
+                if v in visited:
+                    continue
+                sub_nodes, sub_edges = dfs(v)
+                nodes += sub_nodes
+                edges += sub_edges
+            return nodes, edges
+
+        completed = 0
+        for node in range(n):
+            if node in visited:
+                continue
+            nodes, edges = dfs(node)
+            if nodes * (nodes - 1) == edges:
+                completed += 1
+        return completed
+
+
+def main():
+    n = 6
+    edges = [[0, 1], [0, 2], [1, 2], [3, 4]]
+    assert Solution().countCompleteComponents(n, edges) == 3
+
+    n = 6
+    edges = [[0, 1], [0, 2], [1, 2], [3, 4], [3, 5]]
+    assert Solution().countCompleteComponents(n, edges) == 1
+
+
+if __name__ == '__main__':
+    main()

2025-03-March-LeetCoding-Challenge/README.md

@@ -25,7 +25,7 @@
 | March 19 | [3191. Minimum Operations to Make Binary Array Elements Equal to One I](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/) | Medium | Solved |
 | March 20 | [3108. Minimum Cost Walk in Weighted Graph](https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/) | Hard | Unsolved |
 | March 21 | [2115. Find All Possible Recipes from Given Supplies](https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/) | Medium | Unsolved |
-| March 22 | []() |  |  |
+| March 22 | [2685. Count the Number of Complete Components](https://leetcode.com/problems/count-the-number-of-complete-components/) | Medium | Unsolved |
 | March 23 | []() |  |  |
 | March 24 | []() |  |  |
 | March 25 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 6 | 6 | 0 |
-| Medium | 14 | 6 | 8 |
+| Medium | 15 | 6 | 9 |
 | Hard   | 1 | 0 | 1 |