Skip to content

Commit 468f16c

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 87068c6 commit 468f16c

File tree

10 files changed

+61
-9
lines changed

10 files changed

+61
-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/)** (592 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (593 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>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Math](<markdowns/by_topic/Math.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>), [Database](<markdowns/by_topic/Database.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Graph](<markdowns/by_topic/Graph.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.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>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Math](<markdowns/by_topic/Math.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>), [Database](<markdowns/by_topic/Database.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.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>)
3737

3838
------
3939

@@ -200,6 +200,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
200200
| 475 | [Heaters](<https://leetcode.com/problems/heaters>) | Medium | | [solution](<markdowns/_475. Heaters.md>) | py |
201201
| 476 | [Number Complement](<https://leetcode.com/problems/number-complement>) | Easy | Daily | [solution](<markdowns/_476. Number Complement.md>) | py |
202202
| 480 | [Sliding Window Median](<https://leetcode.com/problems/sliding-window-median>) | Hard | | [solution](<markdowns/_480. Sliding Window Median.md>) | py |
203+
| 487 | [Max Consecutive Ones II](<https://leetcode.com/problems/max-consecutive-ones-ii>) | Medium | Weekly Premium | [solution](<markdowns/_487. Max Consecutive Ones II.md>) | py |
203204
| 502 | [IPO](<https://leetcode.com/problems/ipo>) | Hard | Daily | [solution](<markdowns/_502. IPO.md>) | py |
204205
| 503 | [Next Greater Element II](<https://leetcode.com/problems/next-greater-element-ii>) | Medium | | [solution](<markdowns/_503. Next Greater Element II.md>) | py |
205206
| 509 | [Fibonacci Number](<https://leetcode.com/problems/fibonacci-number>) | Easy | | [solution](<markdowns/_509. Fibonacci Number.md>) | c |

‎markdowns/Medium.md‎

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

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

@@ -103,6 +103,7 @@
103103
| 450 | [Delete Node in a BST](<https://leetcode.com/problems/delete-node-in-a-bst>) | Medium | | [solution](<_450. Delete Node in a BST.md>) | py | Jun 29, 2024 |
104104
| 451 | [Sort Characters By Frequency](<https://leetcode.com/problems/sort-characters-by-frequency>) | Medium | | [solution](<_451. Sort Characters By Frequency.md>) | py | Jun 18, 2024 |
105105
| 475 | [Heaters](<https://leetcode.com/problems/heaters>) | Medium | | [solution](<_475. Heaters.md>) | py | Jun 07, 2024 |
106+
| 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 |
106107
| 503 | [Next Greater Element II](<https://leetcode.com/problems/next-greater-element-ii>) | Medium | | [solution](<_503. Next Greater Element II.md>) | py | Jul 05, 2024 |
107108
| 513 | [Find Bottom Left Tree Value](<https://leetcode.com/problems/find-bottom-left-tree-value>) | Medium | | [solution](<_513. Find Bottom Left Tree Value.md>) | java | Jul 03, 2024 |
108109
| 523 | [Continuous Subarray Sum](<https://leetcode.com/problems/continuous-subarray-sum>) | Medium | Daily | [solution](<_523. Continuous Subarray Sum.md>) | py | Jun 08, 2024 |

‎markdowns/Questions_By_Code_Length.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -461,6 +461,7 @@ Calculations are based on the code files's byte sizes.
461461
| 344 | [Reverse String](<https://leetcode.com/problems/reverse-string>) | Easy | Daily | [solution](<_344. Reverse String.md>) | java, py | Jun 02, 2024 |
462462
| 2221 | [Find Triangular Sum of an Array](<https://leetcode.com/problems/find-triangular-sum-of-an-array>) | Medium | | [solution](<_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 27, 2024 |
463463
| 3239 | Biweekly Contest 136 - q2 - [Minimum Number of Flips to Make Binary Grid Palindromic I](<https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i>) | Medium | Contest | [solution](<_3239. Minimum Number of Flips to Make Binary Grid Palindromic I.md>) | py | Aug 03, 2024 |
464+
| 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 |
464465
| 1550 | [Three Consecutive Odds](<https://leetcode.com/problems/three-consecutive-odds>) | Easy | Daily | [solution](<_1550. Three Consecutive Odds.md>) | c, py | Jul 01, 2024 |
465466
| 56 | [Merge Intervals](<https://leetcode.com/problems/merge-intervals>) | Medium | B75, N150 | [solution](<_56. Merge Intervals.md>) | py | Jun 19, 2024 |
466467
| 2955 | [Number of Same-End Substrings](<https://leetcode.com/problems/number-of-same-end-substrings>) | Medium | Weekly Premium | [solution](<_2955. Number of Same-End Substrings.md>) | py | Nov 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+
| 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 |
910
| 1261 | [Find Elements in a Contaminated Binary Tree](<https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree>) | Medium | Daily | [solution](<_1261. Find Elements in a Contaminated Binary Tree.md>) | py | Feb 21, 2025 |
1011
| 1415 | [The k-th Lexicographical String of All Happy Strings of Length n](<https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n>) | Medium | Daily | [solution](<_1415. The k-th Lexicographical String of All Happy Strings of Length n.md>) | py | Feb 19, 2025 |
1112
| 942 | [DI String Match](<https://leetcode.com/problems/di-string-match>) | Easy | | [solution](<_942. DI String Match.md>) | py | Feb 18, 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>) (292 completed)
7+
- [Array](<by_topic/Array.md>) (293 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)
@@ -16,7 +16,7 @@
1616
- [Two Pointers](<by_topic/Two Pointers.md>) (56 completed)
1717
- [Stack](<by_topic/Stack.md>) (55 completed)
1818
- [Matrix](<by_topic/Matrix.md>) (52 completed)
19-
- [Dynamic Programming](<by_topic/Dynamic Programming.md>) (48 completed)
19+
- [Dynamic Programming](<by_topic/Dynamic Programming.md>) (49 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)
@@ -29,8 +29,8 @@
2929
- [Trie](<by_topic/Trie.md>) (19 completed)
3030
- [Database](<by_topic/Database.md>) (18 completed)
3131
- [Prefix Sum](<by_topic/Prefix Sum.md>) (18 completed)
32+
- [Sliding Window](<by_topic/Sliding Window.md>) (18 completed)
3233
- [Graph](<by_topic/Graph.md>) (17 completed)
33-
- [Sliding Window](<by_topic/Sliding Window.md>) (17 completed)
3434
- [Recursion](<by_topic/Recursion.md>) (16 completed)
3535
- [Binary Search Tree](<by_topic/Binary Search Tree.md>) (16 completed)
3636
- [Union Find](<by_topic/Union Find.md>) (16 completed)

0 commit comments

Comments
 (0)