idk

Author: aluferraz

leetcode/editor/en/Q1462/CourseScheduleIv.py

@@ -0,0 +1,29 @@
+from typing import List
+
+
+# leetcode submit region begin(Prohibit modification and deletion)
+class Solution:
+    def checkIfPrerequisite(self, numCourses: int, prerequisites: List[List[int]], queries: List[List[int]]) -> List[
+        bool]:
+        # Create an adjacency matrix to track reachability
+        reachable = [[False] * numCourses for _ in range(numCourses)]
+
+        # Mark direct prerequisites
+        for u, v in prerequisites:
+            reachable[u][v] = True
+
+        # Use Floyd-Warshall to compute transitive closure
+        for k in range(numCourses):
+            for i in range(numCourses):
+                for j in range(numCourses):
+                    reachable[i][j] = reachable[i][j] or (reachable[i][k] and reachable[k][j])
+
+        # Answer the queries
+        return [reachable[u][v] for u, v in queries]
+
+
+# leetcode submit region end(Prohibit modification and deletion)
+
+
+class CourseScheduleIv(Solution):
+    pass

leetcode/editor/en/Q684/RedundantConnection.py

@@ -0,0 +1,42 @@
+import collections
+from typing import List
+
+
+# leetcode submit region begin(Prohibit modification and deletion)
+class Solution:
+    def findRedundantConnection(self, edges: List[List[int]]) -> List[int]:
+
+        parents = collections.defaultdict(-1)
+
+        def find(i):
+            path_comp = []
+            while parents[i] >= 0:
+                path_comp.append(i)
+                i = parents[i]
+            while path_comp:
+                parents[path_comp.pop()] = i
+            return i
+
+        def union(i, j):
+            if i == j:
+                return
+            if parents[j] < parents[i]:
+                return union(j, i)
+            parents[i] += parents[j]
+            parents[j] = i
+
+        ans = ()
+        for u, v in edges:
+            pu, pv = find(u), find(v)
+            if pu == pv:
+                ans = (u, v)
+            else:
+                union(pu, pv)
+        return ans
+
+
+# leetcode submit region end(Prohibit modification and deletion)
+
+
+class RedundantConnection(Solution):
+    pass

main.py

@@ -1,4 +1,4 @@
-from leetcode.editor.en.Q1765.MapOfHighestPeak import MapOfHighestPeak
+from leetcode.editor.en.Q1462.CourseScheduleIv import CourseScheduleIv
 
 if __name__ == '__main__':
-    print(MapOfHighestPeak().highestPeak(isWater=[[0, 0, 1], [1, 0, 0], [0, 0, 0]]))
+    print(CourseScheduleIv().checkIfPrerequisite(numCourses=2, prerequisites=[[1, 0]], queries=[[0, 1], [1, 0]]))