Nutanix Depth First Search Questions
14 depth first search problems asked at Nutanix interviews
Easy (1)Medium (8)Hard (5)
Questions
| Title | Difficulty |
|---|---|
| Detect Cycles in 2D Grid | Medium |
| Binary Tree Maximum Path Sum | Hard |
| Longest Increasing Path in a Matrix | Hard |
| Serialize and Deserialize Binary Tree | Hard |
| Course Schedule II | Medium |
| Diameter of Binary Tree | Easy |
| Binary Tree Cameras | Hard |
| Number of Islands | Medium |
| Boundary of Binary Tree | Medium |
| Surrounded Regions | Medium |
| Clone Graph | Medium |
| Pacific Atlantic Water Flow | Medium |
| Maximum Employees to Be Invited to a Meeting | Hard |
| Path With Minimum Effort | Medium |
Showing 14 questions