Skip to content

Commit 13caea8

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent e7e7dc0 commit 13caea8

File tree

9 files changed

+85
-9
lines changed

9 files changed

+85
-9
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/)** (595 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (596 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>), [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>), [Matrix](<markdowns/by_topic/Matrix.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.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>), [Trie](<markdowns/by_topic/Trie.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Database](<markdowns/by_topic/Database.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Graph](<markdowns/by_topic/Graph.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.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>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.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>), [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>), [Number Theory](<markdowns/by_topic/Number Theory.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>), [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>), [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>), [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>), [Trie](<markdowns/by_topic/Trie.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Database](<markdowns/by_topic/Database.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Graph](<markdowns/by_topic/Graph.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Union Find](<markdowns/by_topic/Union Find.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>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.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>), [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>), [Number Theory](<markdowns/by_topic/Number Theory.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>), [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

@@ -70,6 +70,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
7070
| 48 | [Rotate Image](<https://leetcode.com/problems/rotate-image>) | Medium | B75, N150 | [solution](<markdowns/_48. Rotate Image.md>) | c, py |
7171
| 49 | [Group Anagrams](<https://leetcode.com/problems/group-anagrams>) | Medium | B75, N150 | [solution](<markdowns/_49. Group Anagrams.md>) | py |
7272
| 50 | [Pow(x, n)](<https://leetcode.com/problems/powx-n>) | Medium | N150 | [solution](<markdowns/_50. Pow(x, n).md>) | c, java, py |
73+
| 53 | [Maximum Subarray](<https://leetcode.com/problems/maximum-subarray>) | Medium | B75, N150 | [solution](<markdowns/_53. Maximum Subarray.md>) | py |
7374
| 54 | [Spiral Matrix](<https://leetcode.com/problems/spiral-matrix>) | Medium | B75, N150 | [solution](<markdowns/_54. Spiral Matrix.md>) | py |
7475
| 56 | [Merge Intervals](<https://leetcode.com/problems/merge-intervals>) | Medium | B75, N150 | [solution](<markdowns/_56. Merge Intervals.md>) | py |
7576
| 57 | [Insert Interval](<https://leetcode.com/problems/insert-interval>) | Medium | B75, N150 | [solution](<markdowns/_57. Insert Interval.md>) | py |

‎markdowns/Medium.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Medium Questions (386)
1+
# Medium Questions (387)
22

33
*[Back to top](<../README.md>)*
44

@@ -23,6 +23,7 @@
2323
| 48 | [Rotate Image](<https://leetcode.com/problems/rotate-image>) | Medium | B75, N150 | [solution](<_48. Rotate Image.md>) | c, py | Jun 15, 2024 |
2424
| 49 | [Group Anagrams](<https://leetcode.com/problems/group-anagrams>) | Medium | B75, N150 | [solution](<_49. Group Anagrams.md>) | py | Jun 13, 2024 |
2525
| 50 | [Pow(x, n)](<https://leetcode.com/problems/powx-n>) | Medium | N150 | [solution](<_50. Pow(x, n).md>) | c, java, py | Jun 23, 2024 |
26+
| 53 | [Maximum Subarray](<https://leetcode.com/problems/maximum-subarray>) | Medium | B75, N150 | [solution](<_53. Maximum Subarray.md>) | py | Feb 26, 2025 |
2627
| 54 | [Spiral Matrix](<https://leetcode.com/problems/spiral-matrix>) | Medium | B75, N150 | [solution](<_54. Spiral Matrix.md>) | py | Oct 24, 2024 |
2728
| 56 | [Merge Intervals](<https://leetcode.com/problems/merge-intervals>) | Medium | B75, N150 | [solution](<_56. Merge Intervals.md>) | py | Jun 19, 2024 |
2829
| 57 | [Insert Interval](<https://leetcode.com/problems/insert-interval>) | Medium | B75, N150 | [solution](<_57. Insert Interval.md>) | py | Jun 19, 2024 |

‎markdowns/Questions_By_Code_Length.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -393,6 +393,7 @@ Calculations are based on the code files's byte sizes.
393393
| 2629 | [Function Composition](<https://leetcode.com/problems/function-composition>) | Easy | | [solution](<_2629. Function Composition.md>) | js | Jul 09, 2024 |
394394
| 1429 | [First Unique Number](<https://leetcode.com/problems/first-unique-number>) | Medium | | [solution](<_1429. First Unique Number.md>) | py | Oct 26, 2024 |
395395
| 110 | [Balanced Binary Tree](<https://leetcode.com/problems/balanced-binary-tree>) | Easy | N150 | [solution](<_110. Balanced Binary Tree.md>) | py | Jul 04, 2024 |
396+
| 53 | [Maximum Subarray](<https://leetcode.com/problems/maximum-subarray>) | Medium | B75, N150 | [solution](<_53. Maximum Subarray.md>) | py | Feb 26, 2025 |
396397
| 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 |
397398
| 1038 | [Binary Search Tree to Greater Sum Tree](<https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree>) | Medium | Daily | [solution](<_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 26, 2024 |
398399
| 369 | [Plus One Linked List](<https://leetcode.com/problems/plus-one-linked-list>) | Medium | | [solution](<_369. Plus One Linked List.md>) | c | Jul 04, 2024 |

‎markdowns/Questions_By_Recent.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,7 @@ Calculations are based on the date of the first solve.
66

77
| # | Title | Level | Cats | Solution | Languages | Date Complete |
88
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:--------------------------|:----------------------------------------------------------------------------------------------------|:--------------------------------------------|:----------------|
9+
| 53 | [Maximum Subarray](<https://leetcode.com/problems/maximum-subarray>) | Medium | B75, N150 | [solution](<_53. Maximum Subarray.md>) | py | Feb 26, 2025 |
910
| 1524 | [Number of Sub-arrays With Odd Sum](<https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum>) | Medium | Daily | [solution](<_1524. Number of Sub-arrays With Odd Sum.md>) | py | Feb 26, 2025 |
1011
| 1749 | [Maximum Absolute Sum of Any Subarray](<https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray>) | Medium | Daily | [solution](<_1749. Maximum Absolute Sum of Any Subarray.md>) | py | Feb 26, 2025 |
1112
| 487 | [Max Consecutive Ones II](<https://leetcode.com/problems/max-consecutive-ones-ii>) | Medium | Weekly Premium | [solution](<_487. Max Consecutive Ones II.md>) | py | Feb 22, 2025 |

‎markdowns/Topics.md‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
------
66

7-
- [Array](<by_topic/Array.md>) (295 completed)
7+
- [Array](<by_topic/Array.md>) (296 completed)
88
- [String](<by_topic/String.md>) (137 completed)
99
- [Hash Table](<by_topic/Hash Table.md>) (133 completed)
1010
- [Depth-First Search](<by_topic/Depth-First Search.md>) (102 completed)
@@ -15,8 +15,8 @@
1515
- [Breadth-First Search](<by_topic/Breadth-First Search.md>) (70 completed)
1616
- [Two Pointers](<by_topic/Two Pointers.md>) (56 completed)
1717
- [Stack](<by_topic/Stack.md>) (55 completed)
18+
- [Dynamic Programming](<by_topic/Dynamic Programming.md>) (52 completed)
1819
- [Matrix](<by_topic/Matrix.md>) (52 completed)
19-
- [Dynamic Programming](<by_topic/Dynamic Programming.md>) (51 completed)
2020
- [Greedy](<by_topic/Greedy.md>) (48 completed)
2121
- [Linked List](<by_topic/Linked List.md>) (45 completed)
2222
- [Simulation](<by_topic/Simulation.md>) (40 completed)
@@ -36,8 +36,8 @@
3636
- [Union Find](<by_topic/Union Find.md>) (16 completed)
3737
- [Queue](<by_topic/Queue.md>) (14 completed)
3838
- [Monotonic Stack](<by_topic/Monotonic Stack.md>) (11 completed)
39+
- [Divide and Conquer](<by_topic/Divide and Conquer.md>) (8 completed)
3940
- [String Matching](<by_topic/String Matching.md>) (8 completed)
40-
- [Divide and Conquer](<by_topic/Divide and Conquer.md>) (7 completed)
4141
- [Shortest Path](<by_topic/Shortest Path.md>) (7 completed)
4242
- [Counting Sort](<by_topic/Counting Sort.md>) (6 completed)
4343
- [Hash Function](<by_topic/Hash Function.md>) (6 completed)

0 commit comments

Comments
 (0)