← Back to Dashboard

Databricks Interview Questions

Curated from verified interview reports: data-infrastructure-flavored Coding rounds (caching, log writers, bit-packing, snapshot iterators), System Design rounds on lakehouse and streaming themes, and a Behavioral cross-functional hiring-manager round.

19 real interview questions reported from Databricks Software Engineer interviews (Coding, System Design, Behavioral rounds): 7 medium, 12 hard. Each question shows its interview round and how often it was reported, and coding questions come with runnable tests.

Databricks Coding round questions (13)

  • Build Target Bottleneck Detection - Medium, reported 1×, free preview
    Find the critical path that bottlenecks a build and compute the minimum completion time with unlimited parallel workers.
  • Cached File Block Reader - Hard, reported 1×, free preview
    Serve repeated byte-range reads from a block cache and make concurrent misses share one in-flight fetch per block.
  • Circuit Breaker Gateway - Hard
    Simulate a gateway that prefers a primary backend, falls back to a secondary, and opens or resets per-server circuit breakers.
  • Concurrent Log Writer - Hard, reported 16×
    Buffer concurrent log calls safely, flush full batches in order, and guarantee close drains the tail exactly once.
  • Customer Revenue Referral System - Medium, reported 13×
    Track customer revenue, one-level referral credit, and thresholded lowest-revenue queries over stable customer ids.
  • Find Path in Fibonacci Tree - Hard, reported 17×
    Walk an implicit Fibonacci tree whose nodes carry preorder numbers and report the simple path linking two of its nodes.
  • File System Encryption Optimization - Hard, reported 2×
    Count encrypted versus unencrypted files, then choose between per-file and per-directory encryption to minimize total work.
  • Generalized Tic-Tac-Toe - Medium, reported 19×
    Implement an m×n connect-k Tic-Tac-Toe board and detect wins after each move.
  • IP CIDR Firewall - Hard
    Apply ordered ALLOW and DENY CIDR rules and return the first matching decision for each query IP.
  • KV Store with Rolling QPS Metrics - Medium, reported 35×
    Build a tiny in-memory KV store that also reports rolling get and put QPS over a trailing window.
  • Optimal Commute Assignment - Medium, reported 30×
    Pick the best transport mode on a city grid by comparing per-mode shortest travel time and breaking ties by total cost.
  • Run-Length Encoding and Bit-Packing - Hard, reported 17×
    Encode an integer stream by turning long repeats into RLE blocks and everything else into bit-packed literal blocks.
  • Snapshot Set Iterator - Hard, reported 20×
    Capture immutable snapshots of a mutable set and iterate each snapshot in preserved insertion order.

Databricks System Design round questions (5)

Databricks Behavioral round questions (1)