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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

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

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact