Module Digit DP

Digit DP

**Frequency: 2/10** Digit DP problems usually ask you to count the number of numbers in a range satisfying some certain conditions. The problem statements for Digit DP typically have clear indications that the technique should be used. Hence, in a contest, it is essential to manage your time wisely when attempting Digit DP problems, as problem setters intentionally make them challenging to code. Tip: When solving problems, consider using a different number base if necessary, such as base-2, to optimize time complexity.

Resources

- [Scaler: Digit DP](https://www.scaler.com/topics/data-structures/digit-dp/)

Problems

Unlucky number 242 / 252 1300
Digit Sum 256 / 267 1400
Divisible 164 / 202 1400
Prime digit sum 178 / 189 1500
Non-palindrome number 145 / 165 1500
Yet another XOR problem 88 / 98 1600
Taboo substring 56 / 81 1700
Balanced number 32 / 37 1700
Equation 40 / 54 2100
Beautiful number 35 / 62 2100
Constructing numbers 18 / 22 2200