Bit Manipulation Interview Questions
223 real interview questions test Bit Manipulation. Practice any of them in the code editor and get AI feedback on your solution.
- Junior21% (46)
- Mid/Senior44% (99)
- Staff35% (78)
Companies that ask Bit Manipulation the most
Questionspage 1 of 3
- Find the Duplicate Number22 companiesMid/Senior
- Subsets20 companiesMid/Senior
- Missing Number19 companiesJunior
- Single Number15 companiesJunior
- Add Binary13 companiesJunior
- Number of 1 Bits11 companiesJunior
- Power of Two11 companiesJunior
- Divide Two Integers10 companiesMid/Senior
- Reverse Bits10 companiesJunior
- Counting Bits10 companiesJunior
- Subsets II9 companiesMid/Senior
- Matchsticks to Square9 companiesMid/Senior
- Power of Four8 companiesJunior
- Sum of Two Integers8 companiesMid/Senior
- Partition to K Equal Sum Subsets8 companiesMid/Senior
- Partition Array Into Two Arrays to Minimize Sum Difference8 companiesStaff
- Minimum Operations to Reduce an Integer to 08 companiesMid/Senior
- Repeated DNA Sequences7 companiesMid/Senior
- Count Complete Tree Nodes7 companiesJunior
- Single Number III7 companiesMid/Senior
- Set Mismatch7 companiesJunior
- K-th Symbol in Grammar7 companiesMid/Senior
- Letter Case Permutation7 companiesMid/Senior
- Bitwise ORs of Subarrays7 companiesMid/Senior
- Unique Paths III7 companiesStaff
- Number of Steps to Reduce a Number in Binary Representation to One7 companiesMid/Senior
- Count Number of Maximum Bitwise-OR Subsets7 companiesMid/Senior
- Minimum Bit Flips to Convert Number7 companiesJunior
- Find the Difference6 companiesJunior
- Convert a Number to Hexadecimal6 companiesJunior
- Maximum XOR of Two Numbers in an Array6 companiesMid/Senior
- Beautiful Arrangement6 companiesMid/Senior
- Shopping Offers6 companiesMid/Senior
- Split Array With Same Average6 companiesStaff
- Flipping an Image6 companiesJunior
- Shortest Path to Get All Keys6 companiesStaff
- Binary Gap6 companiesJunior
- Maximum Length of a Concatenated String with Unique Characters6 companiesMid/Senior
- Number of Steps to Reduce a Number to Zero6 companiesJunior
- Find the Longest Substring Containing Vowels in Even Counts6 companiesMid/Senior
- Longest Nice Subarray6 companiesMid/Senior
- Longest Subarray With Maximum Bitwise AND6 companiesMid/Senior
- Minimize XOR6 companiesMid/Senior
- Find the Prefix Common Array of Two Arrays6 companiesMid/Senior
- Minimum Cost Walk in Weighted Graph6 companiesStaff
- Minimum Operations to Make Binary Array Elements Equal to One I6 companiesMid/Senior
- Gray Code5 companiesMid/Senior
- Single Number II5 companiesMid/Senior
- Bitwise AND of Numbers Range5 companiesMid/Senior
- Binary Watch5 companiesJunior
- Number Complement5 companiesJunior
- Binary Number with Alternating Bits5 companiesJunior
- Minimum Number of K Consecutive Bit Flips5 companiesStaff
- Complement of Base 10 Integer5 companiesJunior
- Cinema Seat Allocation5 companiesMid/Senior
- Check If a String Contains All Binary Codes of Size K5 companiesMid/Senior
- Minimum One Bit Operations to Make Integers Zero5 companiesStaff
- Find Minimum Time to Finish All Jobs5 companiesStaff
- Sum of All Subset XOR Totals5 companiesJunior
- Unique Length-3 Palindromic Subsequences5 companiesMid/Senior
- Divide Array Into Equal Pairs5 companiesJunior
- Largest Combination With Bitwise AND Greater Than Zero5 companiesMid/Senior
- Smallest Subarrays With Maximum Bitwise OR5 companiesMid/Senior
- Range Product Queries of Powers5 companiesMid/Senior
- Minimum Moves to Spread Stones Over Grid5 companiesMid/Senior
- Find if Array Can Be Sorted5 companiesMid/Senior
- Find the K-th Character in String Game I5 companiesJunior
- Construct the Minimum Bitwise Array I5 companiesJunior
- UTF-8 Validation4 companiesMid/Senior
- Integer Replacement4 companiesMid/Senior
- Hamming Distance4 companiesJunior
- Can I Win4 companiesMid/Senior
- Non-decreasing Subsequences4 companiesMid/Senior
- Stickers to Spell Word4 companiesStaff
- Shortest Path Visiting All Nodes4 companiesStaff
- Maximum Score Words Formed by Letters4 companiesStaff
- XOR Queries of a Subarray4 companiesMid/Senior
- Sort Integers by The Number of 1 Bits4 companiesJunior
- Longest Nice Substring4 companiesJunior
- Minimum Score After Removals on a Tree4 companiesStaff
- Find The Original Array of Prefix Xor4 companiesMid/Senior
- Count Pairs Of Similar Strings4 companiesJunior
- Maximum OR4 companiesMid/Senior
- Minimum Operations to Make the Integer Zero4 companiesMid/Senior
- Count Paths That Can Form a Palindrome in a Tree4 companiesStaff
- Maximum Xor Product4 companiesMid/Senior
- Find the Maximum Sum of Node Values4 companiesStaff
- Shortest Subarray With OR at Least K II4 companiesMid/Senior
- Minimum Array End4 companiesMid/Senior
- Generate Binary Strings Without Adjacent Zeros4 companiesMid/Senior
- Construct the Minimum Bitwise Array II4 companiesMid/Senior
- Minimum Operations to Make Array Elements Zero4 companiesStaff
- Total Hamming Distance3 companiesMid/Senior
- Pyramid Transition Matrix3 companiesMid/Senior
- Chalkboard XOR Game3 companiesStaff
- Score After Flipping Matrix3 companiesMid/Senior
- Find the Shortest Superstring3 companiesStaff
- Triples with Bitwise AND Equal To Zero3 companiesStaff
- Number of Squareful Arrays3 companiesStaff
- Binary Prefix Divisible By 53 companiesJunior