Hudson River Trading
Interview Question
Algorithm Developer Interview
Hudson River Trading
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 instant access to the complete solution, explanation, and similar practice problems.
