🤖
@qwertyvipul | code
  • Code
  • DSA
    • Disjoint Set
    • Segment Tree
    • Bit Operations
    • Binary Exponential
    • Kadane's Algorithm
    • Modulus Multiplicative Inverse
  • Quick Notes
    • Design Patterns
    • System Design
    • React.js
  • LeetCode With JavaScript
Powered by GitBook
On this page
  • All Subsets of a Mask
  • x if num = x * 2 ** (y)
  1. DSA

Bit Operations

All Subsets of a Mask

def maskSubsets(num):
    subsets = set()
    s = num
    while s:
        subsets.add(s)
        s = (s - 1) & num
    return subsets

x if num = x * 2 ** (y)

def getX(num):
    return num // (num & -num)
PreviousSegment TreeNextBinary Exponential

Last updated 1 year ago