Crushing the Shortest Path Challenge at Databricks: A Disappointing Turn

databricks | Other | Interview Experience

Interview Date: Not specified
Result: Rejected
Difficulty: Not specified

Interview Process

The interview consisted of a coding challenge focused on finding the optimal commute. The candidate completed the code and passed the tests but had a minor bug that was not resolved in the initial submission. The overall experience was disappointing as the candidate received a standard rejection letter shortly after.

Technical Questions

  1. Shortest Path (Graph Theory, Dijkstra’s Algorithm)

Tips & Insights

Be sure to thoroughly test your code for any minor bugs before submission, as they can impact the outcome of the interview.