Digit DP problems

7 Digit DP DSA practice problems on CampusCode, each with statement, examples and constraints.

• 1233. Count Numbers with Unique Digits Hard Dynamic Programming
• 1234. Count Digit One — Numbers from 1 to N Hard Dynamic Programming
• 1235. Numbers at Most N Given Digit Set Hard Dynamic Programming
• 1236. Non-Negative Integers without Consecutive Ones Hard Dynamic Programming
• 1237. Count Special Integers Hard Dynamic Programming
• 1238. K-th Smallest in Lexicographic Order Hard Dynamic Programming
• 1365. Count Integers in Range with Popcount Condition Medium Bit Manipulation