Question

Find maximum out of starting m elements and ending m elements priority queue

Answer 1

Maximum distinct elements after removing k elements. Given an array arr[] containing n elements. The problem is to find maximum number of distinct elements (non-repeating) after removing k elements Priority Queue Client Example. Problem: Find the largest M of a stream of N elements. Ex 1: Fraud detection - isolate $$ transactions. Ex 2: File maintenance – find biggest files or directories. Possible constraint