Skip to content

Commit 580ba46

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 906efae commit 580ba46

11 files changed

+134
-47
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/)** (621 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (622 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>), [Recursion](<markdowns/by_topic/Recursion.md>), [Database](<markdowns/by_topic/Database.md>), [Graph](<markdowns/by_topic/Graph.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>), [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>), [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>), [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>), [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

@@ -165,6 +165,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
165165
| 314 | [Binary Tree Vertical Order Traversal](<https://leetcode.com/problems/binary-tree-vertical-order-traversal>) | Medium | | [solution](<markdowns/_314. Binary Tree Vertical Order Traversal.md>) | py |
166166
| 320 | [Generalized Abbreviation](<https://leetcode.com/problems/generalized-abbreviation>) | Medium | Weekly Premium | [solution](<markdowns/_320. Generalized Abbreviation.md>) | py |
167167
| 322 | [Coin Change](<https://leetcode.com/problems/coin-change>) | Medium | B75, N150 | [solution](<markdowns/_322. Coin Change.md>) | py |
168+
| 323 | [Number of Connected Components in an Undirected Graph](<https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph>) | Medium | B75, N150, Weekly Premium | [solution](<markdowns/_323. Number of Connected Components in an Undirected Graph.md>) | py |
168169
| 326 | [Power of Three](<https://leetcode.com/problems/power-of-three>) | Easy | | [solution](<markdowns/_326. Power of Three.md>) | py |
169170
| 328 | [Odd Even Linked List](<https://leetcode.com/problems/odd-even-linked-list>) | Medium | | [solution](<markdowns/_328. Odd Even Linked List.md>) | py |
170171
| 330 | [Patching Array](<https://leetcode.com/problems/patching-array>) | Hard | Daily | [solution](<markdowns/_330. Patching Array.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 (400)
1+
# Medium Questions (401)
22

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

@@ -79,6 +79,7 @@
7979
| 314 | [Binary Tree Vertical Order Traversal](<https://leetcode.com/problems/binary-tree-vertical-order-traversal>) | Medium | | [solution](<_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 12, 2024 |
8080
| 320 | [Generalized Abbreviation](<https://leetcode.com/problems/generalized-abbreviation>) | Medium | Weekly Premium | [solution](<_320. Generalized Abbreviation.md>) | py | Aug 22, 2024 |
8181
| 322 | [Coin Change](<https://leetcode.com/problems/coin-change>) | Medium | B75, N150 | [solution](<_322. Coin Change.md>) | py | Sep 24, 2024 |
82+
| 323 | [Number of Connected Components in an Undirected Graph](<https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph>) | Medium | B75, N150, Weekly Premium | [solution](<_323. Number of Connected Components in an Undirected Graph.md>) | py | Apr 08, 2025 |
8283
| 328 | [Odd Even Linked List](<https://leetcode.com/problems/odd-even-linked-list>) | Medium | | [solution](<_328. Odd Even Linked List.md>) | py | Jun 22, 2024 |
8384
| 339 | [Nested List Weight Sum](<https://leetcode.com/problems/nested-list-weight-sum>) | Medium | | [solution](<_339. Nested List Weight Sum.md>) | c, py | Jul 02, 2024 |
8485
| 341 | [Flatten Nested List Iterator](<https://leetcode.com/problems/flatten-nested-list-iterator>) | Medium | | [solution](<_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 |

‎markdowns/Questions_By_Code_Length.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -176,6 +176,7 @@ Calculations are based on the code files's byte sizes.
176176
| 3136 | [Valid Word](<https://leetcode.com/problems/valid-word>) | Easy | | [solution](<_3136. Valid Word.md>) | c, py | Jul 03, 2024 |
177177
| 1101 | [The Earliest Moment When Everyone Become Friends](<https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends>) | Medium | Weekly Premium | [solution](<_1101. The Earliest Moment When Everyone Become Friends.md>) | py | Jul 04, 2024 |
178178
| 729 | [My Calendar I](<https://leetcode.com/problems/my-calendar-i>) | Medium | Daily | [solution](<_729. My Calendar I.md>) | py | Sep 26, 2024 |
179+
| 323 | [Number of Connected Components in an Undirected Graph](<https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph>) | Medium | B75, N150, Weekly Premium | [solution](<_323. Number of Connected Components in an Undirected Graph.md>) | py | Apr 08, 2025 |
179180
| 42 | [Trapping Rain Water](<https://leetcode.com/problems/trapping-rain-water>) | Hard | N150 | [solution](<_42. Trapping Rain Water.md>) | py | Mar 11, 2025 |
180181
| 2342 | [Max Sum of a Pair With Equal Sum of Digits](<https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits>) | Medium | Daily | [solution](<_2342. Max Sum of a Pair With Equal Sum of Digits.md>) | py | Feb 12, 2025 |
181182
| 2743 | [Count Substrings Without Repeating Character](<https://leetcode.com/problems/count-substrings-without-repeating-character>) | Medium | Weekly Premium | [solution](<_2743. Count Substrings Without Repeating Character.md>) | java, py | Jun 22, 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+
| 323 | [Number of Connected Components in an Undirected Graph](<https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph>) | Medium | B75, N150, Weekly Premium | [solution](<_323. Number of Connected Components in an Undirected Graph.md>) | py | Apr 08, 2025 |
910
| 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 |
1011
| 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 |
1112
| 2873 | [Maximum Value of an Ordered Triplet I](<https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i>) | Easy | Daily | [solution](<_2873. Maximum Value of an Ordered Triplet I.md>) | py | Apr 02, 2025 |

‎markdowns/Topics.md‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -7,12 +7,12 @@
77
- [Array](<by_topic/Array.md>) (306 completed)
88
- [String](<by_topic/String.md>) (146 completed)
99
- [Hash Table](<by_topic/Hash Table.md>) (139 completed)
10-
- [Depth-First Search](<by_topic/Depth-First Search.md>) (103 completed)
10+
- [Depth-First Search](<by_topic/Depth-First Search.md>) (104 completed)
1111
- [Tree](<by_topic/Tree.md>) (91 completed)
1212
- [Binary Tree](<by_topic/Binary Tree.md>) (82 completed)
1313
- [Math](<by_topic/Math.md>) (79 completed)
1414
- [Sorting](<by_topic/Sorting.md>) (74 completed)
15-
- [Breadth-First Search](<by_topic/Breadth-First Search.md>) (71 completed)
15+
- [Breadth-First Search](<by_topic/Breadth-First Search.md>) (72 completed)
1616
- [Two Pointers](<by_topic/Two Pointers.md>) (61 completed)
1717
- [Dynamic Programming](<by_topic/Dynamic Programming.md>) (56 completed)
1818
- [Stack](<by_topic/Stack.md>) (56 completed)
@@ -29,11 +29,11 @@
2929
- [Sliding Window](<by_topic/Sliding Window.md>) (23 completed)
3030
- [Prefix Sum](<by_topic/Prefix Sum.md>) (20 completed)
3131
- [Trie](<by_topic/Trie.md>) (19 completed)
32+
- [Graph](<by_topic/Graph.md>) (19 completed)
3233
- [Recursion](<by_topic/Recursion.md>) (19 completed)
3334
- [Database](<by_topic/Database.md>) (18 completed)
34-
- [Graph](<by_topic/Graph.md>) (18 completed)
35+
- [Union Find](<by_topic/Union Find.md>) (17 completed)
3536
- [Binary Search Tree](<by_topic/Binary Search Tree.md>) (16 completed)
36-
- [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>) (12 completed)
3939
- [Divide and Conquer](<by_topic/Divide and Conquer.md>) (8 completed)

0 commit comments

Comments
 (0)