Question Link : https://leetcode.com/problems/graph-valid-tree/

Difficulty: Medium

Premium: True

Question

You have a graph of n nodes labeled from 0 to n - 1. You are given an integer n and a list of edges where edges[i] = [ai, bi] indicates that there is an undirected edge between nodes …

Continue reading

Question Link : https://leetcode.com/problems/find-champion-ii/

Difficulty: Medium

Premium: False

Question

There are n teams numbered from 0 to n - 1 in a tournament; each team is also a node in a DAG. You are given the integer n and a 0-indexed 2D integer array edges of length m …

Continue reading