Available question text
Check whether any contiguous subarray of length ≥ 2 has a sum that's a multiple of k. This reduces to using prefix-sum modulo k and detecting repeated remainders (with index distance ≥ 2) to prove a subarray sum divisible by k.
Related questions
Continue with questions that share topics or the same question type.
- Divide an array into subarray with equal sum.
Coding
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
- Kth Smallest Subarray Sum
Coding
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
Coding · Array · Heap (Priority Queue) · Monotonic Queue
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Leetcode 523. Continuous Subarray Sum
Reported Oct 1, 2025 · 12 source reports
MANAGER, MID_LEVEL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View source