Databricks LeetCode Questions
31 questions all-time · 2 easy · 22 medium · 7 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Design Hit Counter Array, Binary Search, Design, Queue, Data Stream | Medium | 100 | 0.7% |
| 2 | IP to CIDR String, Bit Manipulation | Medium | 97 | 0.5% |
| 3 | Design Tic-Tac-Toe Array, Hash Table, Design, Matrix, Simulation | Medium | 94 | 0.6% |
| 4 | House Robber Array, Dynamic Programming | Medium | 85 | 0.5% |
| 5 | Step-By-Step Directions From a Binary Tree Node to Another String, Tree, Depth-First Search, Binary Tree | Medium | 84 | 0.6% |
| 6 | Find All Anagrams in a String Hash Table, String, Sliding Window | Medium | 84 | 0.5% |
| 7 | Time Based Key-Value Store Hash Table, String, Binary Search, Design | Medium | 82 | 0.5% |
| 8 | House Robber II Array, Dynamic Programming | Medium | 80 | 0.5% |
| 9 | Longest Palindrome by Concatenating Two Letter Words Array, Hash Table, String, Greedy, Counting | Medium | 65 | 0.5% |
| 10 | Closest Leaf in a Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 65 | 0.5% |
| 11 | RLE Iterator Array, Design, Counting, Iterator | Medium | 65 | 0.6% |
| 12 | Number of Recent Calls Design, Queue, Data Stream | Easy | 63 | 0.8% |
| 13 | Shortest Path in a Grid with Obstacles Elimination Array, Breadth-First Search, Matrix | Hard | 63 | 0.5% |
| 14 | Snapshot Array Array, Hash Table, Binary Search, Design | Medium | 61 | 0.4% |
| 15 | Text Justification Array, String, Simulation | Hard | 56 | 0.5% |
| 16 | Split Message Based on Limit String, Enumeration | Hard | 56 | 0.4% |
| 17 | Unique Paths III Array, Backtracking, Bit Manipulation, Matrix | Hard | 52 | 0.8% |
| 18 | Permutation in String Hash Table, Two Pointers, String, Sliding Window | Medium | 52 | 0.5% |
| 19 | Number of Flowers in Full Bloom Array, Hash Table, Binary Search, Sorting, Prefix Sum, Ordered Set | Hard | 43 | 0.6% |
| 20 | Spiral Matrix Array, Matrix, Simulation | Medium | 43 | 0.6% |
| 21 | Longest Mountain in Array Array, Two Pointers, Dynamic Programming, Enumeration | Medium | 43 | 0.4% |
| 22 | Shortest Path in Binary Matrix Array, Breadth-First Search, Matrix | Medium | 43 | 0.5% |
| 23 | Minimum Cost to Reach Destination in Time Array, Dynamic Programming, Graph Theory | Hard | 43 | 0.4% |
| 24 | Minimum Knight Moves Breadth-First Search | Medium | 43 | 0.4% |
| 25 | Find the Length of the Longest Common Prefix Array, Hash Table, String, Trie | Medium | 35 | 0.6% |
| 26 | Finding Pairs With a Certain Sum Array, Hash Table, Design | Medium | 35 | 0.6% |
| 27 | String to Integer (atoi) String | Medium | 35 | 0.2% |
| 28 | Merge Intervals Array, Sorting | Medium | 35 | 0.5% |
| 29 | Count Integers in Intervals Design, Segment Tree, Ordered Set | Hard | 35 | 0.4% |
| 30 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 35 | 0.6% |
| 31 | Two Sum Array, Hash Table | Easy | 35 | 0.6% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.