Companies
Amazon892 questions
Meta497 questions
Google396 questions
Uber311 questions
ByteDance / TikTok337 questions
Snowflake177 questions
Microsoft229 questions
Apple150 questions
Stripe195 questions
OpenAI179 questions
Databricks100 questions
Netflix88 questions
DoorDash120 questions
Roblox77 questions
IBM117 questions
Anthropic94 questions
Bloomberg107 questions
Coinbase87 questions
Capital One98 questions
LinkedIn96 questions
Goldman Sachs94 questions
Snapchat90 questions
Citadel / Citadel Securities85 questions
Salesforce85 questions
Rippling72 questions
JPMorgan Chase77 questions
Airbnb77 questions
Pinterest75 questions
Oracle70 questions
Reddit45 questions

Databricks Interview Question Bank
Databricks interviews are unusually bank-driven: candidates who know the recurring prompt families often recognize the round within the first few minutes. The loop mixes algorithmic coding with low-level systems and product-grounded design, then puts real weight on behavioral, hiring-committee, and reference signals after the technical rounds.
100
questions
Last updated
Before you start
Showing 32 of 32
OJ Problems
practice in the online judgeShortest Path in a Fibonacci TreeOptimal CommuteIP CIDR Range QueryFile Encryption Tree OptimizationSnapshot Set IteratorString Index Partition Mapping (Minimum Partitions after Deletion)Grid BFS: choose best travel mode by shortest time then lowest costUniformly sample edges to connect n connected components into one connected graphGrid pathfinding with time & cost optimality (BFS / shortest path variant)Implement Gradient Descent for Linear Regression (MSE) and debug convergenceRemove an interval by index and simplify (merge) cover intervalsImplement Linear Regression with Gradient Descent from ScratchDesign and Implement a Lazy Array with Testable LazinessKV Cache with Hit CountFastest Transportation Mode in a Grid (Time-first, Cost-tiebreak)Design an In-Memory KV Store with a Hit CounterImplement a Lazy Array (Deferred Evaluation)Reconstruct a Binary Tree from Inorder Traversal (Follow-up)Construct a Fibonacci Tree and Analyze Time ComplexityTop-5 Most Similar Rows Using MSE Across Multiple FeaturesPath Between Two Preorder-Indexed Nodes in a Fibonacci Tree (Without Building the Tree)Lazy Array (Lazy Evaluation) with Unit TestsIn-memory KV Cache with Hit Count and Unit TestsSnapshot Set with Stable IteratorsOrdered CIDR Firewall Rules Match (First Hit Wins)Check Whether a Binary Tree Is a Fibonacci Tree in O(h) TimeIn-Memory File System APIsLazy Array (Delayed Evaluation Array)Best Commute to Databricks HQ (Grid + Mode Constraints + Time/Cost Tie-break)Bottom-K Customers by Revenue (with Nested Revenue Follow-up)
