Find Path Between Nodes in a Fibonacci Tree
Given integers n, start, and end, find a path from the start node to the end node in a Fibonacci tree of order n, where the root value is always 0. Return the path as a sequence of directions (Up/Left/Right) in UURL format. A Fibonacci tree of order k has a root whose left subtree is a Fibonacci tree of order k-1 and right subtree is a Fibonacci tree of order k-2. Reference: https://stackoverflow.com/questions/76142856/finding-a-path-between-two-nodes-in-a-k-th-order-fibonacci-tree
Asked at:
Databricks
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late October, 2025
Databricks
Senior
Given 3 ints n, start and end. Find a path from start to end in a fibonacci tree of size n. The definition of a tree was odd. for sizes: * n=0 size0 * n=1 size1 * n=2 size 2 * n=5 size 12 root val is always 0 Path should be in the UURL format similar to https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/
Early September, 2025
Databricks
Mid-level
Hello Interview Premium
Your account is free and you can post anonymously if you choose.