Find a Path Between Nodes in a Fibonacci Tree
Company: Databricks
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: hard
Interview Round: Take-home Project
Quick Answer: Practice a Databricks coding interview problem focused on find a path between nodes in a fibonacci tree. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.
Examples
Input: {"n":2,"a":1,"b":2}
Expected Output: "L"
Explanation: Root to left child.
Input: {"n":2,"a":2,"b":3}
Expected Output: "UR"
Explanation: Left child to right child.
Input: {"n":3,"a":2,"b":4}
Expected Output: "URL"
Explanation: Across root subtree.
Input: {"n":3,"a":4,"b":5}
Expected Output: "UR"
Explanation: Parent to right child.
Input: {"n":4,"a":1,"b":7}
Expected Output: "RR"
Explanation: Root to nested right-right.
Input: {"n":4,"a":7,"b":1}
Expected Output: "UU"
Explanation: Nested node to root.
Input: {"n":5,"a":3,"b":3}
Expected Output: ""
Explanation: Same node.
Input: {"n":5,"a":4,"b":10}
Expected Output: "UURLR"
Explanation: Different branches.