📕 FREE Guide2026 Quant Firm Tier List
You are given an array, and a number x. Determines whether or not there exist two elements in in the input array whose sum is exactly x, efficiently.
Enter your email to get instant access to the complete solution, explanation, and similar practice problems.
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 TodayDisclaimer: We are not affiliated with Tower in any way. This question is sourced from interviewees and public sources and may not be accurate or reflective of the company's actual interview process.