Amazon Interview Question: Find top k largest numbers in array in O(n) time | Glassdoor

Skip to content Skip to footer

Notifications

Loading...

employer cover photo

Amazon

Amazon Software Development Engineer interview

Amazon Interview Question

Software Development Engineer Interview

Find top k largest numbers in array in O(n) time

Interview Answers

Anonymous

Mar 21, 2014

max heap is nlog n :P sry

1

Anonymous

Jan 23, 2014

Radix Sort but that is one hard question!

Anonymous

Mar 21, 2014

max heap

Related searches: Amazon reviews | Amazon jobs | Amazon salaries | Amazon benefits | Amazon conversations

Amazon interviews