Skip to content

Commit 9a2dedc

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent caca371 commit 9a2dedc

File tree

10 files changed

+124
-56
lines changed

10 files changed

+124
-56
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/)** (541 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (542 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>), [Linked List](<markdowns/by_topic/Linked List.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Greedy](<markdowns/by_topic/Greedy.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>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Trie](<markdowns/by_topic/Trie.md>), [Database](<markdowns/by_topic/Database.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Queue](<markdowns/by_topic/Queue.md>), [Graph](<markdowns/by_topic/Graph.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Data Stream](<markdowns/by_topic/Data Stream.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>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.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>), [Topological Sort](<markdowns/by_topic/Topological Sort.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>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.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>), [Linked List](<markdowns/by_topic/Linked List.md>), [Greedy](<markdowns/by_topic/Greedy.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>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Queue](<markdowns/by_topic/Queue.md>), [Graph](<markdowns/by_topic/Graph.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Data Stream](<markdowns/by_topic/Data Stream.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>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.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>), [Topological Sort](<markdowns/by_topic/Topological Sort.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>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
3737

3838
------
3939

@@ -517,6 +517,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
517517
| 2629 | [Function Composition](<https://leetcode.com/problems/function-composition>) | Easy | | [solution](<markdowns/_2629. Function Composition.md>) | js |
518518
| 2634 | [Filter Elements from Array](<https://leetcode.com/problems/filter-elements-from-array>) | Easy | | [solution](<markdowns/_2634. Filter Elements from Array.md>) | js |
519519
| 2635 | [Apply Transform Over Each Element in Array](<https://leetcode.com/problems/apply-transform-over-each-element-in-array>) | Easy | | [solution](<markdowns/_2635. Apply Transform Over Each Element in Array.md>) | js |
520+
| 2664 | [The Knight’s Tour](<https://leetcode.com/problems/the-knights-tour>) | Medium | Weekly Premium | [solution](<markdowns/_2664. The Knight’s Tour.md>) | py |
520521
| 2665 | [Counter II](<https://leetcode.com/problems/counter-ii>) | Easy | | [solution](<markdowns/_2665. Counter II.md>) | js |
521522
| 2666 | [Allow One Function Call](<https://leetcode.com/problems/allow-one-function-call>) | Easy | | [solution](<markdowns/_2666. Allow One Function Call.md>) | js |
522523
| 2667 | [Create Hello World Function](<https://leetcode.com/problems/create-hello-world-function>) | Easy | | [solution](<markdowns/_2667. Create Hello World Function.md>) | js |

‎markdowns/Medium.md‎

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

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

@@ -316,6 +316,7 @@
316316
| 2610 | [Convert an Array Into a 2D Array With Conditions](<https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions>) | Medium | | [solution](<_2610. Convert an Array Into a 2D Array With Conditions.md>) | py | Jun 07, 2024 |
317317
| 2623 | [Memoize](<https://leetcode.com/problems/memoize>) | Medium | | [solution](<_2623. Memoize.md>) | js | Jul 09, 2024 |
318318
| 2624 | [Snail Traversal](<https://leetcode.com/problems/snail-traversal>) | Medium | | [solution](<_2624. Snail Traversal.md>) | js | Jul 09, 2024 |
319+
| 2664 | [The Knight’s Tour](<https://leetcode.com/problems/the-knights-tour>) | Medium | Weekly Premium | [solution](<_2664. The Knight’s Tour.md>) | py | Oct 26, 2024 |
319320
| 2671 | [Frequency Tracker](<https://leetcode.com/problems/frequency-tracker>) | Medium | | [solution](<_2671. Frequency Tracker.md>) | py | Jun 28, 2024 |
320321
| 2679 | [Sum in a Matrix](<https://leetcode.com/problems/sum-in-a-matrix>) | Medium | | [solution](<_2679. Sum in a Matrix.md>) | java | May 22, 2024 |
321322
| 2734 | [Lexicographically Smallest String After Substring Operation](<https://leetcode.com/problems/lexicographically-smallest-string-after-substring-operation>) | Medium | | [solution](<_2734. Lexicographically Smallest String After Substring Operation.md>) | py | Jun 29, 2024 |

‎markdowns/Questions_By_Code_Length.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -248,6 +248,7 @@ Calculations are based on the code files's byte sizes.
248248
| 2678 | [Number of Senior Citizens](<https://leetcode.com/problems/number-of-senior-citizens>) | Easy | Daily | [solution](<_2678. Number of Senior Citizens.md>) | c, java, py | May 22, 2024 |
249249
| 1905 | [Count Sub Islands](<https://leetcode.com/problems/count-sub-islands>) | Medium | Daily | [solution](<_1905. Count Sub Islands.md>) | py | Jun 24, 2024 |
250250
| 1791 | [Find Center of Star Graph](<https://leetcode.com/problems/find-center-of-star-graph>) | Easy | Daily | [solution](<_1791. Find Center of Star Graph.md>) | c, cpp, java, py | Jun 27, 2024 |
251+
| 2664 | [The Knight’s Tour](<https://leetcode.com/problems/the-knights-tour>) | Medium | Weekly Premium | [solution](<_2664. The Knight’s Tour.md>) | py | Oct 26, 2024 |
251252
| 993 | [Cousins in Binary Tree](<https://leetcode.com/problems/cousins-in-binary-tree>) | Easy | | [solution](<_993. Cousins in Binary Tree.md>) | py | Jul 04, 2024 |
252253
| 2623 | [Memoize](<https://leetcode.com/problems/memoize>) | Medium | | [solution](<_2623. Memoize.md>) | js | Jul 09, 2024 |
253254
| 2225 | [Find Players With Zero or One Losses](<https://leetcode.com/problems/find-players-with-zero-or-one-losses>) | Medium | | [solution](<_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 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+
| 2664 | [The Knight’s Tour](<https://leetcode.com/problems/the-knights-tour>) | Medium | Weekly Premium | [solution](<_2664. The Knight’s Tour.md>) | py | Oct 26, 2024 |
910
| 1376 | [Time Needed to Inform All Employees](<https://leetcode.com/problems/time-needed-to-inform-all-employees>) | Medium | | [solution](<_1376. Time Needed to Inform All Employees.md>) | py | Oct 26, 2024 |
1011
| 2458 | [Height of Binary Tree After Subtree Removal Queries](<https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries>) | Hard | Daily | [solution](<_2458. Height of Binary Tree After Subtree Removal Queries.md>) | py | Oct 26, 2024 |
1112
| 981 | [Time Based Key-Value Store](<https://leetcode.com/problems/time-based-key-value-store>) | Medium | N150 | [solution](<_981. Time Based Key-Value Store.md>) | py | Oct 24, 2024 |

‎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>) (260 completed)
7+
- [Array](<by_topic/Array.md>) (261 completed)
88
- [String](<by_topic/String.md>) (122 completed)
99
- [Hash Table](<by_topic/Hash Table.md>) (120 completed)
1010
- [Depth-First Search](<by_topic/Depth-First Search.md>) (91 completed)
@@ -16,16 +16,16 @@
1616
- [Two Pointers](<by_topic/Two Pointers.md>) (54 completed)
1717
- [Stack](<by_topic/Stack.md>) (51 completed)
1818
- [Dynamic Programming](<by_topic/Dynamic Programming.md>) (45 completed)
19+
- [Matrix](<by_topic/Matrix.md>) (45 completed)
1920
- [Linked List](<by_topic/Linked List.md>) (45 completed)
20-
- [Matrix](<by_topic/Matrix.md>) (44 completed)
2121
- [Greedy](<by_topic/Greedy.md>) (43 completed)
2222
- [Simulation](<by_topic/Simulation.md>) (37 completed)
2323
- [Design](<by_topic/Design.md>) (32 completed)
2424
- [Bit Manipulation](<by_topic/Bit Manipulation.md>) (31 completed)
2525
- [Counting](<by_topic/Counting.md>) (27 completed)
2626
- [Binary Search](<by_topic/Binary Search.md>) (26 completed)
27+
- [Backtracking](<by_topic/Backtracking.md>) (20 completed)
2728
- [Heap (Priority Queue)](<by_topic/Heap (Priority Queue).md>) (20 completed)
28-
- [Backtracking](<by_topic/Backtracking.md>) (19 completed)
2929
- [Trie](<by_topic/Trie.md>) (19 completed)
3030
- [Database](<by_topic/Database.md>) (18 completed)
3131
- [Recursion](<by_topic/Recursion.md>) (17 completed)

0 commit comments

Comments
 (0)