Bit Manipulation Pattern

Use bits as compact sets or arithmetic shortcuts.

#	Title	Difficulty	Topics
136	Single Number	Easy	bit manipulation
137	Single Number II	Medium	bit manipulation
190	Reverse Bits	Easy	bit manipulation
191	Number of 1 Bits	Easy	bit manipulation
201	Bitwise AND of Numbers Range	Medium	bit manipulation
231	Power of Two	Easy	bit manipulation
260	Single Number III	Medium	bit manipulation
268	Missing Number	Medium	bit manipulation
318	Maximum Product of Word Lengths	Medium	bit manipulation
342	Power of Four	Easy	bit manipulation
371	Sum of Two Integers	Easy	bit manipulation
389	Find the Difference	Easy	bit manipulation
393	UTF-8 Validation	Medium	bit manipulation
401	Binary Watch	Easy	bit manipulation
411	Minimum Unique Word Abbreviation	Hard	bit manipulation
461	Hamming Distance	Easy	bit manipulation
476	Number Complement	Easy	bit manipulation
477	Total Hamming Distance	Medium	bit manipulation
645	Set Mismatch	Easy	bit manipulation
693	Binary Number with Alternating Bits	Easy	bit manipulation
762	Prime Number of Set Bits in Binary Representation	Easy	bit manipulation
868	Binary Gap	Easy	bit manipulation
898	Bitwise ORs of Subarrays	Medium	bit manipulation
1178	Number of Valid Words for Each Puzzle	Hard	string
1239	Maximum Length of a Concatenated String with Unique Characters	Medium	dynamic programming
1310	XOR Queries of a Subarray	Medium	bit manipulation
1318	Minimum Flips to Make a OR b Equal to c	Medium	bit manipulation
1342	Number of Steps to Reduce a Number to Zero	Easy	bit manipulation
1356	Sort Integers by The Number of 1 Bits	Easy	sort
1461	Check If a String Contains All Binary Codes of Size K	Medium	string
1506	Find Root of N-Ary Tree	Medium	tree
1720	Decode XORed Array	Easy	bit manipulation
1734	Decode XORed Permutation	Medium	bit manipulation
1829	Maximum XOR for Each Query	Medium	bit manipulation
1999	Smallest Greater Multiple Made of Two Digits	Medium	backtracking
2135	Count Words Obtained After Adding a Letter	Medium	string
2151	Maximum Good People Based on Statements	Hard	bit manipulation
2152	Minimum Number of Lines to Cover Points	Medium	math
2157	Groups of Strings	Hard	string
2174	Remove All Ones With Row and Column Flips II	Medium	dynamic programming
2212	Maximum Points in an Archery Competition	Medium	bit manipulation
2220	Minimum Bit Flips to Convert Number	Easy	bit manipulation
2247	Maximum Cost of Trip With K Highways	Hard	dynamic programming
2275	Largest Combination With Bitwise AND Greater Than Zero	Medium	bit manipulation
2317	Maximum XOR After Operations	Medium	bit manipulation
2354	Number of Excellent Pairs	Hard	hash table
2397	Maximum Rows Covered by Columns	Medium	bit manipulation
2403	Minimum Time to Kill All Monsters	Hard	dynamic programming
2411	Smallest Subarrays With Maximum Bitwise OR	Medium	bit manipulation
2413	Smallest Even Multiple	Easy	math
2419	Longest Subarray With Maximum Bitwise AND	Medium	bit manipulation
2425	Bitwise XOR of All Pairings	Medium	bit manipulation
2429	Minimize XOR	Medium	bit manipulation
2505	Bitwise OR of All Subsequence Sums	Medium	bit manipulation
2527	Find Xor-Beauty of Array	Medium	bit manipulation
2572	Count the Number of Square-Free Subsets	Medium	dynamic programming
2595	Number of Even and Odd Bits	Easy	bit manipulation
2729	Check if The Number is Fascinating	Easy	string
2732	Find a Good Subset of the Matrix	Hard	constructive algorithms
2802	Find The K-th Lucky Number	Medium	math
2835	Minimum Operations to Form Subsequence With Target Sum	Hard	greedy
2859	Sum of Values at Indices With K Set Bits	Easy	bit manipulation
2897	Apply Operations on Array to Maximize Sum of Squares	Hard	greedy
2917	Find the K-or of an Array	Easy	bit manipulation
2930	Number of Strings Which Can Be Rearranged to Contain Substring	Medium	math
2932	Maximum Strong Pair XOR I	Easy	bit manipulation
2935	Maximum Strong Pair XOR II	Hard	bit manipulation
2959	Number of Possible Sets of Closing Branches	Medium	graph
2965	Find Missing and Repeated Values	Easy	array
2980	Check if Bitwise OR Has Trailing Zeros	Easy	bit manipulation
2992	Number of Self-Divisible Permutations	Medium	dynamic programming
2997	Minimum Number of Operations to Make Array XOR Equal to K	Medium	bit manipulation
3007	Maximum Number That Sum of the Prices Is Less Than or Equal to K	Medium	math
3022	Minimize OR of Remaining Elements Using Operations	Hard	greedy
3032	Count Numbers With Unique Digits II	Easy	math
3064	Guess the Number Using Bitwise Questions I	Medium	bit manipulation
3094	Guess the Number Using Bitwise Questions II	Medium	bit manipulation
3125	Maximum Number That Makes Result of Bitwise AND Zero	Medium	bit manipulation
3133	Minimum Array End	Medium	bit manipulation
3141	Maximum Hamming Distances	Hard	dynamic programming
3145	Find Products of Elements of Big Array	Hard	binary search
3199	Count Triplets with Even XOR Set Bits I	Easy	bit manipulation
3215	Count Triplets with Even XOR Set Bits II	Medium	bit manipulation
3226	Number of Bit Changes to Make Two Integers Equal	Easy	bit manipulation
3276	Select Cells in Grid With Maximum Score	Hard	graph
3283	Maximum Number of Moves to Kill All Pawns	Hard	dynamic programming
3287	Find the Maximum Sequence Value of Array	Hard	dynamic programming
3289	The Two Sneaky Numbers of Digitville	Easy	bit manipulation
3304	Find the K-th Character in String Game I	Easy	bit manipulation
3307	Find the K-th Character in String Game II	Hard	bit manipulation
3314	Construct the Minimum Bitwise Array I	Easy	bit manipulation
3315	Construct the Minimum Bitwise Array II	Medium	bit manipulation
3344	Maximum Sized Array	Medium	bit manipulation
3370	Smallest Number With All Set Bits	Easy	bit manipulation
3376	Minimum Time to Break Locks I	Medium	graph
3435	Frequencies of Shortest Supersequences	Hard	graph
3437	Permutations III	Medium	backtracking
3444	Minimum Increments for Target Multiples in an Array	Hard	dynamic programming
3513	Number of Unique XOR Triplets I	Medium	math
3530	Maximum Profit from Valid Topological Order in DAG	Hard	dynamic programming
3533	Concatenated Divisibility	Hard	dynamic programming
3566	Partition Array into Two Equal Product Subsets	Medium	bit manipulation
3568	Minimum Moves to Clean the Classroom	Medium	breadth first search
3575	Maximum Good Subtree Score	Hard	dynamic programming
3595	Once Twice	Medium	dynamic programming
3615	Longest Palindromic Path in Graph	Hard	dynamic programming
3630	Partition Array for Maximum XOR and AND	Hard	greedy
3632	Subarrays with XOR at Least K	Hard	bit manipulation
3644	Maximum K to Sort a Permutation	Medium	sort
3646	Next Special Palindrome Number	Hard	bit manipulation
3670	Maximum Product of Two Integers With No Common Bits	Medium	dynamic programming
3677	Count Binary Palindromic Numbers	Hard	math
3681	Maximum XOR of Subsequences	Hard	greedy
3685	Subsequence Sum After Capping Elements	Medium	dynamic programming
3702	Longest Subsequence With Non-Zero Bitwise XOR	Medium	bit manipulation
3750	Minimum Number of Flips to Reverse Binary String	Easy	bit manipulation
3766	Minimum Operations to Make Binary Palindrome	Medium	bit manipulation
3769	Sort Integers by Binary Reflection	Easy	bit manipulation
3782	Last Remaining Integer After Alternating Deletion Operations	Hard	bit manipulation
3806	Maximum Bitwise AND After Increment Operations	Hard	greedy
3812	Minimum Edge Toggles on a Tree	Hard	greedy
3825	Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND	Medium	binary search
3827	Count Monobit Integers	Easy	bit manipulation
3845	Maximum Subarray XOR with Bounded Range	Hard	two pointers
3858	Minimum Bitwise OR From Grid	Medium	greedy
3877	Minimum Removals to Achieve Target XOR	Medium	dynamic programming
3950	Exactly One Consecutive Set Bits Pair	Easy	bit manipulation
3954	Sum of Compatible Numbers in Range I	Easy	math
3955	Valid Binary Strings With Cost Limit	Medium	backtracking
3989	Maximum Consistent Columns in a Grid	Hard	dynamic programming