Combinatorics problems

11 Combinatorics DSA practice problems on CampusCode, each with statement, examples and constraints.

• 941. All Possible Full Binary Trees (Count) Hard Trees
• 944. Number of Ways to Reorder Array as BST Hard Trees
• 1130. Number of Ways to Reach a Position After K Steps Easy Dynamic Programming
• 1135. Unique Paths in Grid Easy Dynamic Programming
• 1140. Count All Paths from Top-Left to Bottom-Right Easy Dynamic Programming
• 1233. Count Numbers with Unique Digits Hard Dynamic Programming
• 1343. Count Numbers with Unique Digits (Bitmask DP) Medium Bit Manipulation
• 1346. Count Ways to Distribute Candies Medium Bit Manipulation
• 1365. Count Integers in Range with Popcount Condition Medium Bit Manipulation
• 1381. Count All Valid Pickup Delivery Orders Hard Bit Manipulation
• 1404. Broken Necklace — Bitmask Circular DP Hard Bit Manipulation