1p3a Question · Oct 2025 · Los Angeles

Find Path Between Nodes in K-th Order Fibonacci Tree

SWE Easy
Sign in to bookmark

Question Details

Problem Summary You are given a k-th order Fibonacci tree. The tree is described by a list of node values in a pre-order traversal. You need to find the path between two specific nodes. The mai

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 reported interview question from a databricks interview for a swe role reported in 2025.

It covers the following topics: Recursion, Dijkstra, Graph, Tree, Dfs, Bfs, Binary Tree, Graph, Recursion, Binary Tree .

Difficulty rating: Easy

Topics

Recursion Dijkstra Graph Tree Dfs Bfs Binary Tree Graph Recursion Binary Tree

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 →