Databricks Software Engineer Onsite Coding Questions

Phone: Classic snapshot sets VO: 1st Design WAL writer, single machine, highest throughput, log is durablely written before the call returns to the caller. 2nd. Map get and put and calculate QPS. 3rd.

Many posts describe Databricks' somewhat absurd processes, including references, background checks, interviewers, and the difficulty of interview questions. Here's another data point to share: TL'DR d

Storefront SD: Bookseller platform (Original question from the forum). Here are some additional details: 1) This is an asynchronous request. The focus is not on how to return the request quickly, but

This post was last edited by Anonymous on 2025-10-7 14:17. Requesting points! The following content requires points higher than 180. You can already view it. Phone: IP to CIDR VO: coding The first rou

Coding 1: Tic-Tac-Toe The follow-up requires you to add a boolean param: isAi. When isAi is reached, automatically move to the next sub. The function should allow for wins, losses, and draws. Coding 2

LeetCode #751: IP to CIDR. Difficulty: Medium. Topics: String, Bit Manipulation. Asked at Databricks in the last 6 months.

LeetCode #362: Design Hit Counter. Difficulty: Medium. Topics: Array, Binary Search, Design, Queue, Data Stream. Asked at Databricks in the last 6 months.

LeetCode #438: Find All Anagrams in a String. Difficulty: Medium. Topics: Hash Table, String, Sliding Window. Asked at Databricks in the last 6 months.

LeetCode #348: Design Tic-Tac-Toe. Difficulty: Medium. Topics: Array, Hash Table, Design, Matrix, Simulation. Asked at Databricks in the last 6 months.

LeetCode #2096: Step-By-Step Directions From a Binary Tree Node to Another. Difficulty: Medium. Topics: String, Tree, Depth-First Search, Binary Tree. Asked at Databricks in the last 6 months.

LeetCode #981: Time Based Key-Value Store. Difficulty: Medium. Topics: Hash Table, String, Binary Search, Design. Asked at Databricks in the last 6 months.

LeetCode #900: RLE Iterator. Difficulty: Medium. Topics: Array, Design, Counting, Iterator. Asked at Databricks in the last 6 months.

LeetCode #1293: Shortest Path in a Grid with Obstacles Elimination. Difficulty: Hard. Topics: Array, Breadth-First Search, Matrix. Asked at Databricks in the last 6 months.

LeetCode #567: Permutation in String. Difficulty: Medium. Topics: Hash Table, Two Pointers, String, Sliding Window. Asked at Databricks in the last 6 months.

LeetCode #994: Rotting Oranges. Difficulty: Medium. Topics: Array, Breadth-First Search, Matrix. Asked at Databricks in the last 6 months.

LeetCode #1928: Minimum Cost to Reach Destination in Time. Difficulty: Hard. Topics: Array, Dynamic Programming, Graph Theory. Asked at Databricks in the last 6 months.

## Problem Design a distributed web crawler that fetches and indexes pages at scale, handling politeness, deduplication, and storage. ## Tags system_design, graph