Bitmask problems

21 Bitmask DSA practice problems on CampusCode, each with statement, examples and constraints.

• 558. Smallest Sufficient Team (Bitmask DP) Hard Binary Search
• 561. Minimum Number of Work Sessions to Finish the Tasks Hard Binary Search
• 650. Minimum Number of Flips to Convert Binary Matrix to Zero Medium Stack
• 682. Maximum Points in an Archery Competition Hard Stack
• 933. Pseudo-Palindromic Paths in Binary Tree Medium Trees
• 1059. Shortest Path Visiting All Nodes (Bitmask BFS) Medium Graphs
• 1107. Hamiltonian Path Existence (Bitmask DP) Hard Graphs
• 1108. Travelling Salesman Problem (Bitmask DP) Hard Graphs
• 1109. Count Hamiltonian Paths in DAG (Bitmask DP) Hard Graphs
• 1111. General Graph Maximum Matching Hard Graphs
• 1324. Number of Valid Words for Each Puzzle Easy Bit Manipulation
• 1325. Subsets Generation Using Bitmask Medium Bit Manipulation
• 1326. Check if a Set is a Subset of Another Medium Bit Manipulation
• 1327. Count Subsets with Given XOR Medium Bit Manipulation
• 1328. Count Subsets with Given AND Value Medium Bit Manipulation
• 1329. Power Set Using Bitmask Medium Bit Manipulation
• 1331. Partition Array into Two Subsets with Min Diff Medium Bit Manipulation
• 1344. Partition Into Two Arrays to Minimize Sum Diff Medium Bit Manipulation
• 1401. SOS DP — Sum Over Subsets Using Bitmask Hard Bit Manipulation
• 1402. Inclusion-Exclusion via Bitmask Hard Bit Manipulation
• 1403. Profile Dynamic Programming on Grid (Bitmask) Hard Bit Manipulation