Ripple·Software Engineer·Technical Phone Screen
May 2026
Interviewed for a software engineer role at Ripple and got a tree path problem that looked manageable until the follow-ups started piling on. Not a bad experience overall but the LCA angle definitely required more prep than I'd put in.
- Given a binary tree and two node values that both exist in the tree, return the sequence of node values along the path connecting those two nodes.
- How would your approach change if node values in the tree are not guaranteed to be unique?
- If the binary tree is actually a BST, how does your time complexity change and what shortcuts can you use to find the LCA more efficiently?
“I knew LCA was involved but fumbled explaining the path construction cleanly.”