Hudson River TradingSoftware EngineerAlgorithm DeveloperQuestion #18
Given an array of length n, design an efficient algorithm to find the second largest number. The number of comparisons should be n + O(log n).
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