Top Answers

1. Why is the deque solution to the "Sliding Window Maximum" problem O(n) instead of O(nk)?
   9 votes
2. Find K nearest Points to Point P in 2-dimensional plane
   8 votes
3. The minimum number of "insertions" to sort an array
   6 votes
4. Why can't we always just pick the biggest term with big-O notation?
   4 votes
5. .NET List<T>.Sort uses introsort, why is the worst case O(n^2)?
   3 votes