Databricks Software Engineer Coding & Algorithms Interview Questions
Practice 42 real Coding & Algorithms interview questions for Software Engineer roles at Databricks.
"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"
"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"
"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."
"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."
"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."
"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."
"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."
"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."
"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."
"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."
"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."
"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."
"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."
"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Design IP/CIDR rule matcher
Design and implement a rule matcher that returns 'accept' or 'deny' for a given IPv4 address based on a set of rules. Each rule can be either an inclu...
Design an efficient Tic-Tac-Toe engine
Design a Tic-Tac-Toe engine on an n x n board. Implement move(row, col, player) -> result where result indicates no winner, player1 wins, player2 wins...
Compute last-5-minute QPS in memory
Problem You are building a lightweight in-memory component that tracks the query load (QPS) of a service. Design a data structure with two operations:...
Implement firewall matching with CIDR rules
Implement a simple IPv4 firewall rule matcher. Problem You are given an ordered list of firewall rules. Each rule has: - an action: ALLOW or DENY - a ...
Check if CIDR is fully canceled by rules
You are given: - A target CIDR block T as a string, e.g. "10.0.0.0/16". - A list of rule CIDR blocks. Each rule has: - A type: either "allow" or "de...
Find first CIDR block covering IP
You are given: - A single IPv4 address as a string, e.g. "192.168.1.5". - A list of CIDR blocks (IPv4), each as a string in the form "a.b.c.d/x", wher...
Find shortest path in a Fibonacci-ordered tree
You are given a recursively-defined binary tree T(order) whose shape depends only on order (not on node values). Nodes are labeled 0..N-1 using preord...
Implement lazy array and KV store
You are asked two coding problems in the same interview round: 1. Implement a lazy array abstraction - Create a LazyArray<T> that wraps an input li...
Design Tic-Tac-Toe and QPS data structures
You are given two independent coding problems that focus on data structure and API design. --- Problem 1: Generalized Tic-Tac-Toe Game with Simple AI ...
Implement a rate-limited hit counter
You are designing a hit counter that records the number of hits received in the past 5 minutes. Implement a class HitCounter with the following method...
Find optimal commute mode in a city graph
You are designing a route planner that suggests the best way to commute between two points in a city using different transportation modes. The city is...
Implement a Tic-Tac-Toe game API
Problem Design and implement a Tic-Tac-Toe game class that supports playing moves on an n x n board. Requirements - Two players, represented by intege...
Implement a sliding-window hit counter
Implement a hit counter that supports recordHit(timestamp) and getHits(pastSeconds). Use a fixed-size array to maintain a sliding time window (e.g., l...
Design BFS to detect forced win in Tic-Tac-Toe
You are given an n×n Tic-Tac-Toe–like board and a target k (1 ≤ k ≤ n). From the current board state and the player to move, design an algorithm to de...
Find Path Between Fibonacci Tree Nodes
You are given a special family of binary trees called Fibonacci trees. Define the tree T(k) recursively: - T(1) is a single node. - T(2) is a single n...
Compute 5-minute rolling average load
You are building a monitoring component for a key–value (KV) store. Each request contributes 1 unit of load at its request time. Design a data structu...
Evaluate ACL rules for IP and CIDR
Problem You are implementing an IPv4 access-control list (ACL). The ACL contains ordered rules; each rule has: - action: either ALLOW or DENY - cidr: ...
Find path between nodes in Fibonacci tree
You are given a recursively defined Fibonacci tree F(k): - F(0) is a single node. - F(1) is a single node. - For k >= 2, F(k) consists of: - a root ...
Implement RLE and bit-packing compression
You are asked to implement two related compression/decompression schemes: Run-Length Encoding (RLE) and bit-packing. --- Part 1 — Run-Length Encoding ...
Find all anagram start indices
Problem Given two strings s and p, return all starting indices of substrings in s that are anagrams (permutations) of p. Input - s: string - p: string...