Databricks Breadth First Search Questions
5 breadth first search problems asked at Databricks interviews
Medium (4)Hard (1)
Questions
| Title | Difficulty |
|---|---|
| Closest Leaf in a Binary Tree | Medium |
| Shortest Path in a Grid with Obstacles Elimination | Hard |
| Shortest Path in Binary Matrix | Medium |
| Minimum Knight Moves | Medium |
| Rotting Oranges | Medium |
Showing 5 questions