Bitmask DP problems

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

1225. Travelling Salesman Problem (TSP) Hard Dynamic Programming
1226. Minimum Cost to Visit Every Node Hard Dynamic Programming
1227. Shortest Path Visiting All Nodes (BFS + Bitmask) Hard Dynamic Programming
1228. Partition Into Two Arrays to Minimize Sum Difference Hard Dynamic Programming
1229. Count Ways to Assign Tasks to Workers Hard Dynamic Programming
1230. Maximum AND Sum of Array Hard Dynamic Programming
1231. Beautiful Arrangement — Count Permutations Hard Dynamic Programming
1232. Number of Ways to Paint N x 3 Grid Hard Dynamic Programming
1260. Minimum Number of Work Sessions Hard Dynamic Programming
1330. Beautiful Arrangement — Bitmask Backtracking Medium Bit Manipulation
1343. Count Numbers with Unique Digits (Bitmask DP) Medium Bit Manipulation
1345. Stickers to Spell Word — Bitmask DP Medium Bit Manipulation
1346. Count Ways to Distribute Candies Medium Bit Manipulation
1347. Count Strings Without Consecutive 1s Medium Bit Manipulation
1348. Number of Squareful Arrays (Bitmask) Medium Bit Manipulation
1349. Minimum Cost to Visit Every Node (Bitmask TSP) Medium Bit Manipulation
1350. Find Minimum Time to Finish All Jobs Medium Bit Manipulation
1351. Distribute Repeating Integers (Bitmask DP) Medium Bit Manipulation
1372. Travelling Salesman — Classic Bitmask DP Hard Bit Manipulation
1373. Assignment Problem — Min Cost Bitmask DP Hard Bit Manipulation
1374. Cover All Nodes with Minimum Edges (Bitmask) Hard Bit Manipulation
1375. Minimum XOR Sum of Two Arrays Hard Bit Manipulation
1376. Minimum Number of Work Sessions (Bitmask) Hard Bit Manipulation
1377. Maximum Students Taking Exam Hard Bit Manipulation
1378. Can I Win (Bitmask Game DP) Hard Bit Manipulation
1380. Matching with Weighted Bipartite Graph Hard Bit Manipulation
1383. Shortest Path Visiting All Nodes Hard Bit Manipulation
1384. Count Ways to Assign Tasks — K Workers Hard Bit Manipulation