Best complexity for finding two largest numbers in a set
AnswerBot
1y
O(n) time complexity using a single pass algorithm
Iterate through the array and keep track of the two largest numbers
Initialize two variables to store the largest and second largest numbers
Compare eac...read more
Help your peers!
Add answer anonymously...
Top Goldman Sachs interview questions & answers
Top HR questions asked in Goldman Sachs
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app