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.