1p3a Experience · Oct 2025 · India

Databricks Tech Phone Screen Interview Experience with Fibonacci Tree Problem

SWE Phone Screen
Sign in to bookmark
7 replies

Interview Experience

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

Full Details

🔒

Unlock all Databricks questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a candidate experience report from a databricks interview for a swe role during the phone screen round reported in 2025.

It covers the following topics: Recursion, Tree, Recursion .

Topics

Recursion Tree Recursion

More Databricks Interview Questions

1p3a databricks full-process onsite software engineer interview experience 1p3a tech phone screen experience at databricks: snapshot iterator challenge 1p3a Databricks SDE II Interview Experience: Fibonacci Trees CIDR and LLD 1p3a Find Optimal Commute 1p3a Databricks Onsite SDE Interview: Encoding and SnapshotSet Coding Challenges
← All Databricks questions Databricks Software Engineer Questions → All Binary Tree Questions →