Microsoft

## Question 1: Optimal Log Truncation Concepts:** Sliding Window, Hash Map Problem Statement:** You are managing a server log sequence represented as a string `logs` consisting of characters `'E'` (Error), `'W'` (Warning), and `'I'` (Info). To meet storage compliance, you must delete exactly one contiguous substring of logs such that the remaining log sequence contains at most `max_E` errors and at most `max_W` warnings. Return the minimum length of the substring you need to delete. If the initial string already satisfies the conditions, return `0`. Test Case:** *Input:** `logs = "EWEIWE"`, `max_E = 1`, `max_W = 1` *Output:** `3` - ## Question 2: Even Frequency Data Batches Concepts:** Prefix State Masking, Hash Map Problem Statement:** You are given an array of integers `data_types` where each integer represents a distinct data type (ranging from `1` to `10`). A data batch (a contiguous subarray) is considered "balanced" if every data type present within that batch appears an even number of times. Find and return the length of the longest balanced contiguous subarray. Test Case:** *Input:** `data_types = [1, 2, 1, 2, 3, 3, 1]` *Output:** `6`