Microsoft

## Question 1: Consistent Component Frequency Concepts:** Sliding Window, Hash Map Problem Statement:** You are given an array of integers `components` representing the types of hardware modules in a server rack, and two integers `m` and `k`. Your goal is to find the length of the longest contiguous subarray that satisfies both of the following conditions: The subarray contains exactly `m` distinct types of components. Every distinct component type present in the subarray appears at least `k` times. Return the length of this longest valid subarray. If no such subarray exists, return `0`. Test Case:** *Input:** `components = [1, 2, 1, 2, 3, 1, 2]`, `m = 2`, `k = 2` *Output:** `4` *(The subarray `[1, 2, 1, 2]` has exactly 2 distinct elements {1, 2}, and both appear at least 2 times. Length is 4)* - ## Question 2: Balanced System Partition Concepts:** Prefix State, Suffix State, Hash Map Problem Statement:** You are given an array of integers `modules` representing a sequence of executed microservices. You need to split this array into two contiguous, non-empty parts: a "left" sequence and a "right" sequence. A split is considered "perfectly balanced" if the number of **distinct** microservices in the left sequence is exactly equal to the number of **distinct** microservices in the right sequence. Return the total number of perfectly balanced splits you can make. Test Case:** *Input:** `modules = [1, 2, 1, 3, 2]` *Output:** `1` *(The only perfectly balanced split is `[1, 2, 1]` | `[3, 2]`, as the left part has 2 distinct elements {1, 2} and the right part has 2 distinct elements {2, 3})* - ## Question 3: Bandwidth Capacity Floor Concepts:** Binary Search on Answer, Sliding Window, Greedy Problem Statement:** You are given an array of integers `bandwidth` representing the current maximum data transfer rates of consecutive network links. You are also given an integer `w` (representing a window size) and an integer `budget`. In a single operation, you can choose any contiguous subarray of length exactly `w` and increase the bandwidth of every link in that subarray by `1`. This operation costs `1` from your budget. Your objective is to maximize the minimum bandwidth across the entire array. Return the maximum possible value of the minimum element in the array after using at most `budget` operations. Test Case:** *Input:** `bandwidth = [1, 2, 4, 1, 3]`, `w = 2`, `budget = 2` *Output:** `2` *(Applying the operation to indices [0, 1] makes the array [2, 3, 4, 1, 3]. Applying it to indices [3, 4] makes the array [2, 3, 4, 2, 4]. The minimum element is now 2)*