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

Count Triplets That Can Form Two Arrays of Equal XOR

advancedlayer I11 · Bit manipulation5 tests

Given an array arr, count the triplets of indices (i, j, k) with 0 <= i < j <= k < arr.length such that

  • a = XOR of arr[i] .. arr[j - 1]
  • b = XOR of arr[j] .. arr[k]
  • and a === b

Return how many such triplets exist. The triple loop is O(n^3) — do better than that.

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