digit-dp | brain

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 788: Rotated Digits

Problem Restatement We are given an integer n . We need to count how many integers x in the range: 1 <= x <= n are good numbers. A number is good if, after rotating every digit by 180 degrees, we get: A valid number. A different number from the original. The valid digit rotations are: Digit Rotates to 0 0 1 1 2 5 5 2 6 9 8...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 600: Non-negative Integers without Consecutive Ones

Problem Restatement We are given a positive integer n . We need to count how many integers in the range [0, n] have binary representations that do not contain consecutive 1 bits. For example, 3 has binary representation: 11 so it is invalid. But 5 has binary representation: 101 so it is valid. Return the count of valid integers from 0 through n , inclusive. The official problem asks for...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 902: Numbers At Most N Given Digit Set

Problem Restatement We are given: A set of allowed digits as strings. An integer n . We may use the given digits any number of times to build positive integers. We need to count how many numbers are less than or equal to n . For example: digits = ["1", "3", "5", "7"] n = 100 Valid numbers include: 1, 3, 5, 7, 11, 13, 15, 17, 31, 33, ......

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 233: Number of Digit One

Problem Restatement We are given a non-negative integer n . We need to count how many times the digit: 1 appears in all integers from: 0 to n inclusive. Example: n = 13 Numbers: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 Digit 1 appears in: 1 10 11 11 12 13 Total count: 6 LeetCode examples include: Input: n = 13 Output: 6...

#digit-dp

LeetCode 788: Rotated Digits

LeetCode 600: Non-negative Integers without Consecutive Ones

LeetCode 902: Numbers At Most N Given Digit Set

LeetCode 233: Number of Digit One