NeetCode #124LC-523MediumArrays & Hashing
← Back to All Problems#124 · #523 · Continuous Subarray Sum(连续的子数组和)
📌 Problem Statement & Constraints
Given an integer array
nums and an integer k, return true if nums has a good subarray: a contiguous subarray of length at least 2 whose sum is a multiple of k. Constraints: 1 <= nums.length <= 10^5, 0 <= nums[i] <= 10^9, 1 <= k <= 2^31 - 1.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!