Skip to content

Commit 0badd88

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 32aeaa8 commit 0badd88

File tree

497 files changed

+611
-509
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

497 files changed

+611
-509
lines changed

‎README.md

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (623 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (624 solved)
22

33
<!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) -->
44

@@ -33,7 +33,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
3333

3434
------
3535

36-
[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>), [Math](<markdowns/by_topic/Math.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Stack](<markdowns/by_topic/Stack.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>), [Design](<markdowns/by_topic/Design.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Counting](<markdowns/by_topic/Counting.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Trie](<markdowns/by_topic/Trie.md>), [Graph](<markdowns/by_topic/Graph.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Database](<markdowns/by_topic/Database.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.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>), [Interactive](<markdowns/by_topic/Interactive.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Segment Tree](<markdowns/by_topic/Segment Tree.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Enumeration](<markdowns/by_topic/Enumeration.md>), [Strongly Connected Component](<markdowns/by_topic/Strongly Connected Component.md>), [Probability and Statistics](<markdowns/by_topic/Probability and Statistics.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
36+
[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>), [Math](<markdowns/by_topic/Math.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Stack](<markdowns/by_topic/Stack.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>), [Design](<markdowns/by_topic/Design.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Counting](<markdowns/by_topic/Counting.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Trie](<markdowns/by_topic/Trie.md>), [Graph](<markdowns/by_topic/Graph.md>), [Database](<markdowns/by_topic/Database.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.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>), [Interactive](<markdowns/by_topic/Interactive.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Segment Tree](<markdowns/by_topic/Segment Tree.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Enumeration](<markdowns/by_topic/Enumeration.md>), [Strongly Connected Component](<markdowns/by_topic/Strongly Connected Component.md>), [Probability and Statistics](<markdowns/by_topic/Probability and Statistics.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
3737

3838
------
3939

@@ -489,6 +489,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
489489
| 1905 | [Count Sub Islands](<https://leetcode.com/problems/count-sub-islands>) | Medium | Daily | [solution](<markdowns/_1905. Count Sub Islands.md>) | py |
490490
| 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 |
491491
| 1910 | [Remove All Occurrences of a Substring](<https://leetcode.com/problems/remove-all-occurrences-of-a-substring>) | Medium | Daily | [solution](<markdowns/_1910. Remove All Occurrences of a Substring.md>) | py |
492+
| 1922 | [Count Good Numbers](<https://leetcode.com/problems/count-good-numbers>) | Medium | Daily | [solution](<markdowns/_1922. Count Good Numbers.md>) | py |
492493
| 1929 | [Concatenation of Array](<https://leetcode.com/problems/concatenation-of-array>) | Easy | | [solution](<markdowns/_1929. Concatenation of Array.md>) | c, java, py |
493494
| 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 |
494495
| 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 |

‎markdowns/Daily_Questions.md

Lines changed: 15 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -5,18 +5,19 @@
55
Dates are for the date I completed the question so due to the my time zone and how it lines up with UTC, it may be off by a day.
66

77
### April 2025
8-
| Su | Mo | Tu | We | Th | Fr | Sa |
9-
|-----:|-------------------------------------------:|---------------------------------------------------------------------------------:|-------------------------------------------------------:|-----:|---------------------------------------------:|-----:|
10-
| | | 1 | [2](<_2873. Maximum Value of an Ordered Triplet I.md>) | 3 | 4 | 5 |
11-
| 6 | [7](<_416. Partition Equal Subset Sum.md>) | [8](<_3396. Minimum Number of Operations to Make Elements in Array Distinct.md>) | 9 | 10 | [11](<_2843. Count Symmetric Integers.md>) | 12 |
12-
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
13-
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
14-
| 27 | 28 | 29 | 30 | | | |
8+
| Su | Mo | Tu | We | Th | Fr | Sa |
9+
|-------------------------------------:|-------------------------------------------:|---------------------------------------------------------------------------------:|-------------------------------------------------------:|-----:|---------------------------------------------:|-----:|
10+
| | | 1 | [2](<_2873. Maximum Value of an Ordered Triplet I.md>) | 3 | 4 | 5 |
11+
| 6 | [7](<_416. Partition Equal Subset Sum.md>) | [8](<_3396. Minimum Number of Operations to Make Elements in Array Distinct.md>) | 9 | 10 | [11](<_2843. Count Symmetric Integers.md>) | 12 |
12+
| [13](<_1922. Count Good Numbers.md>) | 14 | 15 | 16 | 17 | 18 | 19 |
13+
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
14+
| 27 | 28 | 29 | 30 | | | |
1515

1616

1717

1818
| # | Title | Level | Cats | Solution | Languages | Date Complete |
1919
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
20+
| 1922 | [Count Good Numbers](<https://leetcode.com/problems/count-good-numbers>) | Medium | Daily | [solution](<_1922. Count Good Numbers.md>) | py | Apr 13, 2025 |
2021
| 2843 | [ Count Symmetric Integers](<https://leetcode.com/problems/count-symmetric-integers>) | Easy | Daily | [solution](<_2843. Count Symmetric Integers.md>) | py | Apr 11, 2025 |
2122
| 3396 | [Minimum Number of Operations to Make Elements in Array Distinct](<https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct>) | Easy | Daily | [solution](<_3396. Minimum Number of Operations to Make Elements in Array Distinct.md>) | py | Apr 08, 2025 |
2223
| 416 | [Partition Equal Subset Sum](<https://leetcode.com/problems/partition-equal-subset-sum>) | Medium | Daily, N150 | [solution](<_416. Partition Equal Subset Sum.md>) | py | Apr 07, 2025 |
@@ -277,11 +278,11 @@ Dates are for the date I completed the question so due to the my time zone and h
277278

278279

279280
### April 2025
280-
| Su | Mo | Tu | We | Th | Fr | Sa |
281-
|-----:|-------------------------------------------:|---------------------------------------------------------------------------------:|-------------------------------------------------------:|-----:|---------------------------------------------:|-----:|
282-
| | | 1 | [2](<_2873. Maximum Value of an Ordered Triplet I.md>) | 3 | 4 | 5 |
283-
| 6 | [7](<_416. Partition Equal Subset Sum.md>) | [8](<_3396. Minimum Number of Operations to Make Elements in Array Distinct.md>) | 9 | 10 | [11](<_2843. Count Symmetric Integers.md>) | 12 |
284-
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
285-
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
286-
| 27 | 28 | 29 | 30 | | | |
281+
| Su | Mo | Tu | We | Th | Fr | Sa |
282+
|-------------------------------------:|-------------------------------------------:|---------------------------------------------------------------------------------:|-------------------------------------------------------:|-----:|---------------------------------------------:|-----:|
283+
| | | 1 | [2](<_2873. Maximum Value of an Ordered Triplet I.md>) | 3 | 4 | 5 |
284+
| 6 | [7](<_416. Partition Equal Subset Sum.md>) | [8](<_3396. Minimum Number of Operations to Make Elements in Array Distinct.md>) | 9 | 10 | [11](<_2843. Count Symmetric Integers.md>) | 12 |
285+
| [13](<_1922. Count Good Numbers.md>) | 14 | 15 | 16 | 17 | 18 | 19 |
286+
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
287+
| 27 | 28 | 29 | 30 | | | |
287288

0 commit comments

Comments
 (0)