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 →Topics
Binary Tree
Depth-First Search
Tree
Binary Tree
Graph
Strings
More from Databricks
1p3a
Databricks SDE II Interview Experience: Fibonacci Trees CIDR and LLD
Reddit
New Grad Interview Experience at Databricks?
1p3a
Databricks Onsite Interview Experience for SDE Position
1p3a
Databricks Onsite SDE Interview: Encoding and SnapshotSet Coding Challenges
1p3a
Revenue Tracking System with Referrals