#686Medium#3 in Snowflake's list· asked at 4 companies
Graph Valid Tree
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: n = 5, edges = [[0,1],[0,2],[0,3],[1,4]] Output: true
Example 2
Input: n = 5, edges = [[0,1],[1,2],[2,3],[1,3],[1,4]] Output: false
1-2-3 forms a cycle.
Constraints
- •
1 <= n <= 2000 - •
0 <= edges.length <= 5000 - •
edges[i].length == 2 - •
There are no self-loops or repeated edges.