📂
Interview Prep
Ctrlk
  • Introduction
  • Trees
  • Recursion & Backtracking
  • Maths
  • Binary Searching & Sorting
  • Strings
  • BIT Manipulation
    • Single Number
    • Single Number II
    • Single Number III
    • Maximum XOR of Two Numbers in an Array
    • Divide Two Integers
    • Min XOR value
    • Number of 1 Bits
    • Reverse Bits
    • Different Bits Sum Pairwise
    • Count Triplets That Can Form Two Arrays of Equal XOR
    • Minimum Flips to Make a OR b Equal to c
    • XOR Queries of a Subarray
    • Sum of Two Integers
    • Bitwise ORs of Subarrays
    • Find a Value of a Mysterious Function Closest to Target
    • Find Kth Bit in Nth Binary String
  • Two Pointers
  • Arrays
  • Linked List
  • Stacks & Queues
  • HashMap & HashSet & Sliding Window
  • Priority Queue
  • Dynamic Programming
  • Greedy
  • Graphs, BFS & DFS
  • Geometry
  • Merge Sort
  • Segment Trees
  • Most consistent ways of dealing with the series of stock problems
Powered by GitBook
On this page

BIT Manipulation

Single NumberSingle Number IISingle Number IIIMaximum XOR of Two Numbers in an ArrayDivide Two IntegersMin XOR valueNumber of 1 BitsReverse BitsDifferent Bits Sum PairwiseCount Triplets That Can Form Two Arrays of Equal XORMinimum Flips to Make a OR b Equal to cXOR Queries of a SubarraySum of Two IntegersBitwise ORs of SubarraysFind a Value of a Mysterious Function Closest to TargetFind Kth Bit in Nth Binary String
PreviousSplit Two Strings to Make PalindromeNextSingle Number

Last updated 5 years ago