Limited time offer: use code Use code for 50% offSee plans

Bitmask Problems

47 Bitmask LeetCode problems · Solve with AI-powered hints & step-by-step explanations.

Learn the coding interview patterns behind these problems.

Start with these

3615 Longest Palindromic Path in Graph Hard

All Bitmask problems

464 Can I Win Medium 473 Matchsticks to Square Medium 526 Beautiful Arrangement Medium 638 Shopping Offers Medium 691 Stickers to Spell Word Hard 698 Partition to K Equal Sum Subsets Medium 805 Split Array With Same Average Hard 847 Shortest Path Visiting All Nodes Hard 943 Find the Shortest Superstring Hard 996 Number of Squareful Arrays Hard 1125 Smallest Sufficient Team Hard 1255 Maximum Score Words Formed by Letters Hard 1349 Maximum Students Taking Exam Hard 1434 Number of Ways to Wear Different Hats to Each Other Hard 1494 Parallel Courses II Hard 1595 Minimum Cost to Connect Two Groups of Points Hard 1617 Count Subtrees With Max Distance Between Cities Hard 1655 Distribute Repeating Integers Hard 1659 Maximize Grid Happiness Hard 1681 Minimum Incompatibility Hard 1723 Find Minimum Time to Finish All Jobs Hard 1755 Closest Subsequence Sum Hard 1799 Maximize Score After N Operations Hard 1815 Maximum Number of Groups Getting Fresh Donuts Hard 1879 Minimum XOR Sum of Two Arrays 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 2035 Partition Array Into Two Arrays to Minimize Sum Difference Hard 2172 Maximum AND Sum of Array Hard 2305 Fair Distribution of Cookies Medium 2572 Count the Number of Square-Free Subsets Medium 2741 Special Permutations Medium 2791 Count Paths That Can Form a Palindrome in a Tree Hard 3003 Maximize the Number of Partitions After Operations Hard 3149 Find the Minimum Cost Array Permutation Hard 3276 Select Cells in Grid With Maximum Score Hard 3283 Maximum Number of Moves to Kill All Pawns Hard 3376 Minimum Time to Break Locks I Medium 3444 Minimum Increments for Target Multiples in an Array Hard 3530 Maximum Profit from Valid Topological Order in DAG Hard 3533 Concatenated Divisibility Hard 3539 Find Sum of Array Product of Magical Sequences Hard 3575 Maximum Good Subtree Score Hard 3594 Minimum Time to Transport All Individuals Hard 3615 Longest Palindromic Path in Graph Hard

← Browse all LeetCode problems