•PRACTICE
DSA Question Tracker & Breakdowns
12 problems from Uber tagged DFS with full breakdowns.
Loading problems…
Practice with a Mock Interview
Solve these problems under real interview pressure with our AI interviewer.
Start Mock Interview →•PRACTICE
12 problems from Uber tagged DFS with full breakdowns.
Solve these problems under real interview pressure with our AI interviewer.
Start Mock Interview →Filter by company
Clear all ✕Filter by topic
to save your progress.
| ✓ 0 | Problem | Difficulty | Companies | Breakdown / Solution | LeetCode |
|---|---|---|---|---|---|
| Number of Islands | Medium | 5 companies | View breakdown → | ||
| Course Schedule II | Medium | 5 companies | View breakdown → | ||
| Maximum Depth of Binary Tree | Easy | 7 companies | View breakdown → | ||
| Same Tree | Easy | 6 companies | View breakdown → | ||
| Alien Dictionary | Hard | 6 companies | View breakdown → | ||
| Kth Smallest Element in a BST | Medium | 6 companies | View breakdown → | ||
| Lowest Common Ancestor of a Binary Tree | Medium | 8 companies | View breakdown → | ||
| Clone Graph | Medium | 5 companies | View breakdown → | ||
| Serialize and Deserialize Binary Tree | Hard | 8 companies | View breakdown → | ||
| Evaluate Division | Medium | 2 companies | View breakdown → | ||
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 3 companies | View breakdown → | ||
| Minimum Fuel Cost to Report to the Capital | Medium | 1 companies | View breakdown → |