Python Algorithms Traing Basic
latest
  • chapter 1: Array
  • chapter 2: Backtracking
  • chapter 3: Binary Search
  • chapter 4: Bit manipulation
    • Bit manipulation - Easy
    • Bit manipulation - Easy 2
    • Bit manipulation - Medium
    • Bit manipulation - Hard
  • chapter 5: Breadth First Search
  • chapter 6: Combination
  • chapter 7: Depth First Search
  • chapter 8: DFA
  • chapter 9: DivideConquer
  • chapter 10: Dynamic Programming
  • chapter 11: Graph
  • chapter 12: Greedy
  • chapter 13: Hash table
  • chapter 14: Heap
  • chapter 15: Linked List
  • chapter 16: Math
  • chapter 17: Others
  • chapter 18: Recursion
  • chapter 19: Stack
  • chapter 20: String
  • chapter 21: ToBeOptimized
  • chapter 22: Tree
  • chapter 23: Two Pointers
Python Algorithms Traing Basic
  • Docs »
  • chapter 4: Bit manipulation
  • Edit on GitHub

chapter 4: Bit manipulation¶

  • Bit manipulation - Easy
    • 136. Single Number
    • 169. Majority Element
    • 190. Reverse Bits
    • 191. Number of 1 Bits
    • 231. Power of Two
    • 268. Missing Number
    • 342. Power of Four
    • 371. Sum of Two Integers
    • 389. Find the Difference
    • 461. Hamming Distance
    • 476. Number Complement
  • Bit manipulation - Easy 2
    • 29. divide two integers
    • 78. subsets
    • 136. single number
    • 137. single number 2
    • 201. bitwise and of numbers range
    • 260. single number 3
    • 318. maximum product from all buildings
    • 338. Counting bits
  • Bit manipulation - Medium
  • Bit manipulation - Hard
Next Previous

© Copyright 2019, sean Revision 21c49f22.

Built with Sphinx using a theme provided by Read the Docs.