Bitmask Interview Questions
40 real interview questions test Bitmask. Practice any of them in the code editor and get AI feedback on your solution.
- Mid/Senior30% (12)
- Staff70% (28)
Companies that ask Bitmask the most
Questions
- Matchsticks to Square9 companiesMid/Senior
- Partition to K Equal Sum Subsets8 companiesMid/Senior
- Partition Array Into Two Arrays to Minimize Sum Difference8 companiesStaff
- Beautiful Arrangement6 companiesMid/Senior
- Shopping Offers6 companiesMid/Senior
- Split Array With Same Average6 companiesStaff
- Find Minimum Time to Finish All Jobs5 companiesStaff
- Minimum Moves to Spread Stones Over Grid5 companiesMid/Senior
- Can I Win4 companiesMid/Senior
- Stickers to Spell Word4 companiesStaff
- Shortest Path Visiting All Nodes4 companiesStaff
- Maximum Score Words Formed by Letters4 companiesStaff
- Find the Shortest Superstring3 companiesStaff
- Number of Squareful Arrays3 companiesStaff
- Maximum Students Taking Exam3 companiesStaff
- Number of Ways to Wear Different Hats to Each Other3 companiesStaff
- Parallel Courses II3 companiesStaff
- Closest Subsequence Sum3 companiesStaff
- Minimum Number of Work Sessions to Finish the Tasks2 companiesMid/Senior
- The Number of Good Subsets2 companiesStaff
- Maximum Product of the Length of Two Palindromic Subsequences2 companiesMid/Senior
- Fair Distribution of Cookies2 companiesMid/Senior
- Count the Number of Square-Free Subsets2 companiesMid/Senior
- Maximize the Number of Partitions After Operations2 companiesStaff
- Find Sum of Array Product of Magical Sequences2 companiesStaff
- Smallest Sufficient Team1 companyStaff
- Minimum Cost to Connect Two Groups of Points1 companyStaff
- Distribute Repeating Integers1 companyStaff
- Maximize Grid Happiness1 companyStaff
- Minimum Incompatibility1 companyStaff
- Maximize Score After N Operations1 companyStaff
- Maximum Number of Groups Getting Fresh Donuts1 companyStaff
- Minimum XOR Sum of Two Arrays1 companyStaff
- Maximum Compatibility Score Sum1 companyMid/Senior
- Maximum AND Sum of Array1 companyStaff
- Find the Minimum Cost Array Permutation1 companyStaff
- Maximum Number of Moves to Kill All Pawns1 companyStaff
- Minimum Time to Break Locks I1 companyMid/Senior
- Concatenated Divisibility1 companyStaff
- Maximum Good Subtree Score1 companyStaff