Mono Sequence

Goal: Given an integer array and window side of K, find the max values for every window in the array. Return the max values array. Intuition: For window of size k ending with [i], the max of this window must ≥ [i] and must be within the window borders. …

Goal: find the size of shortest subarray in given array that sum up to at least K, where negative integer is allowed. Reasoning for techniques used: 1. Prefix sum: Because negative number is allowed. This causes a problem that you don’t know when to stop expanding or shrinking the window. It’s…