Maximize Resource Allocation

Problem Overview

• Given an array of n resources and an integer k, find a contiguous subarray of length k with all unique elements that yields the maximum sum.
• Input: array of integers and k; Output: the maximum sum, or -1 if no such subarray exists.
• Models a resource allocation problem where you must select a fixed-size, conflict-free window to maximize total value.
• Asked in IBM interviews; a common coding interview problem and interview question.