Loading...
Engaged Employer
Find the kth smallest number in an unsorted array with minimum complexity.
Anonymous
we can use max heap of size k. for more info http://www.careercup.com/question?id=14118753
Use partitioning so that sorting is not required.
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.