Tag: bitmask
- Android Unlock Patterns
- Beautiful Arrangement
- Campus Bikes II
- Can I Win
- Closest Subsequence Sum
- Count Paths That Can Form a Palindrome in a Tree
- Count Subtrees With Max Distance Between Cities
- Count the Number of Square-Free Subsets
- Distribute Repeating Integers
- Fair Distribution of Cookies
- Find Minimum Time to Finish All Jobs
- Find the Minimum Cost Array Permutation
- Find the Shortest Superstring
- Matchsticks to Square
- Maximize Grid Happiness
- Maximize Score After N Operations
- Maximize the Number of Partitions After Operations
- Maximum AND Sum of Array
- Maximum Compatibility Score Sum
- Maximum Cost of Trip With K Highways
- Maximum Number of Groups Getting Fresh Donuts
- Maximum Number of Moves to Kill All Pawns
- Maximum Product of the Length of Two Palindromic Subsequences
- Maximum Score Words Formed by Letters
- Maximum Students Taking Exam
- Minimum Cost to Connect Two Groups of Points
- Minimum Incompatibility
- Minimum Increments for Target Multiples in an Array
- Minimum Number of Lines to Cover Points
- Minimum Number of Work Sessions to Finish the Tasks
- Minimum Time to Break Locks I
- Minimum Time to Kill All Monsters
- Minimum XOR Sum of Two Arrays
- Number of Self-Divisible Permutations
- Number of Squareful Arrays
- Number of Ways to Build Sturdy Brick Wall
- Number of Ways to Wear Different Hats to Each Other
- Optimal Account Balancing
- Parallel Courses II
- Partition Array Into Two Arrays to Minimize Sum Difference
- Partition to K Equal Sum Subsets
- Select Cells in Grid With Maximum Score
- Shopping Offers
- Shortest Path Visiting All Nodes
- Smallest Sufficient Team
- Special Permutations
- Split Array With Same Average
- Stickers to Spell Word
- The Number of Good Subsets