Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Arrays & strings

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Arrays & strings

Continuous Subarray Sum

advancedlayer B2 · Arrays & strings5 tests

Given an array nums of non-negative integers and a positive integer k, return true if there is a contiguous subarray whose sum is a multiple of k.

  • The subarray must have length at least 2 — this is the whole trap
  • 0 counts as a multiple of every k, so [0,0] with k = 7 is true
  • But [1,0] with k = 2 is false: the only multiple of 2 in there is the single element 0, and length 1 does not qualify
  • Target O(n) using prefix-sum remainders

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen