databricks | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview consisted of two coding rounds, each lasting one hour.
In the first round, the candidate was asked to implement a variant of Tic-Tac-Toe. The task involved creating a class to play the game, where the grid could be non-square, and a player wins by connecting ‘k’ consecutive pieces, with ‘k’ being a parameter.
The second round focused on an algorithm question related to a variant of unique paths, which essentially required implementing a breadth-first search (BFS) on a 2D grid.
Technical Questions
- Tic-Tac-Toe variant (Game Design)
- Unique Paths (BFS on 2D grid)
Tips & Insights
Be prepared for both game design and algorithmic questions. Understanding BFS and grid-based problems is crucial.