Time: 1 ms (100.00%), Space: 45.8 MB (45.59%) - LeetHub

py3-coder · py3-coder · commit d5378e5a9104 · 2024-11-26T18:25:06.000+05:30
diff --git a/2924-find-champion-ii/2924-find-champion-ii.java b/2924-find-champion-ii/2924-find-champion-ii.java
@@ -0,0 +1,21 @@
+class Solution {
+    public int findChampion(int n, int[][] edges) {
+        
+        //Topo sort type concept
+        int[] indegree = new int[n];
+        
+        for(int[] edge : edges){
+            indegree[edge[1]]++;
+        }
+        int cnt=0,node=-1;
+        for(int i=0;i<n;i++){
+            if(indegree[i]==0){
+                cnt++;
+                node=i;
+            }
+        }
+        
+        return (cnt>1)?-1:node;
+        
+    }
+}
