Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3255. Find the Power of K-Size Subarrays II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source