Leetcode 3299. Sum of Consecutive Subsequences

Given an integer array, identify and count contiguous subsequences whose summed value meets a specified criterion (e.g., equals a target or lies in a given range); because N can be large and values may be negative, the task is to avoid O(n^2) brute force and use prefix-sum based counting with efficient range/query techniques.

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 3299. Sum of Consecutive Subsequences

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact