X Interview Question
Nothing unexpected
Interview Answer
Anonymous
Jan 3, 2014
Option 1: Using a Priority Queue (heap). Complexity O(n logk) Option 2: Using Selection algorithm (first finding kth largest element and then sorting the elements
Nothing unexpected
Anonymous
Option 1: Using a Priority Queue (heap). Complexity O(n logk) Option 2: Using Selection algorithm (first finding kth largest element and then sorting the elements
Check out your Company Bowl for anonymous work chats.