📕 FREE Guide2025 Quant Firm Tier List

Hudson River Trading Interview Question

Hudson River TradingAlgorithm Developer Interview

In a length n array of numbers, find an algorithm that finds the second largest number efficiently. There is an n + O(log n) answer.

Unlock the Full Solution

Enter your email to get instant access to the complete solution, explanation, and similar practice problems.

Want to ace more quant interviews?

Get access to our comprehensive interview preparation course with hundreds of real interview questions, detailed solutions, and personalized mentorship from quants at top firms.

Start Your Prep Today