LeetCode
Experience
#2096 Step-By-Step Directions From a Binary Tree Node to Another
Interview Experience
LeetCode #2096: Step-By-Step Directions From a Binary Tree Node to Another. Difficulty: Medium. Topics: String, Tree, Depth-First Search, Binary Tree. Asked at Databricks in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a candidate experience report from a databricks interview for a swe role during the coding round.
It covers the following topics: Binary Tree, Depth-First Search, Tree, Binary Tree, Graph, Strings .
Difficulty rating: Medium
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