Loading...
Engaged Employer
Find the smallest 3 integers in an array in O(n) time.
Anonymous
Iterate through each element, maintain a list of the 3 smallest integers.
yeah..that would be a way. or quickselect algorithm. these are the only two ways.
Check out your Company Bowl for anonymous work chats.
Get actionable career advice tailored to you by joining more bowls.
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalized job recommendations and updates by starting your searches.