Fibonacci Tree / Path Finding

CodingDatabricksLast reported July 2026High Frequency

Reported: 17× across candidate reports
First seen: February 2025
Last reported: July 2026
Reported outcome: mixed

Problem Overview

You are given a special family of binary trees called Fibonacci trees. The k-th order Fibonacci tree T(k) is defined recursively: T(1) and T(2) are each a single node. For k ≥ 3, T(k) is a tree whose root has left subtree T(k-1) (or T(k-2) in some variants) and right…

5 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
The rest of the problem statement — full requirements, constraints, and edge cases
Approach and trade-offs — what passing candidates did, and the mistakes that sink people

Unlock the full Databricks catalog

Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Databricks question.

Unlock with Pro

Already a member? Sign in

Verified Source

Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.

Codex Fact-Checked

Technical claims, formulas, and scale numbers are reviewed against primary sources.

Interviewer Follow-ups

The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.