Companies
Amazon1009 questions
Meta533 questions
Google475 questions
Uber337 questions
ByteDance / TikTok409 questions
Microsoft264 questions
Snowflake197 questions
Apple182 questions
OpenAI210 questions
Stripe205 questions
Databricks119 questions
DoorDash139 questions
Pinterest104 questions
Netflix97 questions
Roblox89 questions
Anthropic107 questions
IBM125 questions
Citadel / Citadel Securities122 questions
Bloomberg118 questions
LinkedIn115 questions
Salesforce115 questions
Coinbase93 questions
Capital One107 questions
Goldman Sachs105 questions
Oracle104 questions
Airbnb104 questions
Rippling84 questions
Snapchat97 questions
Waymo93 questions
JPMorgan Chase84 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.
119
questions
Last updated
Before you start
Showing 35 of 35
OJ Problems
practice in the online judgeOptimal Commute GridCircuit Breaker Based Database Replica RoutingCustomer Revenue SystemFind 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 Count
