Leetcode 3392. Count Subarrays of Length Three With a Condition

Count how many contiguous subarrays of length three satisfy that the sum of the first and third elements equals exactly half of the middle element (i.e., each length‑3 window must meet that arithmetic relation).

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 3392. Count Subarrays of Length Three With a Condition

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact