Databricks
Systems-heavy loops — strong algorithms, distributed data-processing questions, and design rounds about query and storage layers.
Typical loop
- 1Recruiter screen
- 2Technical phone screen
- 3Onsite: two algorithm rounds
- 4Distributed-systems design round
- 5Hiring-manager conversation
Questions
Callback's practice questions and the LeetCode questions Databricks has been asking, filtered together.
Asked on LeetCode
31 questions · all time
- Design Hit CountermediumArrayBinary SearchDesignQueue+1frequency 100.0
- IP to CIDRmediumStringBit Manipulationfrequency 97.6
- Design Tic-Tac-ToemediumArrayHash TableDesignMatrix+1frequency 93.6
- Find All Anagrams in a StringmediumHash TableStringSliding Windowfrequency 84.4
- House RobbermediumArrayDynamic Programmingfrequency 83.7
- Step-By-Step Directions From a Binary Tree Node to AnothermediumStringTreeDepth-First SearchBinary Tree+2frequency 83.7
- Time Based Key-Value StoremediumHash TableStringBinary SearchDesignfrequency 79.9
- House Robber IImediumArrayDynamic Programmingfrequency 78.1
- RLE IteratormediumArrayDesignCountingIteratorfrequency 65.2
- Number of Recent CallseasyDesignQueueData Streamfrequency 63.3
- Shortest Path in a Grid with Obstacles EliminationhardArrayBreadth-First SearchMatrixfrequency 63.3
- Closest Leaf in a Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 61.1
- Longest Palindrome by Concatenating Two Letter WordsmediumArrayHash TableStringGreedy+1frequency 61.1
- Snapshot ArraymediumArrayHash TableBinary SearchDesign+1frequency 61.1
- Permutation in StringmediumHash TableTwo PointersStringSliding Windowfrequency 52.4
- Unique Paths IIIhardArrayBacktrackingBit ManipulationMatrix+1frequency 52.4
- Text JustificationhardArrayStringSimulationfrequency 48.3
- Count Integers in IntervalshardDesignSegment TreeOrdered Setfrequency 43.0
- Merge IntervalsmediumArraySortingQuicksortfrequency 43.0
- Minimum Cost to Reach Destination in TimehardArrayDynamic ProgrammingGraph TheoryDijkstra's Algorithmfrequency 43.0
- Minimum Knight MovesmediumBreadth-First SearchHeuristic SearchBidirectional SearchA* Searchfrequency 43.0
- Number of Flowers in Full BloomhardArrayHash TableBinary SearchSorting+2frequency 43.0
- Rotting OrangesmediumArrayBreadth-First SearchMatrixfrequency 43.0
- Shortest Path in Binary MatrixmediumArrayBreadth-First SearchMatrixfrequency 43.0
- Spiral MatrixmediumArrayMatrixSimulationfrequency 43.0
- Find the Length of the Longest Common PrefixmediumArrayHash TableStringTriefrequency 35.5
- Finding Pairs With a Certain SummediumArrayHash TableDesignfrequency 35.5
- Longest Mountain in ArraymediumArrayTwo PointersDynamic ProgrammingEnumerationfrequency 35.5
- Split Message Based on LimithardStringEnumerationfrequency 35.5
- String to Integer (atoi)mediumStringfrequency 35.5
- Two SumeasyArrayHash Tablefrequency 35.5