OJ
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
  • Bit Manipulation
    • XOR
      • 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
    • Hash
    • AND
    • Total Hamming Distance
    • 190. Reverse Bits
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
Powered by GitBook
On this page

Was this helpful?

  1. Bit Manipulation

XOR

Single Number137. Single Number II260. Single Number IIISet MismatchMissing Number1310. XOR Queries of a Subarray1442. Count Triplets That Can Form Two Arrays of Equal XORFind the DifferenceHamming DistanceMaximum XOR of Two Numbers in an Array
PreviousBit ManipulationNextSingle Number

Last updated 6 years ago

Was this helpful?