Create 2924. Find Champion II (#644)

Author: Chayandas07

2924. Find Champion II

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int findChampion(int n, vector<vector<int>>& edges) {
+        vector<int>in(n, 0);
+        int sz = edges.size();
+        for (int i = 0; i < sz; i++) {         
+            in[edges[i][1]]++;
+        }
+        int result = -1;
+        for (int i = 0; i < n; i++) {
+            if (in[i] == 0) {
+                if (result >= 0) return -1;
+                result = i;
+            }
+        }
+        return result;
+    }
+};