Given an array and constants x, y, z, find a contiguous subarray [i, j] that maximizes the sum: sum(arr[k] * multiplier) where multipliers are x, y, z applied in a sliding window or specific pattern.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.