Hudson River TradingSoftware EngineerAlgorithm EngineerQuestion #25
Find the longest sequence of unique numbers in a binary tree starting at the root node. That is, find the longest path from the root where no number appears more than once.
Unlock the Full Solution
Enter your email to get the detailed step-by-step solution to this Hudson River Trading interview question, plus access to free interview prep resources.
We'll also send you a free HFT mock interview video.
More Hudson River Trading Software Engineer Questions
How would you design a system to route network packets between a central hub and multiple node servers?Given that a survey asks each student to report the size of their room and there is no other information available, how would you estimate the average room size?Compare a sorted map and a hashmap, including their time complexities. Explain how a hashmap works and discuss strategies to resolve hash collisions.Given two dates, calculate the number of days between them.How does a dictionary work under the hood in Python?
Get All 58+ Hudson River Trading Questions with Solutions
Plus 16+ hours of video lectures, resume tailoring, and 1:1 mentorship from quants.
Schedule a Call