Databricks logo

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.

More
70
Before you start
Showing 33 of 33
Coding·55 min
HighFree preview

IP / CIDR Firewall

Given an ordered list of IP or CIDR allow / deny rules, return the first matching rule for an input IP. Follow-ups switch the input from a single IP to a CIDR block and ask whether the entire range is allowed after applying ordered rules.

SWE
Infra Eng
bit-manipulation
interval
parsing
medium
9 related discussions

OJ Problems

practice in the online judge
70 total
Customer 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)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)

Databricks Featured Guides