Yelp interview question
Find the k-lowest elements of an unsorted array.
Interview Answers
Anonymous
11 Aug 2016
Do not use min Heap! It will take O(nlogk) time which is not what they want. They want O(n). SO use QuickSelect!
Find the k-lowest elements of an unsorted array.
Anonymous
Do not use min Heap! It will take O(nlogk) time which is not what they want. They want O(n). SO use QuickSelect!
Check out your Company Bowl for anonymous work chats.