Leetcode 3255. Find the Power of K-Size Subarrays II

For each size-k sliding window, check whether the k elements form an ascending sequence of consecutive integers (i.e., each adjacent difference is 1); return the window's maximum if so, otherwise -1 (n up to 1e5).