Rules for Solving a Coding Question in an Interview

If we are dealing with top/maximum/minimum/closest 'K' elements among 'N' elements, we will be using a Heap. If the given input is a sorted array or a list, we will either be using Binary Search or the Two Pointers strategy. If we need to try all c...