Maximum of Fixed-Window Minimums

Given an integer array `A` and a window length `x`, consider every contiguous subarray of length `x`. Find the minimum value in each window, then return the maximum of those minimum values. ### Function Implement `maxOfWindowMinimums(A, x)`. Use the exact integer representation described below for this console interface. - `A` is a nonempty array of integer values, and `n` is its length. - `x` is an integer satisfying `1 <= x <= n`. - Return one value for this specified window length, not an answer for every possible length. - Negative values and repeated values are allowed. Windows retain their original contiguous positions in `A`. ### Exact integer representation This console represents integer values as canonical decimal strings so they retain their exact values in every supported language. This is an input/output representation convention; it does not impose a maximum integer magnitude. - `A` is an array of strings representing signed integers. - `x` is a string representing a positive integer. Its numeric value satisfies the bounds above. - Return the selected integer value as a canonical decimal string. - A canonical decimal string is `"0"`, a sequence of ASCII digits beginning with `1` through `9`, or `"-"` followed by such a sequence. It has no leading plus sign, leading zeroes, whitespace, or negative zero. - Compare represented integer values, not the lexicographic order of their strings. Do not round values or restrict them to a fixed-width integer type. ### Example ```text A = ["1", "3", "-1", "5", "3", "6"] x = "3" Output: "3" ``` The table below shows the represented integer values: | Window | Minimum | | --- | --- | | `[1, 3, -1]` | `-1` | | `[3, -1, 5]` | `-1` | | `[-1, 5, 3]` | `-1` | | `[5, 3, 6]` | `3` | The maximum of the four minima is `3`, so return `"3"`. For a numeric window length of 1, every element is its own window. For a numeric window length of `n`, there is exactly one window containing the entire array. The result follows the same rule in both cases. Aim for an algorithm that uses a linear number of integer comparisons in `n`. Account separately for the cost of processing decimal digits.