update new problems

Author: 2xiao

assets/output/0001.md

@@ -147,18 +147,18 @@ time complexity?
 | 15 | 三数之和 | [[✓]](/problem/0015.md) |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/3sum) [🔗](https://leetcode.com/problems/3sum) |
 | 18 | 四数之和 | [[✓]](/problem/0018.md) |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/4sum) [🔗](https://leetcode.com/problems/4sum) |
 | 167 | 两数之和 II - 输入有序数组 | [[✓]](/problem/0167.md) |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted) [🔗](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) |
-| 170 | 两数之和 III - 数据结构设计 🔒 |  |  [`设计`](/tag/design.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum-iii-data-structure-design) [🔗](https://leetcode.com/problems/two-sum-iii-data-structure-design) |
+| 170 | 两数之和 III - 数据结构设计 🔒 | [[✓]](/problem/0170.md) |  [`设计`](/tag/design.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum-iii-data-structure-design) [🔗](https://leetcode.com/problems/two-sum-iii-data-structure-design) |
 | 560 | 和为 K 的子数组 | [[✓]](/problem/0560.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/subarray-sum-equals-k) [🔗](https://leetcode.com/problems/subarray-sum-equals-k) |
-| 653 | 两数之和 IV - 输入二叉搜索树 |  |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `4+` | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum-iv-input-is-a-bst) [🔗](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) |
+| 653 | 两数之和 IV - 输入二叉搜索树 | [[✓]](/problem/0653.md) |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `4+` | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum-iv-input-is-a-bst) [🔗](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) |
 | 1099 | 小于 K 的两数之和 🔒 |  |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`二分查找`](/tag/binary-search.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum-less-than-k) [🔗](https://leetcode.com/problems/two-sum-less-than-k) |
 | 1679 | K 和数对的最大数目 | [[✓]](/problem/1679.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/max-number-of-k-sum-pairs) [🔗](https://leetcode.com/problems/max-number-of-k-sum-pairs) |
 | 1711 | 大餐计数 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-good-meals) [🔗](https://leetcode.com/problems/count-good-meals) |
-| 2006 | 差的绝对值为 K 的数对数目 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-number-of-pairs-with-absolute-difference-k) [🔗](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k) |
+| 2006 | 差的绝对值为 K 的数对数目 | [[✓]](/problem/2006.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-number-of-pairs-with-absolute-difference-k) [🔗](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k) |
 | 2023 | 连接后等于目标字符串的字符串对 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target) [🔗](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target) |
-| 2200 | 找出数组中的所有 K 近邻下标 |  |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-all-k-distant-indices-in-an-array) [🔗](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array) |
-| 2351 | 第一个出现两次的字母 |  |  [`位运算`](/tag/bit-manipulation.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/first-letter-to-appear-twice) [🔗](https://leetcode.com/problems/first-letter-to-appear-twice) |
+| 2200 | 找出数组中的所有 K 近邻下标 | [[✓]](/problem/2200.md) |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-all-k-distant-indices-in-an-array) [🔗](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array) |
+| 2351 | 第一个出现两次的字母 | [[✓]](/problem/2351.md) |  [`位运算`](/tag/bit-manipulation.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/first-letter-to-appear-twice) [🔗](https://leetcode.com/problems/first-letter-to-appear-twice) |
 | 2354 | 优质数对的数目 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/number-of-excellent-pairs) [🔗](https://leetcode.com/problems/number-of-excellent-pairs) |
-| 2367 | 等差三元组的数目 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-arithmetic-triplets) [🔗](https://leetcode.com/problems/number-of-arithmetic-triplets) |
+| 2367 | 等差三元组的数目 | [[✓]](/problem/2367.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-arithmetic-triplets) [🔗](https://leetcode.com/problems/number-of-arithmetic-triplets) |
 | 2374 | 边积分最高的节点 |  |  [`图`](/tag/graph.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/node-with-highest-edge-score) [🔗](https://leetcode.com/problems/node-with-highest-edge-score) |
 | 2395 | 和相等的子数组 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-subarrays-with-equal-sum) [🔗](https://leetcode.com/problems/find-subarrays-with-equal-sum) |
 | 2399 | 检查相同字母间的距离 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-distances-between-same-letters) [🔗](https://leetcode.com/problems/check-distances-between-same-letters) |

assets/output/0002.md

@@ -140,9 +140,9 @@ upload/uploads/2021/01/02/addtwonumber1.jpg)
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 43 | 字符串相乘 | [[✓]](/problem/0043.md) |  [`数学`](/tag/math.md) [`字符串`](/tag/string.md) [`模拟`](/tag/simulation.md) | 🟠 | [🀄️](https://leetcode.cn/problems/multiply-strings) [🔗](https://leetcode.com/problems/multiply-strings) |
 | 67 | 二进制求和 | [[✓]](/problem/0067.md) |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/add-binary) [🔗](https://leetcode.com/problems/add-binary) |
-| 371 | 两整数之和 |  |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/sum-of-two-integers) [🔗](https://leetcode.com/problems/sum-of-two-integers) |
+| 371 | 两整数之和 | [[✓]](/problem/0371.md) |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/sum-of-two-integers) [🔗](https://leetcode.com/problems/sum-of-two-integers) |
 | 415 | 字符串相加 | [[✓]](/problem/0415.md) |  [`数学`](/tag/math.md) [`字符串`](/tag/string.md) [`模拟`](/tag/simulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/add-strings) [🔗](https://leetcode.com/problems/add-strings) |
 | 445 | 两数相加 II | [[✓]](/problem/0445.md) |  [`栈`](/tag/stack.md) [`链表`](/tag/linked-list.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/add-two-numbers-ii) [🔗](https://leetcode.com/problems/add-two-numbers-ii) |
-| 989 | 数组形式的整数加法 |  |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/add-to-array-form-of-integer) [🔗](https://leetcode.com/problems/add-to-array-form-of-integer) |
+| 989 | 数组形式的整数加法 | [[✓]](/problem/0989.md) |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/add-to-array-form-of-integer) [🔗](https://leetcode.com/problems/add-to-array-form-of-integer) |
 | 1634 | 求两个多项式链表的和 🔒 |  |  [`链表`](/tag/linked-list.md) [`数学`](/tag/math.md) [`双指针`](/tag/two-pointers.md) | 🟠 | [🀄️](https://leetcode.cn/problems/add-two-polynomials-represented-as-linked-lists) [🔗](https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists) |
 | 2816 | 翻倍以链表形式表示的数字 |  |  [`栈`](/tag/stack.md) [`链表`](/tag/linked-list.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/double-a-number-represented-as-a-linked-list) [🔗](https://leetcode.com/problems/double-a-number-represented-as-a-linked-list) |

assets/output/0003.md

@@ -142,7 +142,7 @@ repeating characters.
 | 2067 | 等计数子串的数量 🔒 |  |  [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-equal-count-substrings) [🔗](https://leetcode.com/problems/number-of-equal-count-substrings) |
 | 2260 | 必须拿起的最小连续卡牌数 | [[✓]](/problem/2260.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-consecutive-cards-to-pick-up) [🔗](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up) |
 | 2401 | 最长优雅子数组 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-nice-subarray) [🔗](https://leetcode.com/problems/longest-nice-subarray) |
-| 2405 | 子字符串的最优划分 |  |  [`贪心`](/tag/greedy.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/optimal-partition-of-string) [🔗](https://leetcode.com/problems/optimal-partition-of-string) |
+| 2405 | 子字符串的最优划分 | [[✓]](/problem/2405.md) |  [`贪心`](/tag/greedy.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/optimal-partition-of-string) [🔗](https://leetcode.com/problems/optimal-partition-of-string) |
 | 2799 | 统计完全子数组的数目 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-complete-subarrays-in-an-array) [🔗](https://leetcode.com/problems/count-complete-subarrays-in-an-array) |
 | 2981 | 找出出现至少三次的最长特殊子字符串 I |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`二分查找`](/tag/binary-search.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-i) [🔗](https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i) |
 | 2982 | 找出出现至少三次的最长特殊子字符串 II |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`二分查找`](/tag/binary-search.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-ii) [🔗](https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-ii) |

assets/output/0007.md

@@ -23,27 +23,30 @@ reversing `x` causes the value to go outside the signed 32-bit integer range
 **Assume the environment does not allow you to store 64-bit integers (signed
 or unsigned).**
 
+
+
 **Example 1:**
 
 > Input: x = 123
->
+> 
 > Output: 321
 
 **Example 2:**
 
 > Input: x = -123
->
+> 
 > Output: -321
 
 **Example 3:**
 
 > Input: x = 120
->
+> 
 > Output: 21
 
 **Constraints:**
 
-- `-2^31 <= x <= 2^31 - 1`
+  * `-231 <= x <= 231 - 1`
+
 
 ## 题目大意
 
@@ -55,31 +58,60 @@ or unsigned).**
 
 **示例 1：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = 123
->
+> 
 > **输出：** 321
+> 
+> 
 
 **示例 2：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = -123
->
+> 
 > **输出：** -321
+> 
+> 
 
 **示例 3：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = 120
->
+> 
 > **输出：** 21
+> 
+> 
 
 **示例 4：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = 0
->
+> 
 > **输出：** 0
+> 
+> 
 
 **提示：**
 
-- `-2^31 <= x <= 2^31 - 1`
+  * `-231 <= x <= 231 - 1`
+
 
 ## 解题思路
 
@@ -101,5 +133,5 @@ or unsigned).**
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 8 | 字符串转换整数 (atoi) | [[✓]](/problem/0008.md) |  [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/string-to-integer-atoi) [🔗](https://leetcode.com/problems/string-to-integer-atoi) |
 | 190 | 颠倒二进制位 | [[✓]](/problem/0190.md) |  [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-bits) [🔗](https://leetcode.com/problems/reverse-bits) |
-| 2119 | 反转两次的数字 |  |  [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/a-number-after-a-double-reversal) [🔗](https://leetcode.com/problems/a-number-after-a-double-reversal) |
-| 2442 | 反转之后不同整数的数目 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/count-number-of-distinct-integers-after-reverse-operations) [🔗](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations) |
+| 2119 | 反转两次的数字 | [[✓]](/problem/2119.md) |  [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/a-number-after-a-double-reversal) [🔗](https://leetcode.com/problems/a-number-after-a-double-reversal) |
+| 2442 | 反转之后不同整数的数目 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/count-number-of-distinct-integers-after-reverse-operations) [🔗](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations) |

assets/output/0008.md

@@ -369,4 +369,4 @@ Reading stops at the first non-digit character 'w'.
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 7 | 整数反转 | [[✓]](/problem/0007.md) |  [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/reverse-integer) [🔗](https://leetcode.com/problems/reverse-integer) |
 | 65 | 有效数字 |  |  [`字符串`](/tag/string.md) | 🔴 | [🀄️](https://leetcode.cn/problems/valid-number) [🔗](https://leetcode.com/problems/valid-number) |
-| 2042 | 检查句子中的数字是否递增 |  |  [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-numbers-are-ascending-in-a-sentence) [🔗](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence) |
+| 2042 | 检查句子中的数字是否递增 | [[✓]](/problem/2042.md) |  [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-numbers-are-ascending-in-a-sentence) [🔗](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence) |

assets/output/0009.md

@@ -19,72 +19,105 @@ keywords:
 Given an integer `x`, return `true` _if_`x` _is a_ _**palindrome**_ _,
 and_`false` _otherwise_.
 
+
+
 **Example 1:**
 
 > Input: x = 121
->
+> 
 > Output: true
->
+> 
 > Explanation: 121 reads as 121 from left to right and from right to left.
 
 **Example 2:**
 
 > Input: x = -121
->
+> 
 > Output: false
->
+> 
 > Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
 
 **Example 3:**
 
 > Input: x = 10
->
+> 
 > Output: false
->
+> 
 > Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
 
 **Constraints:**
 
-- `-2^31 <= x <= 2^31 - 1`
+  * `-231 <= x <= 231 - 1`
+
+
 
 **Follow up:** Could you solve it without converting the integer to a string?
 
+
 ## 题目大意
 
 给你一个整数 `x` ，如果 `x` 是一个回文整数，返回 `true` ；否则，返回 `false` 。
 
 回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。
 
-- 例如，`121` 是回文，而 `123` 不是。
+  * 例如，`121` 是回文，而 `123` 不是。
+
+
 
 **示例 1：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = 121
->
+> 
 > **输出：** true
+> 
+> 
 
-**示例 2：**
+**示例  2：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = -121
->
+> 
 > **输出：** false
->
+> 
 > **解释：** 从左向右读, 为 -121 。 从右向左读, 为 121- 。因此它不是一个回文数。
+> 
+> 
 
 **示例 3：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = 10
->
+> 
 > **输出：** false
->
+> 
 > **解释：** 从右向左读, 为 01 。因此它不是一个回文数。
+> 
+> 
+
+
 
 **提示：**
 
-- `-2^31 <= x <= 2^31 - 1`
+  * `-231 <= x <= 231 - 1`
+
+
 
 **进阶：** 你能不将整数转为字符串来解决这个问题吗？
 
+
 ## 解题思路
 
 #### 复杂度分析
@@ -108,4 +141,4 @@ and_`false` _otherwise_.
 | 2396 | 严格回文的数字 |  |  [`脑筋急转弯`](/tag/brainteaser.md) [`数学`](/tag/math.md) [`双指针`](/tag/two-pointers.md) | 🟠 | [🀄️](https://leetcode.cn/problems/strictly-palindromic-number) [🔗](https://leetcode.com/problems/strictly-palindromic-number) |
 | 2843 | 统计对称整数的数目 |  |  [`数学`](/tag/math.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-symmetric-integers) [🔗](https://leetcode.com/problems/count-symmetric-integers) |
 | 3260 | 找出最大的 N 位 K 回文数 |  |  [`贪心`](/tag/greedy.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/find-the-largest-palindrome-divisible-by-k) [🔗](https://leetcode.com/problems/find-the-largest-palindrome-divisible-by-k) |
-| 3272 | 统计好整数的数目 |  |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`组合数学`](/tag/combinatorics.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/find-the-count-of-good-integers) [🔗](https://leetcode.com/problems/find-the-count-of-good-integers) |
+| 3272 | 统计好整数的数目 |  |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`组合数学`](/tag/combinatorics.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/find-the-count-of-good-integers) [🔗](https://leetcode.com/problems/find-the-count-of-good-integers) |