LeetCode 1012: Numbers With Repeated Digits
A clear explanation of counting numbers up to n with at least one repeated digit using digit DP and combinatorics.
13 notes
A clear explanation of counting numbers up to n with at least one repeated digit using digit DP and combinatorics.
A clear guide to counting unique paths in a grid using dynamic programming.
A clear explanation of Count Unique Characters of All Substrings using contribution counting with previous and next occurrences.
A clear explanation of counting index triplets with duplicate values using frequency counts and combinatorics.
A clear explanation of counting valid music playlists using dynamic programming over playlist length and unique songs used.
A clear explanation of counting numbers less than or equal to N using digit-by-digit construction and combinatorics.
A clear explanation of summing subsequence widths by sorting and counting each element as a maximum and minimum.
A dynamic programming and combinatorics solution for counting permutations with no fixed positions.
A clear explanation of the combinatorics behind finding the minimum number of pigs needed to identify the poisonous bucket.
A clear explanation of counting numbers with unique digits using combinatorics.
A dynamic programming solution for counting ways to paint fence posts with no more than two adjacent posts sharing the same color.
Using counting, random choice, and finite structure to prove identities and existence statements.
Counting, arrangement, structure, and extremal behavior of finite and discrete systems.