Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3284. Sum of Consecutive Subarrays
Given an array of integers and a target value, find or count contiguous (consecutive) subarrays whose sum equals the target. The core challenge is to do this efficiently — use prefix sums with a hashmap to handle negative values (or a sliding-window for nonnegative arrays).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.