Bit Manipulation Interview Questions
Master 200 bit manipulation problems frequently asked in technical interviews. These questions test your understanding of bit manipulationconcepts and are essential for coding interview success.
200
Total Problems
40
Easy
102
Medium
58
Hard
#2710MediumFrequency: 100%
Minimum Operations to Reduce an Integer to 0
#1
Rank
#2
Rank
#1024HardFrequency: 76.6%
Triples with Bitwise AND Equal To Zero
#3
Rank
#2905HardFrequency: 71.9%
Count Paths That Can Form a Palindrome in a Tree
#4
Rank
#3875HardFrequency: 69.8%
Maximum Good Subtree Score
#5
Rank
#698MediumFrequency: 69.2%
Partition to K Equal Sum Subsets
#6
Rank
#7
Rank
#8
Rank
#1409HardFrequency: 65.5%
Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
#9
Rank
#757MediumFrequency: 65.5%
Pyramid Transition Matrix
#10
Rank
#638MediumFrequency: 65.5%
Shopping Offers
#11
Rank
#12
Rank
#187MediumFrequency: 57.5%
Repeated DNA Sequences
#13
Rank
#2594EasyFrequency: 55.8%
Count Pairs Of Similar Strings
#14
Rank
#3032HardFrequency: 55.8%
Maximize Value of Function in a Ball Passing Game
#15
Rank
#287MediumFrequency: 55.7%
Find the Duplicate Number
#16
Rank
#3294MediumFrequency: 55.1%
Number of Self-Divisible Permutations
#17
Rank
#3436HardFrequency: 55.1%
Find Subarray With Bitwise OR Closest to K
#18
Rank
#1778HardFrequency: 55.1%
Maximize Grid Happiness
#19
Rank
#20
Rank
#268EasyFrequency: 54.4%
Missing Number
#21
Rank
#464MediumFrequency: 53.7%
Can I Win
#22
Rank
#23
Rank
#24
Rank
#1732HardFrequency: 53.4%
Minimum One Bit Operations to Make Integers Zero
#25
Rank
#1022HardFrequency: 52.4%
Unique Paths III
#26
Rank
#1038HardFrequency: 51%
Number of Squareful Arrays
#27
Rank
#2482MediumFrequency: 48.7%
Maximum Rows Covered by Columns
#28
Rank
#473MediumFrequency: 48%
Matchsticks to Square
#29
Rank
#30
Rank
#465HardFrequency: 47.5%
Optimal Account Balancing
#31
Rank
#32
Rank
#3475MediumFrequency: 47.5%
Minimum Operations to Make Binary Array Elements Equal to One I
#33
Rank
#895HardFrequency: 45.2%
Shortest Path to Get All Keys
#34
Rank
#1220HardFrequency: 45.2%
Smallest Sufficient Team
#35
Rank
#36
Rank
#37
Rank
#38
Rank
#39
Rank
#40
Rank
#41
Rank
#42
Rank
#43
Rank
#421MediumFrequency: 35.3%
Maximum XOR of Two Numbers in an Array
#44
Rank
#45
Rank
#823HardFrequency: 34.3%
Split Array With Same Average
#46
Rank
#1873EasyFrequency: 34.3%
Longest Nice Substring
#47
Rank
#2308EasyFrequency: 34.3%
Divide Array Into Equal Pairs
#48
Rank
#2162HardFrequency: 34.2%
Partition Array Into Two Arrays to Minimize Sum Difference
#49
Rank
#50
Rank
#2272HardFrequency: 33.3%
Maximum Good People Based on Statements
#51
Rank
#3092MediumFrequency: 33%
Minimum Moves to Spread Stones Over Grid
#52
Rank
#1441MediumFrequency: 32.8%
Minimum Flips to Make a OR b Equal to c
#53
Rank
#54
Rank
#1487MediumFrequency: 32.1%
Cinema Seat Allocation
#55
Rank
#3851HardFrequency: 31.3%
Find Sum of Array Product of Magical Sequences
#56
Rank
#57
Rank
#4033MediumFrequency: 31.3%
Longest Subsequence With Non-Zero Bitwise XOR
#58
Rank
#861EasyFrequency: 31.1%
Flipping an Image
#59
Rank
#60
Rank
#3659MediumFrequency: 31.1%
Count Paths With the Given XOR Value
#61
Rank
#351MediumFrequency: 29.7%
Android Unlock Patterns
#62
Rank
#877HardFrequency: 29.7%
Shortest Path Visiting All Nodes
#63
Rank
#2059MediumFrequency: 29.7%
Unique Length-3 Palindromic Subsequences
#64
Rank
#691HardFrequency: 29.5%
Stickers to Spell Word
#65
Rank
#672MediumFrequency: 29.3%
Bulb Switcher II
#66
Rank
#1993EasyFrequency: 29.1%
Sum of All Subset XOR Totals
#67
Rank
#68
Rank
#1473MediumFrequency: 27.3%
Find the Longest Substring Containing Vowels in Even Counts
#69
Rank
#1799HardFrequency: 27.3%
Minimum Incompatibility
#70
Rank
#934MediumFrequency: 27.3%
Bitwise ORs of Subarrays
#71
Rank
#4009EasyFrequency: 27.3%
Bitwise OR of Even Numbers in an Array
#72
Rank
#4222HardFrequency: 27.3%
Count Good Subarrays
#73
Rank
#1296HardFrequency: 27.2%
Kth Ancestor of a Tree Node
#74
Rank
#222MediumFrequency: 27.2%
Count Complete Tree Nodes
#75
Rank
#1360MediumFrequency: 26.7%
Maximum Length of a Concatenated String with Unique Characters
#76
Rank
#77
Rank
#1825HardFrequency: 26.5%
Find Minimum Time to Finish All Jobs
#78
Rank
#79
Rank
#2427EasyFrequency: 26.3%
First Letter to Appear Twice
#80
Rank
#2322MediumFrequency: 25.4%
Number of Ways to Build Sturdy Brick Wall
#81
Rank
#82
Rank
#2766MediumFrequency: 25.4%
Find the Prefix Common Array of Two Arrays
#83
Rank
#1381HardFrequency: 25.1%
Maximum Score Words Formed by Letters
#84
Rank
#1418MediumFrequency: 25.1%
Fair Distribution of Cookies
#85
Rank
#1800MediumFrequency: 25.1%
Concatenation of Consecutive Binary Numbers
#86
Rank
#4154HardFrequency: 25.1%
Maximum Bitwise AND After Increment Operations
#87
Rank
#88
Rank
#1587HardFrequency: 24.4%
Parallel Courses II
#89
Rank
#2498MediumFrequency: 23.6%
Smallest Subarrays With Maximum Bitwise OR
#90
Rank
#3453MediumFrequency: 23.6%
Generate Binary Strings Without Adjacent Zeros
#91
Rank
#92
Rank
#1557MediumFrequency: 23.3%
Check If a String Contains All Binary Codes of Size K
#93
Rank
#2478MediumFrequency: 22.5%
Longest Nice Subarray
#94
Rank
#95
Rank
#397MediumFrequency: 22.1%
Integer Replacement
#96
Rank
#1632MediumFrequency: 22.1%
Number of Good Ways to Split a String
#97
Rank
#1826HardFrequency: 22.1%
Maximum XOR With an Element From Array
#98
Rank
#3600EasyFrequency: 22.1%
Find the K-th Character in String Game I
#99
Rank
#994MediumFrequency: 21.9%
Prison Cells After N Days
#100
Rank
#1520MediumFrequency: 21.9%
Number of Steps to Reduce a Number in Binary Representation to One
#101
Rank
#1723HardFrequency: 21.9%
Maximum Number of Achievable Transfer Requests
#102
Rank
#2400HardFrequency: 21.9%
Minimum Score After Removals on a Tree
#103
Rank
#104
Rank
#3414HardFrequency: 21.9%
Find Number of Ways to Reach the K-th Stair
#105
Rank
#106
Rank
#2078MediumFrequency: 21.5%
Maximum Compatibility Score Sum
#107
Rank
#2044MediumFrequency: 20.3%
Number of Wonderful Substrings
#108
Rank
#767EasyFrequency: 20%
Prime Number of Set Bits in Binary Representation
#109
Rank
#1568MediumFrequency: 20%
Pseudo-Palindromic Paths in a Binary Tree
#110
Rank
#1662MediumFrequency: 20%
Minimum Numbers of Function Calls to Make Target Array
#111
Rank
#112
Rank
#113
Rank
#114
Rank
#3521MediumFrequency: 20%
Count Triplets with Even XOR Set Bits II
#115
Rank
#1065MediumFrequency: 19.5%
Binary String With Substrings Representing 1 To N
#116
Rank
#1444EasyFrequency: 19.5%
Number of Steps to Reduce a Number to Zero
#117
Rank
#3240MediumFrequency: 19.5%
Maximum Number That Sum of the Prices Is Less Than or Equal to K
#118
Rank
#526MediumFrequency: 19.5%
Beautiful Arrangement
#119
Rank
#3575HardFrequency: 19.5%
Find the Maximum Sequence Value of Array
#120
Rank
#1458EasyFrequency: 19.5%
Sort Integers by The Number of 1 Bits
#121
Rank
#1650MediumFrequency: 18%
Find Root of N-Ary Tree
#122
Rank
#1717HardFrequency: 18%
Minimum Cost to Connect Two Groups of Points
#123
Rank
#1758HardFrequency: 18%
Distribute Repeating Integers
#124
Rank
#1860MediumFrequency: 18%
Find Kth Largest XOR Coordinate Value
#125
Rank
#1924HardFrequency: 18%
Maximum Number of Groups Getting Fresh Donuts
#126
Rank
#2291HardFrequency: 18%
Maximum AND Sum of Array
#127
Rank
#2529MediumFrequency: 18%
Range Product Queries of Powers
#128
Rank
#4161MediumFrequency: 18%
Minimum Bitwise OR From Grid
#129
Rank
#130
Rank
#131
Rank
#411HardFrequency: 16.4%
Minimum Unique Word Abbreviation
#132
Rank
#133
Rank
#1067MediumFrequency: 16.4%
Campus Bikes II
#134
Rank
#2256MediumFrequency: 16.4%
Count Words Obtained After Adding a Letter
#135
Rank
#2268MediumFrequency: 16.4%
Remove All Ones With Row and Column Flips
#136
Rank
#2314MediumFrequency: 16.4%
Remove All Ones With Row and Column Flips II
#137
Rank
#2953MediumFrequency: 16.4%
Count Pairs of Points With Distance k
#138
Rank
#3364HardFrequency: 16.4%
Minimum Sum of Values by Dividing Array
#139
Rank
#980HardFrequency: 16.4%
Find the Shortest Superstring
#140
Rank
#1037HardFrequency: 16.4%
Minimum Number of K Consecutive Bit Flips
#141
Rank
#3348HardFrequency: 16.4%
Minimum Cost Walk in Weighted Graph
#142
Rank
#143
Rank
#144
Rank
#3611MediumFrequency: 16.1%
Construct the Minimum Bitwise Array II
#145
Rank
#146
Rank
#1786EasyFrequency: 14.6%
Count the Number of Consistent Strings
#147
Rank
#148
Rank
#2170MediumFrequency: 14.6%
Count Number of Maximum Bitwise-OR Subsets
#149
Rank
#3431HardFrequency: 14.6%
Find the Minimum Cost Array Permutation
#150
Rank
#2709MediumFrequency: 14.6%
Count the Number of Square-Free Subsets
#151
Rank
#152
Rank
#3852HardFrequency: 14.6%
Path Existence Queries in a Graph II
#153
Rank
#3307HardFrequency: 14.4%
Find the Maximum Sum of Node Values
#154
Rank
#155
Rank
#2837MediumFrequency: 13.2%
Minimum Operations to Make the Integer Zero
#156
Rank
#1471HardFrequency: 12.6%
Maximum Students Taking Exam
#157
Rank
#3744HardFrequency: 12.6%
Minimum Operations to Make Array Elements Zero
#158
Rank
#159
Rank
#160
Rank
#3380MediumFrequency: 11.4%
Shortest Subarray With OR at Least K II
#161
Rank
#3428EasyFrequency: 11.4%
Find the XOR of Numbers Which Appear Twice
#162
Rank
#2503MediumFrequency: 10.5%
Longest Subarray With Maximum Bitwise AND
#163
Rank
#164
Rank
#3601HardFrequency: 10.5%
Find the K-th Character in String Game II
#165
Rank
#3842HardFrequency: 10.5%
Number of Ways to Assign Edge Weights II
#166
Rank
#3249MediumFrequency: 10.3%
Minimum Number of Operations to Make Array XOR Equal to K
#167
Rank
#168
Rank
#169
Rank
#170
Rank
#2356MediumFrequency: 8.1%
Largest Combination With Bitwise AND Greater Than Zero
#171
Rank
#3900HardFrequency: 8.1%
Find Weighted Median Node in Tree
#172
Rank
#1881HardFrequency: 8.1%
Closest Subsequence Sum
#173
Rank
#4189HardFrequency: 8.1%
Find Nth Smallest Integer With K One Bits
#174
Rank
#175
Rank
#3841HardFrequency: 8%
Concatenated Divisibility
#176
Rank
#2519MediumFrequency: 7.3%
Find The Original Array of Prefix Xor
#177
Rank
#178
Rank
#491MediumFrequency: 7.3%
Non-decreasing Subsequences
#179
Rank
#891MediumFrequency: 7.2%
Score After Flipping Matrix
#180
Rank
#3820MediumFrequency: 7.2%
Number of Unique XOR Triplets II
#181
Rank
#828HardFrequency: 5.5%
Chalkboard XOR Game
#182
Rank
#3579MediumFrequency: 5.5%
Maximum Possible Number by Binary Concatenation
#183
Rank
#2533MediumFrequency: 5.5%
Bitwise XOR of All Pairings
#184
Rank
#1913HardFrequency: 5.5%
Make the XOR of All Segments Equal to Zero
#185
Rank
#3882HardFrequency: 5.5%
Partition Array for Maximum XOR and AND
#186
Rank
#2130MediumFrequency: 5.5%
Maximum Product of the Length of Two Palindromic Subsequences
#187
Rank
#188
Rank
#189
Rank
#1553MediumFrequency: 5%
Count Triplets That Can Form Two Arrays of Equal XOR
#190
Rank
#3560HardFrequency: 5%
Maximum Number of Moves to Kill All Pawns
#191
Rank
#192
Rank
#3913MediumFrequency: 5%
Partition Array to Minimize XOR
#193
Rank
#4205MediumFrequency: 5%
Minimum XOR Path in a Grid
#194
Rank
#3930HardFrequency: 5%
Longest Palindromic Path in Graph
#195
Rank
#196
Rank
#2114MediumFrequency: 5%
Minimum Number of Work Sessions to Finish the Tasks
#197
Rank
#198
Rank
#199
Rank
#3843MediumFrequency: 5%
Partition Array into Two Equal Product Subsets
#200
Rank
Master Bit Manipulation in Real Interviews
Get AI-powered assistance when solving bit manipulation problems during your actual interviews.
Get Started FreeNo credit card required