The hiring process at Databricks takes an average of 60 days when considering 2 user submitted interviews across all job titles. Candidates applying for Big Data Architect had the quickest hiring process (on average 60 days), whereas Big Data Architect roles had the slowest hiring process (on average 60 days).
did the code signal online assessment first and contacted by a recruiter to schedule the first phone interview. The interviewer was nice and supportive throughout the process.
The recruiter reached out to schedule another round of phone interview.
Interview questions [1]
Question 1
standard leetcode question about merging lists with given api.
I applied through a recruiter. The process took 4 days. I interviewed at Databricks in Jul 2020
Interview
Databricks *reached out to me* on LinkedIn, unsolicited.
2 attempts at arranging an initial phone screen later (internal recruiter slow to respond to my reply initially, then he didn't bother responding to my final message with new proposed times to speak with them), I gave up.
Great that all their VC funding is financing their internal recruiters to burn their time wasting mine.
I applied online. The process took 3 weeks. I interviewed at Databricks in Sep 2020
Interview
There are four rounds to the interview process: Codesignal, Karat, internal technical, internal behavioural.
The Codesignal round consists of an online assessment with 4 questions ranging from easy to medium difficulty.
The Karat round is a video interview with an interviewing engineer from Karat. Afterwards, based off of this feedback, Databricks decides if you should proceed to the next round.
Next is an internal technical interview. This interview was hard. Expect a leetcode hard problem.
Finally, there's an internal behavioural interview with an engineering manager. Pretty typical behavioural - you talk about past projects, experience, why you want to join Databricks.
The interview process is really transparent, and the recruiters are responsive
Interview questions [1]
Question 1
Determine the oldest common ancestor between two nodes in a tree