Skip to content

Commit 823ab7b

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent acc9b9e commit 823ab7b

File tree

10 files changed

+70
-11
lines changed

10 files changed

+70
-11
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/)** (538 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (539 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>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Design](<markdowns/by_topic/Design.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>), [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>)
3737

3838
------
3939

@@ -297,6 +297,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
297297
| 974 | [Subarray Sums Divisible by K](<https://leetcode.com/problems/subarray-sums-divisible-by-k>) | Medium | Daily | [solution](<markdowns/_974. Subarray Sums Divisible by K.md>) | java, py |
298298
| 977 | [Squares of a Sorted Array](<https://leetcode.com/problems/squares-of-a-sorted-array>) | Easy | | [solution](<markdowns/_977. Squares of a Sorted Array.md>) | py |
299299
| 979 | [Distribute Coins in Binary Tree](<https://leetcode.com/problems/distribute-coins-in-binary-tree>) | Medium | | [solution](<markdowns/_979. Distribute Coins in Binary Tree.md>) | py |
300+
| 981 | [Time Based Key-Value Store](<https://leetcode.com/problems/time-based-key-value-store>) | Medium | N150 | [solution](<markdowns/_981. Time Based Key-Value Store.md>) | py |
300301
| 987 | [Vertical Order Traversal of a Binary Tree](<https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree>) | Hard | | [solution](<markdowns/_987. Vertical Order Traversal of a Binary Tree.md>) | py |
301302
| 993 | [Cousins in Binary Tree](<https://leetcode.com/problems/cousins-in-binary-tree>) | Easy | | [solution](<markdowns/_993. Cousins in Binary Tree.md>) | py |
302303
| 994 | [Rotting Oranges](<https://leetcode.com/problems/rotting-oranges>) | Medium | N150 | [solution](<markdowns/_994. Rotting Oranges.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 (343)
1+
# Medium Questions (344)
22

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

@@ -169,6 +169,7 @@
169169
| 973 | [K Closest Points to Origin](<https://leetcode.com/problems/k-closest-points-to-origin>) | Medium | N150 | [solution](<_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 |
170170
| 974 | [Subarray Sums Divisible by K](<https://leetcode.com/problems/subarray-sums-divisible-by-k>) | Medium | Daily | [solution](<_974. Subarray Sums Divisible by K.md>) | java, py | Jun 09, 2024 |
171171
| 979 | [Distribute Coins in Binary Tree](<https://leetcode.com/problems/distribute-coins-in-binary-tree>) | Medium | | [solution](<_979. Distribute Coins in Binary Tree.md>) | py | Jul 26, 2024 |
172+
| 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 |
172173
| 994 | [Rotting Oranges](<https://leetcode.com/problems/rotting-oranges>) | Medium | N150 | [solution](<_994. Rotting Oranges.md>) | py | Jun 15, 2024 |
173174
| 1006 | [Clumsy Factorial](<https://leetcode.com/problems/clumsy-factorial>) | Medium | | [solution](<_1006. Clumsy Factorial.md>) | c, py | Jun 12, 2024 |
174175
| 1008 | [Construct Binary Search Tree from Preorder Traversal](<https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal>) | Medium | | [solution](<_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, cpp, java | Jun 27, 2024 |

‎markdowns/Questions_By_Code_Length.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -348,6 +348,7 @@ Calculations are based on the code files's byte sizes.
348348
| 1535 | [Find the Winner of an Array Game](<https://leetcode.com/problems/find-the-winner-of-an-array-game>) | Medium | | [solution](<_1535. Find the Winner of an Array Game.md>) | py | Jun 08, 2024 |
349349
| 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 |
350350
| 2624 | [Snail Traversal](<https://leetcode.com/problems/snail-traversal>) | Medium | | [solution](<_2624. Snail Traversal.md>) | js | Jul 09, 2024 |
351+
| 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 |
351352
| 1404 | [Number of Steps to Reduce a Number in Binary Representation to One](<https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one>) | Medium | | [solution](<_1404. Number of Steps to Reduce a Number in Binary Representation to One.md>) | py | Jun 08, 2024 |
352353
| 3157 | [Find the Level of Tree with Minimum Sum](<https://leetcode.com/problems/find-the-level-of-tree-with-minimum-sum>) | Medium | | [solution](<_3157. Find the Level of Tree with Minimum Sum.md>) | py | Jul 05, 2024 |
353354
| 2317 | [Maximum XOR After Operations ](<https://leetcode.com/problems/maximum-xor-after-operations>) | Medium | | [solution](<_2317. Maximum XOR After Operations .md>) | c, cpp, java, py | 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+
| 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 |
910
| 213 | [House Robber II](<https://leetcode.com/problems/house-robber-ii>) | Medium | B75, N150 | [solution](<_213. House Robber II.md>) | py | Oct 24, 2024 |
1011
| 54 | [Spiral Matrix](<https://leetcode.com/problems/spiral-matrix>) | Medium | B75, N150 | [solution](<_54. Spiral Matrix.md>) | py | Oct 24, 2024 |
1112
| 362 | [Design Hit Counter](<https://leetcode.com/problems/design-hit-counter>) | Medium | | [solution](<_362. Design Hit Counter.md>) | py | Oct 24, 2024 |

‎markdowns/Topics.md‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -5,8 +5,8 @@
55
------
66

77
- [Array](<by_topic/Array.md>) (259 completed)
8-
- [String](<by_topic/String.md>) (121 completed)
9-
- [Hash Table](<by_topic/Hash Table.md>) (119 completed)
8+
- [String](<by_topic/String.md>) (122 completed)
9+
- [Hash Table](<by_topic/Hash Table.md>) (120 completed)
1010
- [Depth-First Search](<by_topic/Depth-First Search.md>) (89 completed)
1111
- [Tree](<by_topic/Tree.md>) (87 completed)
1212
- [Binary Tree](<by_topic/Binary Tree.md>) (79 completed)
@@ -20,10 +20,10 @@
2020
- [Matrix](<by_topic/Matrix.md>) (44 completed)
2121
- [Greedy](<by_topic/Greedy.md>) (43 completed)
2222
- [Simulation](<by_topic/Simulation.md>) (37 completed)
23+
- [Design](<by_topic/Design.md>) (32 completed)
2324
- [Bit Manipulation](<by_topic/Bit Manipulation.md>) (31 completed)
24-
- [Design](<by_topic/Design.md>) (31 completed)
2525
- [Counting](<by_topic/Counting.md>) (27 completed)
26-
- [Binary Search](<by_topic/Binary Search.md>) (25 completed)
26+
- [Binary Search](<by_topic/Binary Search.md>) (26 completed)
2727
- [Heap (Priority Queue)](<by_topic/Heap (Priority Queue).md>) (20 completed)
2828
- [Backtracking](<by_topic/Backtracking.md>) (19 completed)
2929
- [Trie](<by_topic/Trie.md>) (19 completed)

0 commit comments

Comments
 (0)