Max of All Subarrays of Size k Using Max Heap in C++
This problem, also referred to as the “sliding window maximum” problem, can be efficiently solved using heaps. We’ve already discussed an O(n) solution.
Tag: Heap
How to find k nearest neighbours of a given point from a set of points in a plane?
Let’s given n points in a plane. We’ve to find k nearest neighbours of a given point ‘p’ from the given n points.