Binary Tree Longest Consecutive Sequence II
Find the maximum length of an increasing or decreasing path where adjacent nodes differ by one, including child-parent-child traversal. Asked at Uber.
Check more interview questions and experiences about Uber