Skip to content

Commit a728bba

Browse files
Zanger67/leetcodeZanger67/leetcode
authored andcommitted
Updated markdown files
1 parent 85a06b4 commit a728bba

File tree

512 files changed

+574
-525
lines changed

Some content is hidden

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

512 files changed

+574
-525
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/)** (619 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (620 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>), [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>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Trie](<markdowns/by_topic/Trie.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.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>), [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>)
3737

3838
------
3939

@@ -193,6 +193,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
193193
| 409 | [Longest Palindrome](<https://leetcode.com/problems/longest-palindrome>) | Easy | Daily | [solution](<markdowns/_409. Longest Palindrome.md>) | c, py |
194194
| 412 | [Fizz Buzz](<https://leetcode.com/problems/fizz-buzz>) | Easy | | [solution](<markdowns/_412. Fizz Buzz.md>) | java, py |
195195
| 414 | [Third Maximum Number](<https://leetcode.com/problems/third-maximum-number>) | Easy | | [solution](<markdowns/_414. Third Maximum Number.md>) | py |
196+
| 416 | [Partition Equal Subset Sum](<https://leetcode.com/problems/partition-equal-subset-sum>) | Medium | Daily, N150 | [solution](<markdowns/_416. Partition Equal Subset Sum.md>) | py |
196197
| 419 | [Battleships in a Board](<https://leetcode.com/problems/battleships-in-a-board>) | Medium | | [solution](<markdowns/_419. Battleships in a Board.md>) | c, py |
197198
| 424 | [Longest Repeating Character Replacement](<https://leetcode.com/problems/longest-repeating-character-replacement>) | Medium | B75, N150 | [solution](<markdowns/_424. Longest Repeating Character Replacement.md>) | py |
198199
| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](<https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list>) | Medium | | [solution](<markdowns/_426. Convert Binary Search Tree to Sorted Doubly Linked List.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 | 8 | 9 | 10 | 11 | 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 | 9 | 10 | 11 | 12 |
12+
| 13 | 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+
| 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 |
2021
| 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 |
2122
| 3169 | Weekly Contest 400 - q2 - [Count Days Without Meetings](<https://leetcode.com/problems/count-days-without-meetings>) | Medium | Contest, Daily | [solution](<_3169. Count Days Without Meetings.md>) | py | Mar 24, 2025 |
2223
| 3191 | [Minimum Operations to Make Binary Array Elements Equal to One I](<https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i>) | Medium | Daily | [solution](<_3191. Minimum Operations to Make Binary Array Elements Equal to One I.md>) | java | Mar 19, 2025 |
@@ -274,11 +275,11 @@ Dates are for the date I completed the question so due to the my time zone and h
274275

275276

276277
### April 2025
277-
| Su | Mo | Tu | We | Th | Fr | Sa |
278-
|-----:|-----:|-----:|-------------------------------------------------------:|-----:|-----:|-----:|
279-
| | | 1 | [2](<_2873. Maximum Value of an Ordered Triplet I.md>) | 3 | 4 | 5 |
280-
| 6 | 7 | 8 | 9 | 10 | 11 | 12 |
281-
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
282-
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
283-
| 27 | 28 | 29 | 30 | | | |
278+
| Su | Mo | Tu | We | Th | Fr | Sa |
279+
|-----:|-------------------------------------------:|-----:|-------------------------------------------------------:|-----:|-----:|-----:|
280+
| | | 1 | [2](<_2873. Maximum Value of an Ordered Triplet I.md>) | 3 | 4 | 5 |
281+
| 6 | [7](<_416. Partition Equal Subset Sum.md>) | 8 | 9 | 10 | 11 | 12 |
282+
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
283+
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
284+
| 27 | 28 | 29 | 30 | | | |
284285

markdowns/Medium.md

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

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

@@ -94,6 +94,7 @@
9494
| 382 | [Linked List Random Node](<https://leetcode.com/problems/linked-list-random-node>) | Medium | | [solution](<_382. Linked List Random Node.md>) | c, java, py | Jun 22, 2024 |
9595
| 384 | [Shuffle an Array](<https://leetcode.com/problems/shuffle-an-array>) | Medium | | [solution](<_384. Shuffle an Array.md>) | py | Jun 29, 2024 |
9696
| 394 | [Decode String](<https://leetcode.com/problems/decode-string>) | Medium | | [solution](<_394. Decode String.md>) | py | Jun 15, 2024 |
97+
| 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 |
9798
| 419 | [Battleships in a Board](<https://leetcode.com/problems/battleships-in-a-board>) | Medium | | [solution](<_419. Battleships in a Board.md>) | c, py | Jun 24, 2024 |
9899
| 424 | [Longest Repeating Character Replacement](<https://leetcode.com/problems/longest-repeating-character-replacement>) | Medium | B75, N150 | [solution](<_424. Longest Repeating Character Replacement.md>) | py | Jul 06, 2024 |
99100
| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](<https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list>) | Medium | | [solution](<_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 12, 2024 |

0 commit comments

Comments
 (0)