LeetCode 1066: Campus Bikes II
A clear explanation of finding the minimum total Manhattan distance to assign bikes to workers using bitmask dynamic programming.
Tag
Bit-Manipulation
45 notes
LeetCode 1018: Binary Prefix Divisible By 5
A clear explanation of checking divisibility of binary prefixes by 5 using running remainder tracking.
LeetCode 1009: Complement of Base 10 Integer
A clear explanation of finding the complement of a number by XORing with a bitmask of the same bit length.
LeetCode 342: Power of Four
A clear explanation of Power of Four using bit manipulation and binary properties.
LeetCode 260: Single Number III
A clear explanation of the Single Number III problem using XOR partitioning to isolate the two unique numbers.
LeetCode 231: Power of Two
A clear explanation of determining whether an integer is a power of two using binary properties and bit manipulation.
LeetCode 137: Single Number II
Find the number that appears once when every other number appears three times using bit counting or finite-state bit manipulation.
LeetCode 832: Flipping an Image
A clear explanation of the Flipping an Image problem using row reversal, bit inversion, and an in-place two-pointer method.
LeetCode 898: Bitwise ORs of Subarrays
A clear explanation of counting distinct bitwise OR results from all non-empty subarrays using rolling sets.
LeetCode 995: Minimum Number of K Consecutive Bit Flips
A clear explanation of making all bits equal to 1 using greedy left-to-right flips and a sliding window flip parity.
LeetCode 982: Triples with Bitwise AND Equal To Zero
A clear explanation of counting ordered triples whose bitwise AND is zero using pairwise AND counts.
LeetCode 868: Binary Gap
A clear explanation of finding the maximum distance between adjacent set bits in a binary representation.
LeetCode 861: Score After Flipping Matrix
A clear explanation of maximizing a binary matrix score using greedy row and column flips.
LeetCode 810: Chalkboard XOR Game
A math and bit manipulation solution for deciding whether Alice wins the XOR removal game.
LeetCode 782: Transform to Chessboard
A clear explanation of transforming a binary board into a chessboard using feasibility checks and minimum row and column swaps.
LeetCode 779: K-th Symbol in Grammar
A clear explanation of finding the kth symbol in the grammar sequence using recursion and the parent-child relationship.
LeetCode 762: Prime Number of Set Bits in Binary Representation
A clear explanation of counting numbers whose binary representation has a prime number of set bits.
LeetCode 751: IP to CIDR
A clear explanation of converting a range of IPv4 addresses into the shortest list of CIDR blocks using greedy bit manipulation.
LeetCode 717: 1-bit and 2-bit Characters
A clear explanation of determining whether the last character must be a one-bit character using greedy parsing.
LeetCode 693: Binary Number with Alternating Bits
Check whether every adjacent bit in a positive integer's binary representation is different.
LeetCode 672: Bulb Switcher II
A clear explanation of counting possible bulb states after pressing four toggle buttons exactly presses times.
LeetCode 600: Non-negative Integers without Consecutive Ones
A clear digit dynamic programming solution for counting numbers whose binary representation does not contain consecutive ones.
LeetCode 477: Total Hamming Distance
A clear explanation of computing the total Hamming distance across all pairs by counting different bits column by column.
LeetCode 476: Number Complement
A clear explanation of finding the bitwise complement of a positive integer using a binary mask.
LeetCode 461: Hamming Distance
A clear explanation of computing the Hamming distance between two integers using XOR and bit counting.
LeetCode 421: Maximum XOR of Two Numbers in an Array
A clear explanation of finding the maximum XOR of two numbers using greedy bit prefixes.
LeetCode 411: Minimum Unique Word Abbreviation
A clear explanation of finding the shortest abbreviation that does not conflict with any dictionary word using bit masks.
LeetCode 405: Convert a Number to Hexadecimal
A clear explanation of converting integers to hexadecimal using bit manipulation and two's complement representation.
LeetCode 401: Binary Watch
A clear explanation of the Binary Watch problem using bit counting over all valid times.
LeetCode 397: Integer Replacement
A clear explanation of reducing an integer to 1 with the fewest operations using greedy bit decisions.
LeetCode 393: UTF-8 Validation
A clear explanation of validating a byte sequence as UTF-8 using bit masks and a continuation-byte counter.
LeetCode 389: Find the Difference
A clear explanation of finding the extra character added to a shuffled string using counting and XOR.
LeetCode 371: Sum of Two Integers
A clear explanation of adding two integers without using plus or minus by using XOR, AND, carry, and a 32-bit mask.
LeetCode 338: Counting Bits
A clear explanation of Counting Bits using dynamic programming and bit manipulation.
LeetCode 320: Generalized Abbreviation
A clear explanation of Generalized Abbreviation using backtracking to choose whether each character is kept or abbreviated.
LeetCode 318: Maximum Product of Word Lengths
A clear explanation of Maximum Product of Word Lengths using bit masks to test disjoint character sets efficiently.
LeetCode 268: Missing Number
A clear explanation of the Missing Number problem using sum formula and XOR.
LeetCode 201: Bitwise AND of Numbers Range
A clear explanation of finding the bitwise AND of every number in an inclusive range using the common binary prefix.
LeetCode 90: Subsets II
A detailed guide to solving Subsets II with sorting, backtracking, and duplicate skipping.
LeetCode 89: Gray Code
A detailed guide to solving Gray Code using the binary-to-Gray-code formula.
LeetCode 78: Subsets
A detailed guide to solving Subsets with backtracking and the include-or-skip recursion idea.
LeetCode 191: Number of 1 Bits
A clear explanation of counting set bits in an integer using bit manipulation and Brian Kernighan's algorithm.
LeetCode 190: Reverse Bits
A clear explanation of reversing the bits of a 32-bit integer using bit manipulation.
LeetCode 136: Single Number
Find the only number that appears once using the XOR operator, while every other number appears exactly twice.
LeetCode 29: Divide Two Integers
A clear explanation of integer division without using multiplication, division, or modulo, using repeated doubling with bit shifts.