OJ
search
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Searchchevron-right
  • Binary Tree & Divide Conquerchevron-right
  • Dynamic Programming Ichevron-right
  • Dynamic Programming IIchevron-right
  • Linked Listchevron-right
  • Array & Numberschevron-right
  • Heapchevron-right
  • Hashchevron-right
  • Multiple Pointerschevron-right
  • Stackchevron-right
  • Breadth-first Searchchevron-right
  • Bit Manipulationchevron-right
    • XORchevron-right
      • Single Number
      • 137. Single Number II
      • 260. Single Number III
      • Set Mismatch
      • Missing Number
      • 1310. XOR Queries of a Subarray
      • 1442. Count Triplets That Can Form Two Arrays of Equal XOR
      • Find the Difference
      • Hamming Distance
      • Maximum XOR of Two Numbers in an Array
    • Hashchevron-right
    • ANDchevron-right
    • Total Hamming Distance
    • 190. Reverse Bits
  • Mathchevron-right
  • Triechevron-right
  • Graphchevron-right
  • Union Findchevron-right
  • Exhaustive Searchchevron-right
  • Stringchevron-right
  • Greedychevron-right
  • Designchevron-right
  • Queuechevron-right
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Bit Manipulation

XOR

Single Numberchevron-right137. Single Number IIchevron-right260. Single Number IIIchevron-rightSet Mismatchchevron-rightMissing Numberchevron-right1310. XOR Queries of a Subarraychevron-right1442. Count Triplets That Can Form Two Arrays of Equal XORchevron-rightFind the Differencechevron-rightHamming Distancechevron-rightMaximum XOR of Two Numbers in an Arraychevron-right
PreviousBit Manipulationchevron-leftNextSingle Numberchevron-right

Last updated 6 years ago