Add Find Champion II

Author: thanthtooaung-coding

Find Champion II/README.md

@@ -0,0 +1,33 @@
+# Find Champion II
+
+## LeetCode Problem
+- Problem Number: 2924
+- Problem Link: https://leetcode.com/problems/find-champion-ii/description/
+- Difficulty: Medium
+- Topics: Graph, Directed Acyclic Graph (DAG)
+
+## Problem Description
+There are n teams numbered from 0 to n - 1 in a tournament; each team is also a node in a DAG (Directed Acyclic Graph).
+
+Given:
+- An integer n (number of teams)
+- A 0-indexed 2D integer array `edges` of length m representing the DAG
+  - `edges[i] = [ui, vi]` indicates a directed edge from team ui to team vi
+  - A directed edge from a to b means team a is stronger than team b
+
+A team will be the champion if there is no other team that is stronger than it.
+
+Return:
+- The team number that will be the champion if there is a unique champion
+- -1 if there is no unique champion
+
+## Examples
+
+### Example 1:
+
+### Notes
+- A cycle is a series of nodes a1, a2, ..., an, an+1 where:
+  - Node a1 is the same as node an+1
+  - Nodes a1, a2, ..., an are distinct
+  - There is a directed edge from node ai to node ai+1 for every i in [1, n]
+- A DAG is a directed graph that does not have any cycle

Find Champion II/Solution.java

@@ -0,0 +1,23 @@
+class Solution {
+    public int findChampion(int n, int[][] edges) {
+        int[] inDegree = new int[n];
+
+        for (int[] edge : edges) {
+            int from = edge[0];
+            int to = edge[1];
+            inDegree[to]++;
+        }
+
+        int champion = -1;
+        for (int i = 0; i < n; i++) {
+            if (inDegree[i] == 0) {
+                if (champion != -1) {
+                    return -1;
+                }
+                champion = i;
+            }
+        }
+        
+        return champion;
+    }
+}

README.md

@@ -1,2 +1,41 @@
-# Solving-LeetCode-Problems
-This repository contains solutions to the problems I have solved on LeetCode. I will continue to update it with my progress.
+# Solving LeetCode Problems
+
+This repository contains my solutions to various LeetCode problems. Each solution is implemented in Java and includes detailed explanations.
+
+## Repository Structure
+
+Each problem has its own directory containing:
+- `README.md` - Problem description, examples, and approach
+- `Solution.java` - Java implementation of the solution
+
+## Problems Solved
+
+| # | Title | Difficulty | Solution | Topics |
+|---|-------|------------|----------|---------|
+| 2924 | [Find Champion II](Find%20Champion%20II) | Medium | [Java](Find%20Champion%20II/Solution.java) | Graph |
+
+## Categories
+
+### By Difficulty
+- Easy: 0
+- Medium: 1
+- Hard: 0
+
+### By Topics
+- Graph Problems
+  - [Find Champion II](Find%20Champion%20II)
+
+## About LeetCode
+
+[LeetCode](https://leetcode.com) is a platform for preparing technical coding interviews. It has a vast collection of problems covering various topics in computer science.
+
+## Contributing
+
+While this repository primarily contains my personal solutions, feel free to:
+- Suggest improvements to existing solutions
+- Point out bugs or issues
+- Discuss alternative approaches
+
+## License
+
+This repository is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.