Given n nodes (0 to n-1) and a list of undirected edges, determine if they form a valid tree.
Input: n=5, edges=[[0,1],[0,2],[0,3],[1,4]] Output: true Input: n=5, edges=[[0,1],[1,2],[2,3],[1,3],[1,4]] Output: false (cycle)
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features