Problem database last updated: June 20, 2025
27 problems · 1 Easy, 17 Medium, 9 Hard · Ranked #73 of 458
1 Easy
4% · avg 23%
17 Medium
63% · avg 59%
9 Hard
33% · avg 18%
Based on 27 reported problems, Databricks interviews are significantly harder than average - 33% Hard vs 18% across all companies. The majority (63%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Databricks puts unusual emphasis on ordered-set (18.5% of problems, 18.3x the industry average), data-stream (7.4% of problems, 11.1x the industry average), enumeration (7.4% of problems, 9.1x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (66.7%), hash-table (37%), string (29.6%), binary-search (25.9%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob... | Medium | Very Likely | arraydynamic-programming | Solve |
House Robber II You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in... | Medium | Very Likely | arraydynamic-programming | Solve |
Time Based Key-Value Store Design a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain... | Medium | Very Likely | hash-tablestringbinary-search | Solve |
Snapshot Array Implement a SnapshotArray that supports the following interface: | Medium | Likely | arrayhash-tablebinary-search | Solve |
Longest Palindrome by Concatenating Two Letter Words You are given an array of strings words. Each element of words consists of two lowercase English letters. | Medium | Likely | arrayhash-tablestring | Solve |
Step-By-Step Directions From a Binary Tree Node to Another You are given the root of a binary tree with n nodes. Each node is uniquely assigned a value from 1 to n. You are also given an integer startValue representing... | Medium | Likely | stringtreedepth-first-search | Solve |
Minimum Absolute Difference Between Elements With Constraint You are given a 0-indexed integer array nums and an integer x. | Medium | Likely | arraybinary-searchordered-set | Solve |
Smallest Range Covering Elements from K Lists You have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one number from each of the k lists. | Hard | Likely | arrayhash-tablegreedy | Solve |
Split Message Based on Limit You are given a string, message, and a positive integer, limit. | Hard | Likely | stringenumeration | Solve |
Number of Flowers in Full Bloom You are given a 0-indexed 2D integer array flowers, where flowers[i] = [starti, endi] means the ith flower will be in full bloom from starti to endi (inclusive)... | Hard | Likely | arrayhash-tablebinary-search | Solve |
Text Justification Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justifie... | Hard | Likely | arraystringsimulation | Solve |
Count Integers in Intervals Given an empty set of intervals, implement a data structure that can: | Hard | Likely | designsegment-treeordered-set | Solve |
Number of Recent Calls You have a RecentCounter class which counts the number of recent requests within a certain time frame. | Easy | Likely | designqueuedata-stream | Solve |
Longest Mountain in Array You may recall that an array arr is a mountain array if and only if: | Medium | Sometimes | arraytwo-pointersdynamic-programming | Solve |
Data Stream as Disjoint Intervals Given a data stream input of non-negative integers a1, a2, ..., an, summarize the numbers seen so far as a list of disjoint intervals. | Hard | Sometimes | hash-tablebinary-searchunion-find | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Sometimes | arraysorting | Solve |
Find Peak Element A peak element is an element that is strictly greater than its neighbors. | Medium | Sometimes | arraybinary-search | Solve |
First Missing Positive Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums. | Hard | Sometimes | arrayhash-table | Solve |
String to Integer (atoi) Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer. | Medium | Sometimes | string | Solve |
Maximum Profit in Job Scheduling We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. | Hard | Sometimes | arraybinary-searchdynamic-programming | Solve |
Course Schedule II There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b... | Medium | Sometimes | depth-first-searchbreadth-first-searchgraph | Solve |
Shortest Path in a Grid with Obstacles Elimination You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell... | Hard | Sometimes | arraybreadth-first-searchmatrix | Solve |
Find All Anagrams in a String Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order. | Medium | Sometimes | hash-tablestringsliding-window | Solve |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Given an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference between any two elemen... | Medium | Sometimes | arrayqueuesliding-window | Solve |
Find the Length of the Longest Common Prefix You are given two arrays with positive integers arr1 and arr2. | Medium | Sometimes | arrayhash-tablestring | Solve |
Finding Pairs With a Certain Sum You are given two integer arrays nums1 and nums2. You are tasked to implement a data structure that supports queries of two types: | Medium | Sometimes | arrayhash-tabledesign | Solve |
Spiral Matrix Given an m x n matrix, return all elements of the matrix in spiral order. | Medium | Sometimes | arraymatrixsimulation | Solve |
House Robber
SolveYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob...
House Robber II
SolveYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in...
Time Based Key-Value Store
SolveDesign a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain...
Snapshot Array
SolveImplement a SnapshotArray that supports the following interface:
Longest Palindrome by Concatenating Two Letter Words
SolveYou are given an array of strings words. Each element of words consists of two lowercase English letters.
Step-By-Step Directions From a Binary Tree Node to Another
SolveYou are given the root of a binary tree with n nodes. Each node is uniquely assigned a value from 1 to n. You are also given an integer startValue representing...
Minimum Absolute Difference Between Elements With Constraint
SolveYou are given a 0-indexed integer array nums and an integer x.
Smallest Range Covering Elements from K Lists
SolveYou have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one number from each of the k lists.
Split Message Based on Limit
SolveYou are given a string, message, and a positive integer, limit.
Number of Flowers in Full Bloom
SolveYou are given a 0-indexed 2D integer array flowers, where flowers[i] = [starti, endi] means the ith flower will be in full bloom from starti to endi (inclusive)...
Text Justification
SolveGiven an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justifie...
Count Integers in Intervals
SolveGiven an empty set of intervals, implement a data structure that can:
Number of Recent Calls
SolveYou have a RecentCounter class which counts the number of recent requests within a certain time frame.
Longest Mountain in Array
SolveYou may recall that an array arr is a mountain array if and only if:
Data Stream as Disjoint Intervals
SolveGiven a data stream input of non-negative integers a1, a2, ..., an, summarize the numbers seen so far as a list of disjoint intervals.
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Find Peak Element
SolveA peak element is an element that is strictly greater than its neighbors.
First Missing Positive
SolveGiven an unsorted integer array nums. Return the smallest positive integer that is not present in nums.
String to Integer (atoi)
SolveImplement the myAtoi(string s) function, which converts a string to a 32-bit signed integer.
Maximum Profit in Job Scheduling
SolveWe have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].
Course Schedule II
SolveThere are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b...
Shortest Path in a Grid with Obstacles Elimination
SolveYou are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell...
Find All Anagrams in a String
SolveGiven two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order.
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
SolveGiven an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference between any two elemen...
Find the Length of the Longest Common Prefix
SolveYou are given two arrays with positive integers arr1 and arr2.
Finding Pairs With a Certain Sum
SolveYou are given two integer arrays nums1 and nums2. You are tasked to implement a data structure that supports queries of two types:
Spiral Matrix
SolveGiven an m x n matrix, return all elements of the matrix in spiral order.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Databricks interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Databricks interviews focus heavily on array, hash-table, string problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Databricks interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Databricks has been reported to ask 27 distinct coding problems. The most common topics are array, hash-table, string. 1 are Easy difficulty, 17 are Medium, and 9 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 27 reported problems, Databricks interviews are significantly harder than average - 33% Hard vs 18% across all companies. 63% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, hash-table, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Databricks coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Databricks interview with AIarrow_forward
