1. partition the array in blocks of size w=4. The last block may have less then w. 2. Traverse the list from start to end and calculate max_so_far. Reset max after each block boundary (of w elements).

Given a string `s` that consists of only uppercase English letters, you can perform at most `k` operations on that string. In one operation, you can choose any character of the string and change it to ...