Skip to content

Commit 3beeb23

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent ff51b59 commit 3beeb23

9 files changed

+101
-7
lines changed

‎README.md

+3-2
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (598 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (599 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>), [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>)
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>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Database](<markdowns/by_topic/Database.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

@@ -339,6 +339,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
339339
| 1122 | [Relative Sort Array](<https://leetcode.com/problems/relative-sort-array>) | Easy | Daily | [solution](<markdowns/_1122. Relative Sort Array.md>) | java, py |
340340
| 1133 | [Largest Unique Number](<https://leetcode.com/problems/largest-unique-number>) | Easy | Weekly Premium | [solution](<markdowns/_1133. Largest Unique Number.md>) | py |
341341
| 1140 | [Stone Game II](<https://leetcode.com/problems/stone-game-ii>) | Medium | Daily | [solution](<markdowns/_1140. Stone Game II.md>) | py |
342+
| 1151 | [Minimum Swaps to Group All 1's Together](<https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together>) | Medium | Weekly Premium | [solution](<markdowns/_1151. Minimum Swaps to Group All 1's Together.md>) | py |
342343
| 1160 | [Find Words That Can Be Formed by Characters](<https://leetcode.com/problems/find-words-that-can-be-formed-by-characters>) | Easy | | [solution](<markdowns/_1160. Find Words That Can Be Formed by Characters.md>) | py |
343344
| 1161 | [Maximum Level Sum of a Binary Tree](<https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree>) | Medium | | [solution](<markdowns/_1161. Maximum Level Sum of a Binary Tree.md>) | py |
344345
| 1166 | [Design File System](<https://leetcode.com/problems/design-file-system>) | Medium | | [solution](<markdowns/_1166. Design File System.md>) | py |

‎markdowns/Medium.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Medium Questions (387)
1+
# Medium Questions (388)
22

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

@@ -194,6 +194,7 @@
194194
| 1105 | [Filling Bookcase Shelves](<https://leetcode.com/problems/filling-bookcase-shelves>) | Medium | Daily | [solution](<_1105. Filling Bookcase Shelves.md>) | py | Jul 31, 2024 |
195195
| 1110 | [Delete Nodes And Return Forest](<https://leetcode.com/problems/delete-nodes-and-return-forest>) | Medium | Daily | [solution](<_1110. Delete Nodes And Return Forest.md>) | py | Jul 17, 2024 |
196196
| 1140 | [Stone Game II](<https://leetcode.com/problems/stone-game-ii>) | Medium | Daily | [solution](<_1140. Stone Game II.md>) | py | Aug 20, 2024 |
197+
| 1151 | [Minimum Swaps to Group All 1's Together](<https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together>) | Medium | Weekly Premium | [solution](<_1151. Minimum Swaps to Group All 1's Together.md>) | py | Mar 01, 2025 |
197198
| 1161 | [Maximum Level Sum of a Binary Tree](<https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree>) | Medium | | [solution](<_1161. Maximum Level Sum of a Binary Tree.md>) | py | Jul 17, 2024 |
198199
| 1166 | [Design File System](<https://leetcode.com/problems/design-file-system>) | Medium | | [solution](<_1166. Design File System.md>) | py | Jun 28, 2024 |
199200
| 1171 | [Remove Zero Sum Consecutive Nodes from Linked List](<https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list>) | Medium | | [solution](<_1171. Remove Zero Sum Consecutive Nodes from Linked List.md>) | py | Jun 15, 2024 |

‎markdowns/Questions_By_Code_Length.md

+1
Original file line numberDiff line numberDiff line change
@@ -198,6 +198,7 @@ Calculations are based on the code files's byte sizes.
198198
| 1265 | [Print Immutable Linked List in Reverse](<https://leetcode.com/problems/print-immutable-linked-list-in-reverse>) | Medium | | [solution](<_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 |
199199
| 251 | [Flatten 2D Vector](<https://leetcode.com/problems/flatten-2d-vector>) | Medium | | [solution](<_251. Flatten 2D Vector.md>) | py | May 22, 2024 |
200200
| 236 | [Lowest Common Ancestor of a Binary Tree](<https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree>) | Medium | B75 | [solution](<_236. Lowest Common Ancestor of a Binary Tree.md>) | py | Jul 15, 2024 |
201+
| 1151 | [Minimum Swaps to Group All 1's Together](<https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together>) | Medium | Weekly Premium | [solution](<_1151. Minimum Swaps to Group All 1's Together.md>) | py | Mar 01, 2025 |
201202
| 684 | [Redundant Connection](<https://leetcode.com/problems/redundant-connection>) | Medium | Daily, N150 | [solution](<_684. Redundant Connection.md>) | py | Jan 29, 2025 |
202203
| 1634 | [Add Two Polynomials Represented as Linked Lists](<https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists>) | Medium | Weekly Premium | [solution](<_1634. Add Two Polynomials Represented as Linked Lists.md>) | py | Sep 06, 2024 |
203204
| 409 | [Longest Palindrome](<https://leetcode.com/problems/longest-palindrome>) | Easy | Daily | [solution](<_409. Longest Palindrome.md>) | c, py | Jun 04, 2024 |

‎markdowns/Questions_By_Recent.md

+1
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+
| 1151 | [Minimum Swaps to Group All 1's Together](<https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together>) | Medium | Weekly Premium | [solution](<_1151. Minimum Swaps to Group All 1's Together.md>) | py | Mar 01, 2025 |
910
| 2460 | [Apply Operations to an Array](<https://leetcode.com/problems/apply-operations-to-an-array>) | Easy | Daily | [solution](<_2460. Apply Operations to an Array.md>) | py | Mar 01, 2025 |
1011
| 1092 | [Shortest Common Supersequence ](<https://leetcode.com/problems/shortest-common-supersequence>) | Hard | Daily | [solution](<_1092. Shortest Common Supersequence .md>) | py | Feb 28, 2025 |
1112
| 53 | [Maximum Subarray](<https://leetcode.com/problems/maximum-subarray>) | Medium | B75, N150 | [solution](<_53. Maximum Subarray.md>) | py | Feb 26, 2025 |

‎markdowns/Topics.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
------
66

7-
- [Array](<by_topic/Array.md>) (297 completed)
7+
- [Array](<by_topic/Array.md>) (298 completed)
88
- [String](<by_topic/String.md>) (138 completed)
99
- [Hash Table](<by_topic/Hash Table.md>) (133 completed)
1010
- [Depth-First Search](<by_topic/Depth-First Search.md>) (102 completed)
@@ -28,8 +28,8 @@
2828
- [Heap (Priority Queue)](<by_topic/Heap (Priority Queue).md>) (26 completed)
2929
- [Trie](<by_topic/Trie.md>) (19 completed)
3030
- [Prefix Sum](<by_topic/Prefix Sum.md>) (19 completed)
31+
- [Sliding Window](<by_topic/Sliding Window.md>) (19 completed)
3132
- [Database](<by_topic/Database.md>) (18 completed)
32-
- [Sliding Window](<by_topic/Sliding Window.md>) (18 completed)
3333
- [Graph](<by_topic/Graph.md>) (17 completed)
3434
- [Recursion](<by_topic/Recursion.md>) (16 completed)
3535
- [Binary Search Tree](<by_topic/Binary Search Tree.md>) (16 completed)

0 commit comments

Comments
 (0)