DSA Doctor
Verified Company Vault
30d Active
Databricks DSA Interview Questions
31 curated coding interview questions directly asked in Databricks technical rounds, sorted by frequency with recency and difficulty diagnostics.
31
Total Questions
2 (6%)
Easy Problems
22 (71%)
Medium Problems
7 (23%)
Hard Problems
🔥 Most Tested Topics:
Arrays (10)Core DSA (9)Strings (4)Design (3)Trees (3)
📂 Sourced Datasets:
Last 30 daysLast 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 362 | Design Hit Counter | Medium | Design | Data Structure Design | 69.7% | 100.0% | 30d |
| 751 | IP to CIDR | Medium | Core DSA | Implementation / Reasoning | 53.6% | 100.0% | 3m |
| 438 | Find All Anagrams in a String | Medium | Strings | Hashing / Sliding Window | 53.8% | 100.0% | 3m |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Medium | Trees | DFS / BFS | 56.4% | 87.5% | 6m |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | Hard | Trees | DFS / BFS | 46.3% | 87.5% | 6m |
| 348 | Design Tic-Tac-Toe | Medium | Design | Data Structure Design | 58.7% | 75.0% | 3m |
| 981 | Time Based Key-Value Store | Medium | Core DSA | Implementation / Reasoning | 49.9% | 75.0% | 3m |
| 900 | RLE Iterator | Medium | Design | Data Structure Design | 59.3% | 75.0% | 3m |
| 213 | House Robber II | Medium | Dynamic Programming | State Transition | 44.9% | 75.0% | all |
| 567 | Permutation in String | Medium | Strings; Backtracking | Hashing / Sliding Window; Sliding Window; Backtracking | 48.9% | 62.5% | 6m |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 62.5% | 6m |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 62.5% | 6m |
| 1197 | Minimum Knight Moves | Medium | Arrays | Sorting / Prefix / Scan | 42.0% | 62.5% | 6m |
| 933 | Number of Recent Calls | Easy | Core DSA | Implementation / Reasoning | 78.5% | 62.5% | 6m |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | Medium | Strings | Hashing / Sliding Window | 53.5% | 62.5% | all |
| 1146 | Snapshot Array | Medium | Arrays | Sorting / Prefix / Scan | 36.8% | 62.5% | all |
| 742 | Closest Leaf in a Binary Tree | Medium | Trees | DFS / BFS | 47.4% | 62.5% | all |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 50.0% | all |
| 2468 | Split Message Based on Limit | Hard | Core DSA | Implementation / Reasoning | 42.1% | 50.0% | all |
| 980 | Unique Paths III | Hard | Core DSA | Implementation / Reasoning | 82.8% | 50.0% | all |
| 2251 | Number of Flowers in Full Bloom | Hard | Core DSA | Implementation / Reasoning | 57.9% | 37.5% | all |
| 3043 | Find the Length of the Longest Common Prefix | Medium | Core DSA | Implementation / Reasoning | 62.2% | 37.5% | all |
| 1865 | Finding Pairs With a Certain Sum | Medium | Arrays | Sorting / Prefix / Scan | 61.6% | 37.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 37.5% | all |
| 845 | Longest Mountain in Array | Medium | Arrays | Sorting / Prefix / Scan | 42.1% | 37.5% | all |
| 8 | String to Integer (atoi) | Medium | Strings | Hashing / Sliding Window | 21.0% | 37.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 37.5% | all |
| 1091 | Shortest Path in Binary Matrix | Medium | Arrays | Sorting / Prefix / Scan | 51.5% | 37.5% | all |
| 1928 | Minimum Cost to Reach Destination in Time | Hard | Arrays | Sorting / Prefix / Scan | 41.6% | 37.5% | all |
| 2276 | Count Integers in Intervals | Hard | Arrays | Sorting / Prefix / Scan | 35.9% | 37.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 37.5% | all |