PhantomCodeAI
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
PhantomCodeAI
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
Home
LeetCode Problems
Bit Manipulation
Bit Manipulation
Problems
220 Bit Manipulation LeetCode problems · Solve with AI-powered hints & step-by-step explanations.
29
Divide Two Integers
Medium
67
Add Binary
Easy
78
Subsets
Medium
89
Gray Code
Medium
90
Subsets II
Medium
136
Single Number
Easy
137
Single Number II
Medium
187
Repeated DNA Sequences
Medium
190
Reverse Bits
Easy
191
Number of 1 Bits
Easy
201
Bitwise AND of Numbers Range
Medium
222
Count Complete Tree Nodes
Easy
231
Power of Two
Easy
260
Single Number III
Medium
268
Missing Number
Easy
287
Find the Duplicate Number
Medium
318
Maximum Product of Word Lengths
Medium
338
Counting Bits
Easy
342
Power of Four
Easy
371
Sum of Two Integers
Medium
389
Find the Difference
Easy
393
UTF-8 Validation
Medium
397
Integer Replacement
Medium
401
Binary Watch
Easy
405
Convert a Number to Hexadecimal
Easy
421
Maximum XOR of Two Numbers in an Array
Medium
461
Hamming Distance
Easy
464
Can I Win
Medium
473
Matchsticks to Square
Medium
476
Number Complement
Easy
477
Total Hamming Distance
Medium
491
Non-decreasing Subsequences
Medium
526
Beautiful Arrangement
Medium
638
Shopping Offers
Medium
645
Set Mismatch
Easy
672
Bulb Switcher II
Medium
691
Stickers to Spell Word
Hard
693
Binary Number with Alternating Bits
Easy
698
Partition to K Equal Sum Subsets
Medium
756
Pyramid Transition Matrix
Medium
762
Prime Number of Set Bits in Binary Representation
Easy
779
K-th Symbol in Grammar
Medium
782
Transform to Chessboard
Hard
784
Letter Case Permutation
Medium
805
Split Array With Same Average
Hard
810
Chalkboard XOR Game
Hard
832
Flipping an Image
Easy
847
Shortest Path Visiting All Nodes
Hard
861
Score After Flipping Matrix
Medium
864
Shortest Path to Get All Keys
Hard
868
Binary Gap
Easy
898
Bitwise ORs of Subarrays
Medium
943
Find the Shortest Superstring
Hard
957
Prison Cells After N Days
Medium
980
Unique Paths III
Hard
982
Triples with Bitwise AND Equal To Zero
Hard
995
Minimum Number of K Consecutive Bit Flips
Hard
996
Number of Squareful Arrays
Hard
1009
Complement of Base 10 Integer
Easy
1016
Binary String With Substrings Representing 1 To N
Medium
1018
Binary Prefix Divisible By 5
Easy
1125
Smallest Sufficient Team
Hard
1177
Can Make Palindrome from Substring
Medium
1178
Number of Valid Words for Each Puzzle
Hard
1238
Circular Permutation in Binary Representation
Medium
1239
Maximum Length of a Concatenated String with Unique Characters
Medium
1255
Maximum Score Words Formed by Letters
Hard
1284
Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
Hard
1310
XOR Queries of a Subarray
Medium
1318
Minimum Flips to Make a OR b Equal to c
Medium
1342
Number of Steps to Reduce a Number to Zero
Easy
1349
Maximum Students Taking Exam
Hard
1356
Sort Integers by The Number of 1 Bits
Easy
1371
Find the Longest Substring Containing Vowels in Even Counts
Medium
1386
Cinema Seat Allocation
Medium
1404
Number of Steps to Reduce a Number in Binary Representation to One
Medium
1434
Number of Ways to Wear Different Hats to Each Other
Hard
1442
Count Triplets That Can Form Two Arrays of Equal XOR
Medium
1457
Pseudo-Palindromic Paths in a Binary Tree
Medium
1461
Check If a String Contains All Binary Codes of Size K
Medium
1486
XOR Operation in an Array
Easy
1494
Parallel Courses II
Hard
1521
Find a Value of a Mysterious Function Closest to Target
Hard
1525
Number of Good Ways to Split a String
Medium
1542
Find Longest Awesome Substring
Hard
1558
Minimum Numbers of Function Calls to Make Target Array
Medium
1595
Minimum Cost to Connect Two Groups of Points
Hard
1601
Maximum Number of Achievable Transfer Requests
Hard
1611
Minimum One Bit Operations to Make Integers Zero
Hard
1617
Count Subtrees With Max Distance Between Cities
Hard
1655
Distribute Repeating Integers
Hard
1659
Maximize Grid Happiness
Hard
1680
Concatenation of Consecutive Binary Numbers
Medium
1681
Minimum Incompatibility
Hard
1684
Count the Number of Consistent Strings
Easy
1707
Maximum XOR With an Element From Array
Hard
1720
Decode XORed Array
Easy
1723
Find Minimum Time to Finish All Jobs
Hard
1734
Decode XORed Permutation
Medium
1738
Find Kth Largest XOR Coordinate Value
Medium
1755
Closest Subsequence Sum
Hard
1763
Longest Nice Substring
Easy
1787
Make the XOR of All Segments Equal to Zero
Hard
1799
Maximize Score After N Operations
Hard
1803
Count Pairs With XOR in a Range
Hard
1815
Maximum Number of Groups Getting Fresh Donuts
Hard
1829
Maximum XOR for Each Query
Medium
1835
Find XOR Sum of All Pairs Bitwise AND
Hard
1863
Sum of All Subset XOR Totals
Easy
1879
Minimum XOR Sum of Two Arrays
Hard
1915
Number of Wonderful Substrings
Medium
1930
Unique Length-3 Palindromic Subsequences
Medium
1938
Maximum Genetic Difference Query
Hard
1947
Maximum Compatibility Score Sum
Medium
1986
Minimum Number of Work Sessions to Finish the Tasks
Medium
1994
The Number of Good Subsets
Hard
2002
Maximum Product of the Length of Two Palindromic Subsequences
Medium
2032
Two Out of Three
Easy
2035
Partition Array Into Two Arrays to Minimize Sum Difference
Hard
2044
Count Number of Maximum Bitwise-OR Subsets
Medium
2135
Count Words Obtained After Adding a Letter
Medium
2151
Maximum Good People Based on Statements
Hard
2157
Groups of Strings
Hard
2172
Maximum AND Sum of Array
Hard
2206
Divide Array Into Equal Pairs
Easy
2212
Maximum Points in an Archery Competition
Medium
2220
Minimum Bit Flips to Convert Number
Easy
2275
Largest Combination With Bitwise AND Greater Than Zero
Medium
2305
Fair Distribution of Cookies
Medium
2306
Naming a Company
Hard
2317
Maximum XOR After Operations
Medium
2322
Minimum Score After Removals on a Tree
Hard
2351
First Letter to Appear Twice
Easy
2354
Number of Excellent Pairs
Hard
2397
Maximum Rows Covered by Columns
Medium
2401
Longest Nice Subarray
Medium
2411
Smallest Subarrays With Maximum Bitwise OR
Medium
2419
Longest Subarray With Maximum Bitwise AND
Medium
2425
Bitwise XOR of All Pairings
Medium
2429
Minimize XOR
Medium
2433
Find The Original Array of Prefix Xor
Medium
2438
Range Product Queries of Powers
Medium
2506
Count Pairs Of Similar Strings
Easy
2527
Find Xor-Beauty of Array
Medium
2546
Apply Bitwise Operations to Make Strings Equal
Medium
2564
Substring XOR Queries
Medium
2568
Minimum Impossible OR
Medium
2571
Minimum Operations to Reduce an Integer to 0
Medium
2572
Count the Number of Square-Free Subsets
Medium
2588
Count the Number of Beautiful Subarrays
Medium
2595
Number of Even and Odd Bits
Easy
2657
Find the Prefix Common Array of Two Arrays
Medium
2680
Maximum OR
Medium
2683
Neighboring Bitwise XOR
Medium
2708
Maximum Strength of a Group
Medium
2732
Find a Good Subset of the Matrix
Hard
2741
Special Permutations
Medium
2749
Minimum Operations to Make the Integer Zero
Medium
2791
Count Paths That Can Form a Palindrome in a Tree
Hard
2835
Minimum Operations to Form Subsequence With Target Sum
Hard
2836
Maximize Value of Function in a Ball Passing Game
Hard
2857
Count Pairs of Points With Distance k
Medium
2859
Sum of Values at Indices With K Set Bits
Easy
2869
Minimum Operations to Collect Elements
Easy
2871
Split Array Into Maximum Number of Subarrays
Medium
2897
Apply Operations on Array to Maximize Sum of Squares
Hard
2917
Find the K-or of an Array
Easy
2920
Maximum Points After Collecting Coins From All Nodes
Hard
2932
Maximum Strong Pair XOR I
Easy
2935
Maximum Strong Pair XOR II
Hard
2939
Maximum Xor Product
Medium
2959
Number of Possible Sets of Closing Branches
Hard
2980
Check if Bitwise OR Has Trailing Zeros
Easy
2997
Minimum Number of Operations to Make Array XOR Equal to K
Medium
3003
Maximize the Number of Partitions After Operations
Hard
3007
Maximum Number That Sum of the Prices Is Less Than or Equal to K
Medium
3011
Find if Array Can Be Sorted
Medium
3022
Minimize OR of Remaining Elements Using Operations
Hard
3068
Find the Maximum Sum of Node Values
Hard
3095
Shortest Subarray With OR at Least K I
Easy
3097
Shortest Subarray With OR at Least K II
Medium
3108
Minimum Cost Walk in Weighted Graph
Hard
3116
Kth Smallest Amount With Single Denomination Combination
Hard
3117
Minimum Sum of Values by Dividing Array
Hard
3133
Minimum Array End
Medium
3145
Find Products of Elements of Big Array
Hard
3149
Find the Minimum Cost Array Permutation
Hard
3154
Find Number of Ways to Reach the K-th Stair
Hard
3158
Find the XOR of Numbers Which Appear Twice
Easy
3171
Find Subarray With Bitwise OR Closest to K
Hard
3181
Maximum Total Reward Using Operations II
Hard
3191
Minimum Operations to Make Binary Array Elements Equal to One I
Medium
3209
Number of Subarrays With AND Value of K
Hard
3211
Generate Binary Strings Without Adjacent Zeros
Medium
3226
Number of Bit Changes to Make Two Integers Equal
Easy
3276
Select Cells in Grid With Maximum Score
Hard
3283
Maximum Number of Moves to Kill All Pawns
Hard
3287
Find the Maximum Sequence Value of Array
Hard
3304
Find the K-th Character in String Game I
Easy
3307
Find the K-th Character in String Game II
Hard
3309
Maximum Possible Number by Binary Concatenation
Medium
3314
Construct the Minimum Bitwise Array I
Easy
3315
Construct the Minimum Bitwise Array II
Medium
3370
Smallest Number With All Set Bits
Easy
3376
Minimum Time to Break Locks I
Medium
3393
Count Paths With the Given XOR Value
Medium
3435
Frequencies of Shortest Supersequences
Hard
3444
Minimum Increments for Target Multiples in an Array
Hard
3495
Minimum Operations to Make Array Elements Zero
Hard
3513
Number of Unique XOR Triplets I
Medium
3514
Number of Unique XOR Triplets II
Medium
3530
Maximum Profit from Valid Topological Order in DAG
Hard
3533
Concatenated Divisibility
Hard
3539
Find Sum of Array Product of Magical Sequences
Hard
3566
Partition Array into Two Equal Product Subsets
Medium
3568
Minimum Moves to Clean the Classroom
Medium
3575
Maximum Good Subtree Score
Hard
3594
Minimum Time to Transport All Individuals
Hard
3599
Partition Array to Minimize XOR
Medium
3615
Longest Palindromic Path in Graph
Hard
← Browse all LeetCode problems