Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
Interview Questions›Topics›Bit Manipulation

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

Related Topics

ArrayDynamic ProgrammingMathBitmaskHash TableBacktrackingStringMatrix
#2710MediumFrequency: 100%

Minimum Operations to Reduce an Integer to 0

Asked at Salesforce
Dynamic ProgrammingGreedyBit Manipulation
#1
Rank
#752MediumFrequency: 97.6%

IP to CIDR

Asked at Databricks
StringBit Manipulation
#2
Rank
#1024HardFrequency: 76.6%

Triples with Bitwise AND Equal To Zero

Asked at Flipkart
ArrayHash TableBit Manipulation
#3
Rank
#2905HardFrequency: 71.9%

Count Paths That Can Form a Palindrome in a Tree

Asked at Uber
Hash TableBit ManipulationTreeDepth-First Search
#4
Rank
#3875HardFrequency: 69.8%

Maximum Good Subtree Score

Asked at Infosys
ArrayDynamic ProgrammingBit ManipulationTreeDepth-First SearchBitmask
#5
Rank
#698MediumFrequency: 69.2%

Partition to K Equal Sum Subsets

Asked at LinkedIn
ArrayDynamic ProgrammingBacktrackingBit ManipulationMemoizationBitmask
#6
Rank
#136EasyFrequency: 65.5%

Single Number

Asked at Airbnb
ArrayBit Manipulation
#7
Rank
#190EasyFrequency: 65.5%

Reverse Bits

Asked at Airbnb
Divide and ConquerBit Manipulation
#8
Rank
#1409HardFrequency: 65.5%

Minimum Number of Flips to Convert Binary Matrix to Zero Matrix

Asked at Airbnb
ArrayHash TableBit ManipulationBreadth-First SearchMatrix
#9
Rank
#757MediumFrequency: 65.5%

Pyramid Transition Matrix

Asked at Airbnb
Hash TableStringBacktrackingBit Manipulation
#10
Rank
#638MediumFrequency: 65.5%

Shopping Offers

Asked at Airbnb
ArrayDynamic ProgrammingBacktrackingBit ManipulationMemoizationBitmaskKnapsack ProblemComplete Knapsack
#11
Rank
#78MediumFrequency: 64%

Subsets

Asked at Amazon
ArrayBacktrackingBit Manipulation
#12
Rank
#187MediumFrequency: 57.5%

Repeated DNA Sequences

Asked at LinkedIn
Hash TableStringBit ManipulationSliding WindowRolling HashHash FunctionZ AlgorithmBoyer–Moore String-Search Algorithm
#13
Rank
#2594EasyFrequency: 55.8%

Count Pairs Of Similar Strings

Asked at Oracle
ArrayHash TableStringBit ManipulationCounting
#14
Rank
#3032HardFrequency: 55.8%

Maximize Value of Function in a Ball Passing Game

Asked at Oracle
ArrayDynamic ProgrammingBit Manipulation
#15
Rank
#287MediumFrequency: 55.7%

Find the Duplicate Number

Asked at Amazon
ArrayTwo PointersBinary SearchBit ManipulationPigeonhole PrincipleFloyd's Cycle Finding Algorithm
#16
Rank
#3294MediumFrequency: 55.1%

Number of Self-Divisible Permutations

Asked at Salesforce
ArrayMathDynamic ProgrammingBacktrackingBit ManipulationNumber TheoryBitmask
#17
Rank
#3436HardFrequency: 55.1%

Find Subarray With Bitwise OR Closest to K

Asked at Salesforce
ArrayBinary SearchBit ManipulationSegment Tree
#18
Rank
#1778HardFrequency: 55.1%

Maximize Grid Happiness

Asked at Salesforce
Dynamic ProgrammingBit ManipulationMemoizationBitmask
#19
Rank
#191EasyFrequency: 55%

Number of 1 Bits

Asked at Apple
Divide and ConquerBit Manipulation
#20
Rank
#268EasyFrequency: 54.4%

Missing Number

Asked at Amazon
ArrayHash TableMathBinary SearchBit ManipulationSorting
#21
Rank
#464MediumFrequency: 53.7%

Can I Win

Asked at LinkedIn
MathDynamic ProgrammingBit ManipulationMemoizationGame TheoryBitmask
#22
Rank
#67EasyFrequency: 53.4%

Add Binary

Asked at Google
MathStringBit ManipulationSimulation
#23
Rank
#231EasyFrequency: 53.4%

Power of Two

Asked at Google
MathBit ManipulationRecursion
#24
Rank
#1732HardFrequency: 53.4%

Minimum One Bit Operations to Make Integers Zero

Asked at Oracle
MathDynamic ProgrammingBit ManipulationRecursionMemoization
#25
Rank
#1022HardFrequency: 52.4%

Unique Paths III

Asked at Databricks
ArrayBacktrackingBit ManipulationMatrixHamiltonian Path
#26
Rank
#1038HardFrequency: 51%

Number of Squareful Arrays

Asked at Apple
ArrayHash TableMathDynamic ProgrammingBacktrackingBit ManipulationBitmask
#27
Rank
#2482MediumFrequency: 48.7%

Maximum Rows Covered by Columns

Asked at Apple
ArrayBacktrackingBit ManipulationMatrixEnumeration
#28
Rank
#473MediumFrequency: 48%

Matchsticks to Square

Asked at TikTok
ArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask
#29
Rank
#266EasyFrequency: 47.5%

Palindrome Permutation

Asked at Uber
Hash TableStringBit Manipulation
#30
Rank
#465HardFrequency: 47.5%

Optimal Account Balancing

Asked at Uber
ArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask
#31
Rank
#1940MediumFrequency: 47.5%

Maximum XOR for Each Query

Asked at Uber
ArrayBit ManipulationPrefix Sum
#32
Rank
#3475MediumFrequency: 47.5%

Minimum Operations to Make Binary Array Elements Equal to One I

Asked at Uber
ArrayBit ManipulationQueueSliding WindowPrefix Sum
#33
Rank
#895HardFrequency: 45.2%

Shortest Path to Get All Keys

Asked at Airbnb
ArrayBit ManipulationBreadth-First SearchMatrix
#34
Rank
#1220HardFrequency: 45.2%

Smallest Sufficient Team

Asked at Airbnb
ArrayDynamic ProgrammingBit ManipulationBitmask
#35
Rank
#29MediumFrequency: 45%

Divide Two Integers

Asked at Microsoft
MathBit Manipulation
#36
Rank
#90MediumFrequency: 44.8%

Subsets II

Asked at Google
ArrayBacktrackingBit Manipulation
#37
Rank
#389EasyFrequency: 42%

Find the Difference

Asked at Google
Hash TableStringBit ManipulationSorting
#38
Rank
#645EasyFrequency: 41.4%

Set Mismatch

Asked at Amazon
ArrayHash TableBit ManipulationSorting
#39
Rank
#137MediumFrequency: 40.5%

Single Number II

Asked at Microsoft
ArrayBit Manipulation
#40
Rank
#477MediumFrequency: 39.4%

Total Hamming Distance

Asked at Apple
ArrayMathBit Manipulation
#41
Rank
#3950MediumFrequency: 37.4%

Maximum K to Sort a Permutation

Asked at Amazon
ArrayBit Manipulation
#42
Rank
#371MediumFrequency: 35.8%

Sum of Two Integers

Asked at Google
MathBit Manipulation
#43
Rank
#421MediumFrequency: 35.3%

Maximum XOR of Two Numbers in an Array

Asked at Google
ArrayHash TableBit ManipulationTrie
#44
Rank
#800MediumFrequency: 35%

Letter Case Permutation

Asked at Meta
StringBacktrackingBit Manipulation
#45
Rank
#823HardFrequency: 34.3%

Split Array With Same Average

Asked at Microsoft
ArrayHash TableMathDynamic ProgrammingBit ManipulationMeet in the MiddleBitmask
#46
Rank
#1873EasyFrequency: 34.3%

Longest Nice Substring

Asked at Microsoft
Hash TableStringDivide and ConquerBit ManipulationSliding Window
#47
Rank
#2308EasyFrequency: 34.3%

Divide Array Into Equal Pairs

Asked at Microsoft
ArrayHash TableBit ManipulationCounting
#48
Rank
#2162HardFrequency: 34.2%

Partition Array Into Two Arrays to Minimize Sum Difference

Asked at Google
ArrayTwo PointersBinary SearchDynamic ProgrammingBit ManipulationMeet in the MiddleSortingOrdered SetBitmask
#49
Rank
#3951HardFrequency: 34.2%

Next Special Palindrome Number

Asked at Google
BacktrackingBit Manipulation
#50
Rank
#2272HardFrequency: 33.3%

Maximum Good People Based on Statements

Asked at Oracle
ArrayBacktrackingBit ManipulationEnumeration
#51
Rank
#3092MediumFrequency: 33%

Minimum Moves to Spread Stones Over Grid

Asked at TikTok
ArrayDynamic ProgrammingBacktrackingBit ManipulationMatrixBitmask
#52
Rank
#1441MediumFrequency: 32.8%

Minimum Flips to Make a OR b Equal to c

Asked at Microsoft
Bit Manipulation
#53
Rank
#89MediumFrequency: 32.3%

Gray Code

Asked at Amazon
MathBacktrackingBit Manipulation
#54
Rank
#1487MediumFrequency: 32.1%

Cinema Seat Allocation

Asked at LinkedIn
ArrayHash TableGreedyBit Manipulation
#55
Rank
#3851HardFrequency: 31.3%

Find Sum of Array Product of Magical Sequences

Asked at Infosys
ArrayMathDynamic ProgrammingBit ManipulationCombinatoricsBitmask
#56
Rank
#2730MediumFrequency: 31.3%

Maximum OR

Asked at Infosys
ArrayGreedyBit ManipulationPrefix Sum
#57
Rank
#4033MediumFrequency: 31.3%

Longest Subsequence With Non-Zero Bitwise XOR

Asked at Infosys
ArrayBit Manipulation
#58
Rank
#861EasyFrequency: 31.1%

Flipping an Image

Asked at Google
ArrayTwo PointersBit ManipulationMatrixSimulation
#59
Rank
#338EasyFrequency: 31.1%

Counting Bits

Asked at Microsoft
Dynamic ProgrammingBit Manipulation
#60
Rank
#3659MediumFrequency: 31.1%

Count Paths With the Given XOR Value

Asked at Microsoft
ArrayDynamic ProgrammingBit ManipulationMatrix
#61
Rank
#351MediumFrequency: 29.7%

Android Unlock Patterns

Asked at Google
Dynamic ProgrammingBacktrackingBit ManipulationBitmask
#62
Rank
#877HardFrequency: 29.7%

Shortest Path Visiting All Nodes

Asked at Google
Dynamic ProgrammingBit ManipulationBreadth-First SearchGraph TheoryBitmask
#63
Rank
#2059MediumFrequency: 29.7%

Unique Length-3 Palindromic Subsequences

Asked at Google
Hash TableStringBit ManipulationPrefix Sum
#64
Rank
#691HardFrequency: 29.5%

Stickers to Spell Word

Asked at Meta
ArrayHash TableStringDynamic ProgrammingBacktrackingBit ManipulationMemoizationBitmask
#65
Rank
#672MediumFrequency: 29.3%

Bulb Switcher II

Asked at Microsoft
MathBit ManipulationDepth-First SearchBreadth-First Search
#66
Rank
#1993EasyFrequency: 29.1%

Sum of All Subset XOR Totals

Asked at Amazon
ArrayMathBacktrackingBit ManipulationCombinatoricsEnumeration
#67
Rank
#795MediumFrequency: 28.9%

K-th Symbol in Grammar

Asked at Google
MathBit ManipulationRecursion
#68
Rank
#1473MediumFrequency: 27.3%

Find the Longest Substring Containing Vowels in Even Counts

Asked at Microsoft
Hash TableStringBit ManipulationPrefix Sum
#69
Rank
#1799HardFrequency: 27.3%

Minimum Incompatibility

Asked at Microsoft
ArrayHash TableDynamic ProgrammingBit ManipulationBitmask
#70
Rank
#934MediumFrequency: 27.3%

Bitwise ORs of Subarrays

Asked at Microsoft
ArrayDynamic ProgrammingBit Manipulation
#71
Rank
#4009EasyFrequency: 27.3%

Bitwise OR of Even Numbers in an Array

Asked at Microsoft
ArrayBit ManipulationSimulation
#72
Rank
#4222HardFrequency: 27.3%

Count Good Subarrays

Asked at Microsoft
ArrayStackBit ManipulationMonotonic Stack
#73
Rank
#1296HardFrequency: 27.2%

Kth Ancestor of a Tree Node

Asked at Google
Binary SearchDynamic ProgrammingBit ManipulationTreeDepth-First SearchBreadth-First SearchDesignBinary Lifting
#74
Rank
#222MediumFrequency: 27.2%

Count Complete Tree Nodes

Asked at Google
Binary SearchBit ManipulationTreeBinary Tree
#75
Rank
#1360MediumFrequency: 26.7%

Maximum Length of a Concatenated String with Unique Characters

Asked at Meta
ArrayStringBacktrackingBit Manipulation
#76
Rank
#260MediumFrequency: 26.5%

Single Number III

Asked at Amazon
ArrayBit Manipulation
#77
Rank
#1825HardFrequency: 26.5%

Find Minimum Time to Finish All Jobs

Asked at Amazon
ArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask
#78
Rank
#342EasyFrequency: 26.3%

Power of Four

Asked at Google
MathBit ManipulationRecursion
#79
Rank
#2427EasyFrequency: 26.3%

First Letter to Appear Twice

Asked at Google
Hash TableStringBit ManipulationCounting
#80
Rank
#2322MediumFrequency: 25.4%

Number of Ways to Build Sturdy Brick Wall

Asked at Google
ArrayDynamic ProgrammingBit ManipulationBitmask
#81
Rank
#318MediumFrequency: 25.4%

Maximum Product of Word Lengths

Asked at Google
ArrayStringBit Manipulation
#82
Rank
#2766MediumFrequency: 25.4%

Find the Prefix Common Array of Two Arrays

Asked at Google
ArrayHash TableBit Manipulation
#83
Rank
#1381HardFrequency: 25.1%

Maximum Score Words Formed by Letters

Asked at Amazon
ArrayHash TableStringDynamic ProgrammingBacktrackingBit ManipulationCountingBitmask
#84
Rank
#1418MediumFrequency: 25.1%

Fair Distribution of Cookies

Asked at Amazon
ArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask
#85
Rank
#1800MediumFrequency: 25.1%

Concatenation of Consecutive Binary Numbers

Asked at Amazon
MathBit ManipulationSimulation
#86
Rank
#4154HardFrequency: 25.1%

Maximum Bitwise AND After Increment Operations

Asked at Amazon
ArrayGreedyBit ManipulationSorting
#87
Rank
#401EasyFrequency: 24.4%

Binary Watch

Asked at Google
BacktrackingBit Manipulation
#88
Rank
#1587HardFrequency: 24.4%

Parallel Courses II

Asked at Google
Dynamic ProgrammingBit ManipulationGraph TheoryBitmaskDirected Acyclic Graph
#89
Rank
#2498MediumFrequency: 23.6%

Smallest Subarrays With Maximum Bitwise OR

Asked at Amazon
ArrayBinary SearchBit ManipulationSliding Window
#90
Rank
#3453MediumFrequency: 23.6%

Generate Binary Strings Without Adjacent Zeros

Asked at Amazon
StringBacktrackingBit Manipulation
#91
Rank
#405EasyFrequency: 23.4%

Convert a Number to Hexadecimal

Asked at Meta
MathStringBit Manipulation
#92
Rank
#1557MediumFrequency: 23.3%

Check If a String Contains All Binary Codes of Size K

Asked at Google
Hash TableStringBit ManipulationRolling HashHash FunctionDirected Acyclic Graph
#93
Rank
#2478MediumFrequency: 22.5%

Longest Nice Subarray

Asked at Microsoft
ArrayBit ManipulationSliding Window
#94
Rank
#393MediumFrequency: 22.1%

UTF-8 Validation

Asked at Google
ArrayBit Manipulation
#95
Rank
#397MediumFrequency: 22.1%

Integer Replacement

Asked at Google
Dynamic ProgrammingGreedyBit ManipulationMemoization
#96
Rank
#1632MediumFrequency: 22.1%

Number of Good Ways to Split a String

Asked at Google
Hash TableStringDynamic ProgrammingBit ManipulationPrefix Sum
#97
Rank
#1826HardFrequency: 22.1%

Maximum XOR With an Element From Array

Asked at Google
ArrayBit ManipulationTrie
#98
Rank
#3600EasyFrequency: 22.1%

Find the K-th Character in String Game I

Asked at Google
MathBit ManipulationRecursionSimulation
#99
Rank
#994MediumFrequency: 21.9%

Prison Cells After N Days

Asked at Amazon
ArrayHash TableMathBit ManipulationFloyd's Cycle Finding Algorithm
#100
Rank
#1520MediumFrequency: 21.9%

Number of Steps to Reduce a Number in Binary Representation to One

Asked at Amazon
StringBit ManipulationSimulation
#101
Rank
#1723HardFrequency: 21.9%

Maximum Number of Achievable Transfer Requests

Asked at Amazon
ArrayBacktrackingBit ManipulationEnumeration
#102
Rank
#2400HardFrequency: 21.9%

Minimum Score After Removals on a Tree

Asked at Amazon
ArrayBit ManipulationTreeDepth-First Search
#103
Rank
#3183EasyFrequency: 21.9%

Find the K-or of an Array

Asked at Amazon
ArrayBit Manipulation
#104
Rank
#3414HardFrequency: 21.9%

Find Number of Ways to Reach the K-th Stair

Asked at Amazon
MathDynamic ProgrammingBit ManipulationMemoizationCombinatorics
#105
Rank
#461EasyFrequency: 21.5%

Hamming Distance

Asked at Meta
Bit Manipulation
#106
Rank
#2078MediumFrequency: 21.5%

Maximum Compatibility Score Sum

Asked at Meta
ArrayDynamic ProgrammingBacktrackingBit ManipulationBitmaskHungarian AlgorithmBipartite GraphSuccessive Shortest Path AlgorithmMatching (Graph)Perfect MatchingMinimum-Cost FlowFlow Network
#107
Rank
#2044MediumFrequency: 20.3%

Number of Wonderful Substrings

Asked at Uber
Hash TableStringBit ManipulationPrefix Sum
#108
Rank
#767EasyFrequency: 20%

Prime Number of Set Bits in Binary Representation

Asked at Amazon
MathBit ManipulationPrimality Test
#109
Rank
#1568MediumFrequency: 20%

Pseudo-Palindromic Paths in a Binary Tree

Asked at Amazon
Bit ManipulationTreeDepth-First SearchBreadth-First SearchBinary Tree
#110
Rank
#1662MediumFrequency: 20%

Minimum Numbers of Function Calls to Make Target Array

Asked at Amazon
ArrayGreedyBit Manipulation
#111
Rank
#1835MediumFrequency: 20%

Decode XORed Permutation

Asked at Amazon
ArrayBit Manipulation
#112
Rank
#2621MediumFrequency: 20%

Find Xor-Beauty of Array

Asked at Amazon
ArrayMathBit Manipulation
#113
Rank
#3506EasyFrequency: 20%

Count Triplets with Even XOR Set Bits I

Asked at Amazon
ArrayBit Manipulation
#114
Rank
#3521MediumFrequency: 20%

Count Triplets with Even XOR Set Bits II

Asked at Amazon
ArrayBit Manipulation
#115
Rank
#1065MediumFrequency: 19.5%

Binary String With Substrings Representing 1 To N

Asked at Google
Hash TableStringBit ManipulationSliding Window
#116
Rank
#1444EasyFrequency: 19.5%

Number of Steps to Reduce a Number to Zero

Asked at Google
MathBit Manipulation
#117
Rank
#3240MediumFrequency: 19.5%

Maximum Number That Sum of the Prices Is Less Than or Equal to K

Asked at Google
MathBinary SearchDynamic ProgrammingBit Manipulation
#118
Rank
#526MediumFrequency: 19.5%

Beautiful Arrangement

Asked at Google
ArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask
#119
Rank
#3575HardFrequency: 19.5%

Find the Maximum Sequence Value of Array

Asked at Google
ArrayDynamic ProgrammingBit Manipulation
#120
Rank
#1458EasyFrequency: 19.5%

Sort Integers by The Number of 1 Bits

Asked at Microsoft
ArrayBit ManipulationSortingCounting
#121
Rank
#1650MediumFrequency: 18%

Find Root of N-Ary Tree

Asked at Google
Hash TableBit ManipulationTreeDepth-First Search
#122
Rank
#1717HardFrequency: 18%

Minimum Cost to Connect Two Groups of Points

Asked at Google
ArrayDynamic ProgrammingBit ManipulationMatrixBitmaskBipartite GraphSuccessive Shortest Path AlgorithmMatching (Graph)Minimum-Cost FlowFlow Network
#123
Rank
#1758HardFrequency: 18%

Distribute Repeating Integers

Asked at Google
ArrayHash TableDynamic ProgrammingBacktrackingBit ManipulationCountingBitmask
#124
Rank
#1860MediumFrequency: 18%

Find Kth Largest XOR Coordinate Value

Asked at Google
ArrayDivide and ConquerBit ManipulationSortingHeap (Priority Queue)MatrixPrefix SumQuickselect
#125
Rank
#1924HardFrequency: 18%

Maximum Number of Groups Getting Fresh Donuts

Asked at Google
ArrayDynamic ProgrammingBit ManipulationMemoizationBitmask
#126
Rank
#2291HardFrequency: 18%

Maximum AND Sum of Array

Asked at Google
ArrayDynamic ProgrammingBit ManipulationBitmask
#127
Rank
#2529MediumFrequency: 18%

Range Product Queries of Powers

Asked at Google
ArrayBit ManipulationPrefix Sum
#128
Rank
#4161MediumFrequency: 18%

Minimum Bitwise OR From Grid

Asked at Google
ArrayGreedyBit ManipulationMatrix
#129
Rank
#201MediumFrequency: 16.4%

Bitwise AND of Numbers Range

Asked at Google
Bit Manipulation
#130
Rank
#320MediumFrequency: 16.4%

Generalized Abbreviation

Asked at Google
StringBacktrackingBit Manipulation
#131
Rank
#411HardFrequency: 16.4%

Minimum Unique Word Abbreviation

Asked at Google
ArrayStringBacktrackingBit Manipulation
#132
Rank
#798HardFrequency: 16.4%

Transform to Chessboard

Asked at Google
ArrayMathBit ManipulationMatrix
#133
Rank
#1067MediumFrequency: 16.4%

Campus Bikes II

Asked at Google
ArrayDynamic ProgrammingBacktrackingBit ManipulationBitmaskHungarian AlgorithmBipartite GraphSuccessive Shortest Path AlgorithmMatching (Graph)Minimum-Cost FlowFlow Network
#134
Rank
#2256MediumFrequency: 16.4%

Count Words Obtained After Adding a Letter

Asked at Google
ArrayHash TableStringBit ManipulationSorting
#135
Rank
#2268MediumFrequency: 16.4%

Remove All Ones With Row and Column Flips

Asked at Google
ArrayMathBit ManipulationMatrix
#136
Rank
#2314MediumFrequency: 16.4%

Remove All Ones With Row and Column Flips II

Asked at Google
ArrayBit ManipulationBreadth-First SearchMatrix
#137
Rank
#2953MediumFrequency: 16.4%

Count Pairs of Points With Distance k

Asked at Google
ArrayHash TableBit Manipulation
#138
Rank
#3364HardFrequency: 16.4%

Minimum Sum of Values by Dividing Array

Asked at Google
ArrayBinary SearchDynamic ProgrammingBit ManipulationSegment TreeQueue
#139
Rank
#980HardFrequency: 16.4%

Find the Shortest Superstring

Asked at Google
ArrayStringDynamic ProgrammingBit ManipulationBitmaskHamiltonian Path
#140
Rank
#1037HardFrequency: 16.4%

Minimum Number of K Consecutive Bit Flips

Asked at Google
ArrayBit ManipulationQueueSliding WindowPrefix SumBrute-Force Search
#141
Rank
#3348HardFrequency: 16.4%

Minimum Cost Walk in Weighted Graph

Asked at Google
ArrayBit ManipulationUnion-FindGraph Theory
#142
Rank
#693EasyFrequency: 16.4%

Binary Number with Alternating Bits

Asked at Google
Bit Manipulation
#143
Rank
#3676EasyFrequency: 16.1%

Smallest Number With All Set Bits

Asked at Microsoft
MathBit Manipulation
#144
Rank
#3611MediumFrequency: 16.1%

Construct the Minimum Bitwise Array II

Asked at Microsoft
ArrayBit Manipulation
#145
Rank
#1054EasyFrequency: 14.6%

Complement of Base 10 Integer

Asked at Google
Bit Manipulation
#146
Rank
#1786EasyFrequency: 14.6%

Count the Number of Consistent Strings

Asked at Google
ArrayHash TableStringBit ManipulationCounting
#147
Rank
#1435MediumFrequency: 14.6%

XOR Queries of a Subarray

Asked at Google
ArrayBit ManipulationPrefix Sum
#148
Rank
#2170MediumFrequency: 14.6%

Count Number of Maximum Bitwise-OR Subsets

Asked at Google
ArrayBacktrackingBit ManipulationEnumeration
#149
Rank
#3431HardFrequency: 14.6%

Find the Minimum Cost Array Permutation

Asked at Google
ArrayDynamic ProgrammingBit ManipulationBitmask
#150
Rank
#2709MediumFrequency: 14.6%

Count the Number of Square-Free Subsets

Asked at Google
ArrayMathDynamic ProgrammingBit ManipulationNumber TheoryBitmask
#151
Rank
#899EasyFrequency: 14.6%

Binary Gap

Asked at Google
Bit Manipulation
#152
Rank
#3852HardFrequency: 14.6%

Path Existence Queries in a Graph II

Asked at Google
ArrayTwo PointersBinary SearchDynamic ProgrammingGreedyBit ManipulationGraph TheorySorting
#153
Rank
#3307HardFrequency: 14.4%

Find the Maximum Sum of Node Values

Asked at Meta
ArrayDynamic ProgrammingGreedyBit ManipulationTreeSorting
#154
Rank
#2509MediumFrequency: 13.2%

Minimize XOR

Asked at Amazon
GreedyBit Manipulation
#155
Rank
#2837MediumFrequency: 13.2%

Minimum Operations to Make the Integer Zero

Asked at Amazon
Bit ManipulationBrainteaserEnumeration
#156
Rank
#1471HardFrequency: 12.6%

Maximum Students Taking Exam

Asked at Google
ArrayDynamic ProgrammingBit ManipulationMatrixBitmaskMaximum FlowMaximum MatchingBipartite GraphEdmonds–Karp AlgorithmMPM AlgorithmPush-Relabel AlgorithmMinimum CutMatching (Graph)Flow NetworkDinic's Algorithm
#157
Rank
#3744HardFrequency: 12.6%

Minimum Operations to Make Array Elements Zero

Asked at Google
ArrayMathBit Manipulation
#158
Rank
#2323EasyFrequency: 12%

Minimum Bit Flips to Convert Number

Asked at Microsoft
Bit Manipulation
#159
Rank
#3291MediumFrequency: 12%

Find if Array Can Be Sorted

Asked at Microsoft
ArrayBit ManipulationSorting
#160
Rank
#3380MediumFrequency: 11.4%

Shortest Subarray With OR at Least K II

Asked at Meta
ArrayBit ManipulationSliding Window
#161
Rank
#3428EasyFrequency: 11.4%

Find the XOR of Numbers Which Appear Twice

Asked at Meta
ArrayHash TableBit Manipulation
#162
Rank
#2503MediumFrequency: 10.5%

Longest Subarray With Maximum Bitwise AND

Asked at Google
ArrayBit ManipulationBrainteaser
#163
Rank
#3394MediumFrequency: 10.5%

Minimum Array End

Asked at Google
Bit Manipulation
#164
Rank
#3601HardFrequency: 10.5%

Find the K-th Character in String Game II

Asked at Google
MathBit ManipulationRecursion
#165
Rank
#3842HardFrequency: 10.5%

Number of Ways to Assign Edge Weights II

Asked at Google
ArrayMathDynamic ProgrammingBit ManipulationTreeDepth-First Search
#166
Rank
#3249MediumFrequency: 10.3%

Minimum Number of Operations to Make Array XOR Equal to K

Asked at Amazon
ArrayBit Manipulation
#167
Rank
#2792MediumFrequency: 10.3%

Neighboring Bitwise XOR

Asked at Amazon
ArrayBit Manipulation
#168
Rank
#3605EasyFrequency: 10.3%

Construct the Minimum Bitwise Array I

Asked at Amazon
ArrayBit Manipulation
#169
Rank
#476EasyFrequency: 8.1%

Number Complement

Asked at Google
Bit Manipulation
#170
Rank
#2356MediumFrequency: 8.1%

Largest Combination With Bitwise AND Greater Than Zero

Asked at Google
ArrayHash TableBit ManipulationCounting
#171
Rank
#3900HardFrequency: 8.1%

Find Weighted Median Node in Tree

Asked at Google
ArrayBinary SearchDynamic ProgrammingBit ManipulationTreeDepth-First Search
#172
Rank
#1881HardFrequency: 8.1%

Closest Subsequence Sum

Asked at Google
ArrayTwo PointersDynamic ProgrammingBit ManipulationMeet in the MiddleSortingBitmask
#173
Rank
#4189HardFrequency: 8.1%

Find Nth Smallest Integer With K One Bits

Asked at Google
MathBit ManipulationCombinatorics
#174
Rank
#3824MediumFrequency: 8.1%

Number of Unique XOR Triplets I

Asked at Google
ArrayMathBit Manipulation
#175
Rank
#3841HardFrequency: 8%

Concatenated Divisibility

Asked at Meta
ArrayDynamic ProgrammingBit ManipulationBitmask
#176
Rank
#2519MediumFrequency: 7.3%

Find The Original Array of Prefix Xor

Asked at Microsoft
ArrayBit Manipulation
#177
Rank
#1071EasyFrequency: 7.3%

Binary Prefix Divisible By 5

Asked at Microsoft
ArrayBit Manipulation
#178
Rank
#491MediumFrequency: 7.3%

Non-decreasing Subsequences

Asked at Microsoft
ArrayHash TableBacktrackingBit Manipulation
#179
Rank
#891MediumFrequency: 7.2%

Score After Flipping Matrix

Asked at Amazon
ArrayGreedyBit ManipulationMatrix
#180
Rank
#3820MediumFrequency: 7.2%

Number of Unique XOR Triplets II

Asked at Amazon
ArrayMathBit ManipulationEnumeration
#181
Rank
#828HardFrequency: 5.5%

Chalkboard XOR Game

Asked at Google
ArrayMathBit ManipulationBrainteaserGame TheoryZero-Sum GameImpartial Game
#182
Rank
#3579MediumFrequency: 5.5%

Maximum Possible Number by Binary Concatenation

Asked at Google
ArrayBit ManipulationEnumeration
#183
Rank
#2533MediumFrequency: 5.5%

Bitwise XOR of All Pairings

Asked at Google
ArrayBit ManipulationBrainteaser
#184
Rank
#1913HardFrequency: 5.5%

Make the XOR of All Segments Equal to Zero

Asked at Google
ArrayHash TableDynamic ProgrammingBit ManipulationCounting
#185
Rank
#3882HardFrequency: 5.5%

Partition Array for Maximum XOR and AND

Asked at Google
ArrayMathGreedyBit ManipulationEnumeration
#186
Rank
#2130MediumFrequency: 5.5%

Maximum Product of the Length of Two Palindromic Subsequences

Asked at Google
StringDynamic ProgrammingBacktrackingBit ManipulationBitmask
#187
Rank
#1610EasyFrequency: 5.5%

XOR Operation in an Array

Asked at Google
MathBit Manipulation
#188
Rank
#2659EasyFrequency: 5.5%

Number of Even and Odd Bits

Asked at Google
Bit Manipulation
#189
Rank
#1553MediumFrequency: 5%

Count Triplets That Can Form Two Arrays of Equal XOR

Asked at Google
ArrayHash TableMathBit ManipulationPrefix Sum
#190
Rank
#3560HardFrequency: 5%

Maximum Number of Moves to Kill All Pawns

Asked at Google
ArrayMathBit ManipulationBreadth-First SearchGame TheoryBitmask
#191
Rank
#3192MediumFrequency: 5%

Maximum Xor Product

Asked at Google
MathGreedyBit Manipulation
#192
Rank
#3913MediumFrequency: 5%

Partition Array to Minimize XOR

Asked at Google
ArrayDynamic ProgrammingBit ManipulationPrefix Sum
#193
Rank
#4205MediumFrequency: 5%

Minimum XOR Path in a Grid

Asked at Google
ArrayDynamic ProgrammingBit ManipulationMatrix
#194
Rank
#3930HardFrequency: 5%

Longest Palindromic Path in Graph

Asked at Google
StringDynamic ProgrammingBit ManipulationGraph TheoryBitmask
#195
Rank
#1839EasyFrequency: 5%

Decode XORed Array

Asked at Google
ArrayBit Manipulation
#196
Rank
#2114MediumFrequency: 5%

Minimum Number of Work Sessions to Finish the Tasks

Asked at Amazon
ArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask
#197
Rank
#2402MediumFrequency: 5%

Maximum XOR After Operations

Asked at Amazon
ArrayMathBit Manipulation
#198
Rank
#2705MediumFrequency: 5%

Minimum Impossible OR

Asked at Amazon
ArrayBit ManipulationBrainteaser
#199
Rank
#3843MediumFrequency: 5%

Partition Array into Two Equal Product Subsets

Asked at Meta
ArrayBit ManipulationRecursionEnumeration
#200
Rank
View All Topics

Master Bit Manipulation in Real Interviews

Get AI-powered assistance when solving bit manipulation problems during your actual interviews.

Get Started Free

No credit card required

Interview Solver
  • Home
  • About
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Developers
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Refund & Cancellation
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.