Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Bit manipulation

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›Bit manipulation

XOR Queries of a Subarray

intermediatelayer I11 · Bit manipulation5 tests

Given an array arr and a list of queries, where each query is a pair [left, right], return an array whose i-th entry is the XOR of arr[left] ^ arr[left + 1] ^ ... ^ arr[right] for that query.

  • Both bounds are inclusive, and left <= right
  • There can be tens of thousands of queries, so re-scanning the range each time is too slow — answer each query in O(1) after linear preprocessing
  • queries may be empty, in which case return an empty array

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