Companies
Amazon973 questions
Meta522 questions
Google462 questions
Uber334 questions
ByteDance / TikTok385 questions
Microsoft254 questions
Apple178 questions
OpenAI204 questions
Snowflake190 questions
Stripe200 questions
Databricks116 questions
DoorDash137 questions
Netflix94 questions
Roblox89 questions
Anthropic104 questions
Bloomberg118 questions
IBM118 questions
Citadel / Citadel Securities115 questions
Coinbase92 questions
LinkedIn108 questions
Capital One106 questions
Salesforce106 questions
Goldman Sachs102 questions
Oracle97 questions
Airbnb97 questions
Snapchat94 questions
Rippling81 questions
Pinterest93 questions
Waymo92 questions
JPMorgan Chase80 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.
116
questions
Last updated
Before you start
Showing 35 of 35
OJ Problems
practice in the online judgeFind the First Anagram OccurrenceIP Firewall Rule MatchingDesign an API QPS CounterGeneralized Tic-Tac-ToeKV Store with Sliding-Window Average LatencyFind the First Anagram SubstringDesign Tic-Tac-ToeDesign a Snapshot Set IteratorDesign Generalized Tic-Tac-ToeSnapshot Set IteratorGroup AnagramsCustomer Revenue System with Referrals and Top K QueryShortest Path in a Preorder-Labeled Fibonacci TreeShortest 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)
