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

Find XOR Sum of All Pairs Bitwise AND

advancedlayer I11 · Bit manipulation5 tests

Given two arrays arr1 and arr2 of non-negative integers, consider every pair (i, j) and the value arr1[i] & arr2[j]. Return the XOR of all arr1.length * arr2.length of those values.

  • Both arrays can hold up to 100000 values, so materialising every pair is far too slow — the answer must come out in O(n + m)
  • Neither array is empty

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