Databricks Software Engineer Interview Questions

Databricks SDE II Interview Experience: Fibonacci Trees CIDR and LLD

Hi, I had applied for the SDE-2 role at Databricks using their career portal via LinkedIn and recruiter reached out to after couple of days and scheduled my interviews one by one. # Round - 1: Technic

databricks software engineer tech phone screen: sf commute algorithm problem

以下内容需要积分高于 188 您已经可以浏览 地里提到过的sf commute, 给一个二维matrix，标明Start和Destination, 有四种通勤方式，用1，2，3，4代表可以走的路径。给出1，2，3，4每走一步分别需要的时间和cost，问哪种最省时间，在一样时间的情况下取cost最小的。 用bfs四种方式分别跑一次即可。 面的时候感觉聊得挺好的，也写出来了，测试也跑通了，结果面完一周到现在没消息。唉。求米继续看面经。

databricks staff backend tech phone screen interview experience and timeline

发一个挂经，求攒人品和大米呀。 四月网投的Staff Backend岗位，后一周收到HR面，然后约电面 五月初面试的，电面，系统设计。 题目是地里面的老题：分布式 📁 系统。 求大米看其他面经！！！

tech phone screen experience at databricks: snapshot iterator challenge

本帖最后由 匿名 于 2026-5-21 20:41 编辑 是snapshot iterator那题 但是： 他没有要求iterator保持原有的data order 地里有的面经都是要求保持原有的order的 一看见这题我就按照保持order写了 面试官也没引导 最后问我时间复杂度的时候才说他没有要求这里有order 果然挂了 当然主要是我的问题 一上来看见原题就先入为主了

databricks full-process onsite software engineer interview experience

screen（design）：book store onsite coding：好像是新题，string pattern相关的。给两个string用一个string的index表示另一个。比如a="abcdbcd", b="sabcd", return [[1,3],[4,4],[2,4]]，followup是删掉一个character重新返回新的result，要求最少的partition。 system coding: KV Cache with WAL Log SD: design slack culture: 常规问题，why databrick, feedback, hardest problem, how you breakdown large tasks etc 面完当周说要之前em和tl的reference check，提交之后第二周说decide to pass

databricks fulltime software engineer technical phone screen experience

Hiring Manager直接在Linkedin上reach out; HM call then HR call then phone screening SD: Design a Book Seller Platform Hello Interview上有详细的描述 - https://www.hellointerview.com/community/questions/book-seller-platform/cm8j5hkhi009ouxg8w34ni7nd?company=Databricks 数据砖在疯狂招人！可能是为了IPO做准备，推荐大家可以去试试 补充内容 (2026-05-25 11:42 +08:00): 求大米啊求大米！！！

Databricks Software Engineer Tech Phone Screen Interview Experience

The first round interview was a very short self-introduction, but the experience was good. The interviewer provided various clarifications, which were very clear. The question was to implement an OOD

Find Optimal Commute

Problem Statement You have a simplified map of San Francisco. It is a 2D grid. Each square on the grid is one of these: - `'S'`: Your Home (Start). - `'D'`: Your Office (Destination). - A digit `'1

Databricks Onsite Interview Experience for SDE Position

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.

What to Expect in databricks Onsite ML Coding Interview

I received the data and was moved to an onsite interview, which included two rounds: ML coding and ML tech fit. Has anyone interviewed with me before and knows what these two rounds typically involve?

Databricks Fulltime SDE Tech Phone Screen: Intermediate Coding and Array Interval Questions

Round 1: Coding Design Implement a simplified JSON parser capable of parsing custom-formatted log files or handling strings containing escape characters. The problem itself wasn't difficult. During th

Databricks Technical Phone Screen: Optimal Commute Problem in SDE Interview

You are comm

Databricks Tech Phone Screen: Anagram Index Coding Challenge

The entire phone interview lasted 60 minutes. There was a 15-minute chat before and after the coding challenge, leaving 45 minutes for coding. One problem was very concise, described in a single line:

Databricks Tech Phone Screen Interview Experience with Fibonacci Tree Problem

Freshly baked interview experience! The question was about finding a path using a Fibnaci tree, a very classic question, testing how to calculate the time complexity of recursion. After constructing t

Databricks Full Interview Experience for SDE Role

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