Updated markdown files

Zanger67 · Sep 3, 2024 · a4f623b · a4f623b
1 parent 5928ac8
commit a4f623b
Show file tree

Hide file tree

Showing 448 changed files with 511 additions and 454 deletions.
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (513 solved)
+# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (514 solved)
 
 <!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) -->
 
@@ -33,7 +33,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 
 ------
 
-[Array](<markdowns/by_topic/Array.md>), [String](<markdowns/by_topic/String.md>), [Hash Table](<markdowns/by_topic/Hash Table.md>), [Depth-First Search](<markdowns/by_topic/Depth-First Search.md>), [Tree](<markdowns/by_topic/Tree.md>), [Binary Tree](<markdowns/by_topic/Binary Tree.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Math](<markdowns/by_topic/Math.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Stack](<markdowns/by_topic/Stack.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Design](<markdowns/by_topic/Design.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Counting](<markdowns/by_topic/Counting.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Database](<markdowns/by_topic/Database.md>), [Trie](<markdowns/by_topic/Trie.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Graph](<markdowns/by_topic/Graph.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Suffix Array](<markdowns/by_topic/Suffix Array.md>), [Doubly-Linked List](<markdowns/by_topic/Doubly-Linked List.md>), [Iterator](<markdowns/by_topic/Iterator.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Interactive](<markdowns/by_topic/Interactive.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Strongly Connected Component](<markdowns/by_topic/Strongly Connected Component.md>), [Probability and Statistics](<markdowns/by_topic/Probability and Statistics.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Segment Tree](<markdowns/by_topic/Segment Tree.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
+[Array](<markdowns/by_topic/Array.md>), [String](<markdowns/by_topic/String.md>), [Hash Table](<markdowns/by_topic/Hash Table.md>), [Depth-First Search](<markdowns/by_topic/Depth-First Search.md>), [Tree](<markdowns/by_topic/Tree.md>), [Binary Tree](<markdowns/by_topic/Binary Tree.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Math](<markdowns/by_topic/Math.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Stack](<markdowns/by_topic/Stack.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Design](<markdowns/by_topic/Design.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Counting](<markdowns/by_topic/Counting.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Database](<markdowns/by_topic/Database.md>), [Trie](<markdowns/by_topic/Trie.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Graph](<markdowns/by_topic/Graph.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Suffix Array](<markdowns/by_topic/Suffix Array.md>), [Doubly-Linked List](<markdowns/by_topic/Doubly-Linked List.md>), [Iterator](<markdowns/by_topic/Iterator.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Interactive](<markdowns/by_topic/Interactive.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Strongly Connected Component](<markdowns/by_topic/Strongly Connected Component.md>), [Probability and Statistics](<markdowns/by_topic/Probability and Statistics.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Segment Tree](<markdowns/by_topic/Segment Tree.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
 
 ------
 
@@ -423,6 +423,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 | 1909 | [Remove One Element to Make the Array Strictly Increasing](<https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing>)                                       | Easy    |                | [solution](<markdowns/_1909. Remove One Element to Make the Array Strictly Increasing.md>)                    | c                                           |
 | 1929 | [Concatenation of Array](<https://leetcode.com/problems/concatenation-of-array>)                                                                                                           | Easy    |                | [solution](<markdowns/_1929. Concatenation of Array.md>)                                                      | c, java, py                                 |
 | 1940 | [Longest Common Subsequence Between Sorted Arrays](<https://leetcode.com/problems/longest-common-subsequence-between-sorted-arrays>)                                                       | Medium  | Weekly Premium | [solution](<markdowns/_1940. Longest Common Subsequence Between Sorted Arrays.md>)                            | java, py                                    |
+| 1945 | [Sum of Digits of String After Convert](<https://leetcode.com/problems/sum-of-digits-of-string-after-convert>)                                                                             | Easy    | Daily          | [solution](<markdowns/_1945. Sum of Digits of String After Convert.md>)                                       | py                                          |
 | 1973 | [Count Nodes Equal to Sum of Descendants](<https://leetcode.com/problems/count-nodes-equal-to-sum-of-descendants>)                                                                         | Medium  |                | [solution](<markdowns/_1973. Count Nodes Equal to Sum of Descendants.md>)                                     | c                                           |
 | 1980 | [Find Unique Binary String](<https://leetcode.com/problems/find-unique-binary-string>)                                                                                                     | Medium  |                | [solution](<markdowns/_1980. Find Unique Binary String.md>)                                                   | c, py                                       |
 | 1992 | [Find All Groups of Farmland](<https://leetcode.com/problems/find-all-groups-of-farmland>)                                                                                                 | Medium  |                | [solution](<markdowns/_1992. Find All Groups of Farmland.md>)                                                 | java, py                                    |

diff --git a/markdowns/Daily_Questions.md b/markdowns/Daily_Questions.md
@@ -6,6 +6,7 @@ Dates are for the date I completed the question so due to the my time zone and h
 
 |    # | Title                                                                                                                                                                                      | Level   | Cats        | Solution                                                                                            | Languages                    | Date Complete   |
 |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
+| 1945 | [Sum of Digits of String After Convert](<https://leetcode.com/problems/sum-of-digits-of-string-after-convert>)                                                                             | Easy    | Daily       | [solution](<_1945. Sum of Digits of String After Convert.md>)                                       | py                           | Sep 03, 2024    |
 | 1905 | [Count Sub Islands](<https://leetcode.com/problems/count-sub-islands>)                                                                                                                     | Medium  | Daily       | [solution](<_1905. Count Sub Islands.md>)                                                           | py                           | Aug 28, 2024    |
 |  590 | [N-ary Tree Postorder Traversal](<https://leetcode.com/problems/n-ary-tree-postorder-traversal>)                                                                                           | Easy    | Daily       | [solution](<_590. N-ary Tree Postorder Traversal.md>)                                               | py                           | Aug 26, 2024    |
 |  145 | [Binary Tree Postorder Traversal](<https://leetcode.com/problems/binary-tree-postorder-traversal>)                                                                                         | Easy    | Daily       | [solution](<_145. Binary Tree Postorder Traversal.md>)                                              | py                           | Aug 25, 2024    |

diff --git a/markdowns/Easy.md b/markdowns/Easy.md
@@ -1,4 +1,4 @@
-# Easy Questions (152)
+# Easy Questions (153)
 
 *[Back to top](<../README.md>)*
 
@@ -113,6 +113,7 @@
 | 1844 | [Replace All Digits with Characters](<https://leetcode.com/problems/replace-all-digits-with-characters>)                                                           | Easy    |             | [solution](<_1844. Replace All Digits with Characters.md>)                              | py                           | Jun 29, 2024    |
 | 1909 | [Remove One Element to Make the Array Strictly Increasing](<https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing>)               | Easy    |             | [solution](<_1909. Remove One Element to Make the Array Strictly Increasing.md>)        | c                            | Jun 17, 2024    |
 | 1929 | [Concatenation of Array](<https://leetcode.com/problems/concatenation-of-array>)                                                                                   | Easy    |             | [solution](<_1929. Concatenation of Array.md>)                                          | c, java, py                  | Jun 03, 2024    |
+| 1945 | [Sum of Digits of String After Convert](<https://leetcode.com/problems/sum-of-digits-of-string-after-convert>)                                                     | Easy    | Daily       | [solution](<_1945. Sum of Digits of String After Convert.md>)                           | py                           | Sep 03, 2024    |
 | 2011 | [Final Value of Variable After Performing Operations](<https://leetcode.com/problems/final-value-of-variable-after-performing-operations>)                         | Easy    |             | [solution](<_2011. Final Value of Variable After Performing Operations.md>)             | c                            | Jun 03, 2024    |
 | 2037 | [Minimum Number of Moves to Seat Everyone](<https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone>)                                               | Easy    | Daily       | [solution](<_2037. Minimum Number of Moves to Seat Everyone.md>)                        | c, py                        | Jun 03, 2024    |
 | 2053 | [Kth Distinct String in an Array](<https://leetcode.com/problems/kth-distinct-string-in-an-array>)                                                                 | Easy    | Daily       | [solution](<_2053. Kth Distinct String in an Array.md>)                                 | py                           | Aug 05, 2024    |

diff --git a/markdowns/Questions_By_Code_Length.md b/markdowns/Questions_By_Code_Length.md
@@ -387,6 +387,7 @@ Calculations are based on the code files's byte sizes.
 |  235 | [Lowest Common Ancestor of a Binary Search Tree](<https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree>)                                                           | Medium  | B75, N150      | [solution](<_235. Lowest Common Ancestor of a Binary Search Tree.md>)                               | py                                          | Jul 04, 2024    |
 | 3192 | [Minimum Operations to Make Binary Array Elements Equal to One II](<https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii>)                       | Medium  |                | [solution](<_3192. Minimum Operations to Make Binary Array Elements Equal to One II.md>)            | java                                        | Jun 22, 2024    |
 | 1046 | [Last Stone Weight](<https://leetcode.com/problems/last-stone-weight>)                                                                                                                     | Easy    | N150           | [solution](<_1046. Last Stone Weight.md>)                                                           | py                                          | Jun 04, 2024    |
+| 1945 | [Sum of Digits of String After Convert](<https://leetcode.com/problems/sum-of-digits-of-string-after-convert>)                                                                             | Easy    | Daily          | [solution](<_1945. Sum of Digits of String After Convert.md>)                                       | py                                          | Sep 03, 2024    |
 | 1736 | [Latest Time by Replacing Hidden Digits](<https://leetcode.com/problems/latest-time-by-replacing-hidden-digits>)                                                                           | Easy    |                | [solution](<_1736. Latest Time by Replacing Hidden Digits.md>)                                      | c                                           | Jun 03, 2024    |
 |  650 | [2 Keys Keyboard](<https://leetcode.com/problems/2-keys-keyboard>)                                                                                                                         | Medium  | Daily          | [solution](<_650. 2 Keys Keyboard.md>)                                                              | py                                          | Aug 19, 2024    |
 |  260 | [Single Number III](<https://leetcode.com/problems/single-number-iii>)                                                                                                                     | Medium  |                | [solution](<_260. Single Number III.md>)                                                            | py                                          | Jun 08, 2024    |

diff --git a/markdowns/Questions_By_Recent.md b/markdowns/Questions_By_Recent.md
@@ -6,6 +6,7 @@ Calculations are based on the date of the first solve.
 
 |    # | Title                                                                                                                                                                                      | Level   | Cats           | Solution                                                                                            | Languages                                   | Date Complete   |
 |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:--------------------------------------------|:----------------|
+| 1945 | [Sum of Digits of String After Convert](<https://leetcode.com/problems/sum-of-digits-of-string-after-convert>)                                                                             | Easy    | Daily          | [solution](<_1945. Sum of Digits of String After Convert.md>)                                       | py                                          | Sep 03, 2024    |
 |   83 | [Remove Duplicates from Sorted List](<https://leetcode.com/problems/remove-duplicates-from-sorted-list>)                                                                                   | Easy    |                | [solution](<_83. Remove Duplicates from Sorted List.md>)                                            | py                                          | Aug 30, 2024    |
 |  636 | [Exclusive Time of Functions](<https://leetcode.com/problems/exclusive-time-of-functions>)                                                                                                 | Medium  |                | [solution](<_636. Exclusive Time of Functions.md>)                                                  | py                                          | Aug 28, 2024    |
 |  590 | [N-ary Tree Postorder Traversal](<https://leetcode.com/problems/n-ary-tree-postorder-traversal>)                                                                                           | Easy    | Daily          | [solution](<_590. N-ary Tree Postorder Traversal.md>)                                               | py                                          | Aug 26, 2024    |