Company: Amazon_16oct
Difficulty: medium
Minimum Adjustments for Optimal Binary Stream Problem Description Amazon cloud architects are executing a performance evaluation on a data stream, and the stream's condition is represented by a binary string. The data stream is considered optimal if the string does not contain '010' or '101' as subsequences. Note that, in general, subsequences are not the same as substrings. A subsequence is a sequence derived from the original string by deleting zero or more elements without changing the order of the remaining elements. For example, subsequences of '101101' include '0', '1', '11', '0111', and '101', but not '000', '101010', or '11100'. Your goal is to calculate the minimum number of adjustments required to make the binary string optimal. An adjustment at a specific position in the sequence is defined as flipping the character at that position. For instance, flipping a '0' changes it to '1', and vice versa. Complete the function `determineMinimumAdjustments` which takes the following a