Skip to content

Commit 03cb956

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 5281984 commit 03cb956

11 files changed

+128
-62
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/)** (497 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (498 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>), [Matrix](<markdowns/by_topic/Matrix.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.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>), [Database](<markdowns/by_topic/Database.md>), [Trie](<markdowns/by_topic/Trie.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Graph](<markdowns/by_topic/Graph.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Queue](<markdowns/by_topic/Queue.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>), [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>), [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>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.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>), [Geometry](<markdowns/by_topic/Geometry.md>), [Interactive](<markdowns/by_topic/Interactive.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Bitmask](<markdowns/by_topic/Bitmask.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>), [Segment Tree](<markdowns/by_topic/Segment 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>), [Matrix](<markdowns/by_topic/Matrix.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Linked List](<markdowns/by_topic/Linked List.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>), [Database](<markdowns/by_topic/Database.md>), [Trie](<markdowns/by_topic/Trie.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Graph](<markdowns/by_topic/Graph.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Queue](<markdowns/by_topic/Queue.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>), [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>), [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>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.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>), [Geometry](<markdowns/by_topic/Geometry.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>), [Ordered Set](<markdowns/by_topic/Ordered Set.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>), [Segment Tree](<markdowns/by_topic/Segment Tree.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
3737

3838
------
3939

@@ -160,6 +160,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
160160
| 347 | [Top K Frequent Elements](<https://leetcode.com/problems/top-k-frequent-elements>) | Medium | B75, N150 | [solution](<markdowns/_347. Top K Frequent Elements.md>) | py |
161161
| 348 | [Design Tic-Tac-Toe](<https://leetcode.com/problems/design-tic-tac-toe>) | Medium | | [solution](<markdowns/_348. Design Tic-Tac-Toe.md>) | py |
162162
| 350 | [Intersection of Two Arrays II](<https://leetcode.com/problems/intersection-of-two-arrays-ii>) | Easy | Daily | [solution](<markdowns/_350. Intersection of Two Arrays II.md>) | java, py |
163+
| 351 | [Android Unlock Patterns](<https://leetcode.com/problems/android-unlock-patterns>) | Medium | Weekly Premium | [solution](<markdowns/_351. Android Unlock Patterns.md>) | py |
163164
| 353 | [Design Snake Game](<https://leetcode.com/problems/design-snake-game>) | Medium | | [solution](<markdowns/_353. Design Snake Game.md>) | py |
164165
| 364 | [Nested List Weight Sum II](<https://leetcode.com/problems/nested-list-weight-sum-ii>) | Medium | | [solution](<markdowns/_364. Nested List Weight Sum II.md>) | java, py |
165166
| 366 | [Find Leaves of Binary Tree](<https://leetcode.com/problems/find-leaves-of-binary-tree>) | Medium | | [solution](<markdowns/_366. Find Leaves of Binary Tree.md>) | py |

‎markdowns/Medium.md

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

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

@@ -75,6 +75,7 @@
7575
| 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 |
7676
| 347 | [Top K Frequent Elements](<https://leetcode.com/problems/top-k-frequent-elements>) | Medium | B75, N150 | [solution](<_347. Top K Frequent Elements.md>) | py | Jun 13, 2024 |
7777
| 348 | [Design Tic-Tac-Toe](<https://leetcode.com/problems/design-tic-tac-toe>) | Medium | | [solution](<_348. Design Tic-Tac-Toe.md>) | py | Jul 05, 2024 |
78+
| 351 | [Android Unlock Patterns](<https://leetcode.com/problems/android-unlock-patterns>) | Medium | Weekly Premium | [solution](<_351. Android Unlock Patterns.md>) | py | Aug 13, 2024 |
7879
| 353 | [Design Snake Game](<https://leetcode.com/problems/design-snake-game>) | Medium | | [solution](<_353. Design Snake Game.md>) | py | Jun 28, 2024 |
7980
| 364 | [Nested List Weight Sum II](<https://leetcode.com/problems/nested-list-weight-sum-ii>) | Medium | | [solution](<_364. Nested List Weight Sum II.md>) | java, py | Jul 02, 2024 |
8081
| 366 | [Find Leaves of Binary Tree](<https://leetcode.com/problems/find-leaves-of-binary-tree>) | Medium | | [solution](<_366. Find Leaves of Binary Tree.md>) | py | Jun 12, 2024 |

‎markdowns/Questions_By_Code_Length.md

+1
Original file line numberDiff line numberDiff line change
@@ -253,6 +253,7 @@ Calculations are based on the code files's byte sizes.
253253
| 3179 | Weekly Contest 401 - q2 - [Find the N-th Value After K Seconds](<https://leetcode.com/problems/find-the-n-th-value-after-k-seconds>) | Medium | Contest | [solution](<_3179. Find the N-th Value After K Seconds.md>) | py | Jul 07, 2024 |
254254
| 535 | [Encode and Decode TinyURL](<https://leetcode.com/problems/encode-and-decode-tinyurl>) | Medium | | [solution](<_535. Encode and Decode TinyURL.md>) | py | Jun 07, 2024 |
255255
| 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 |
256+
| 351 | [Android Unlock Patterns](<https://leetcode.com/problems/android-unlock-patterns>) | Medium | Weekly Premium | [solution](<_351. Android Unlock Patterns.md>) | py | Aug 13, 2024 |
256257
| 2396 | [Strictly Palindromic Number](<https://leetcode.com/problems/strictly-palindromic-number>) | Medium | | [solution](<_2396. Strictly Palindromic Number.md>) | c, cpp, java, js, kt, py, rb, rs | Jun 09, 2024 |
257258
| 1833 | [Maximum Ice Cream Bars](<https://leetcode.com/problems/maximum-ice-cream-bars>) | Medium | | [solution](<_1833. Maximum Ice Cream Bars.md>) | c, java, py | Jun 23, 2024 |
258259
| 113 | [Path Sum II](<https://leetcode.com/problems/path-sum-ii>) | Medium | | [solution](<_113. Path Sum II.md>) | py | Jul 03, 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+
| 351 | [Android Unlock Patterns](<https://leetcode.com/problems/android-unlock-patterns>) | Medium | Weekly Premium | [solution](<_351. Android Unlock Patterns.md>) | py | Aug 13, 2024 |
910
| 3249 | [Count the Number of Good Nodes](<https://leetcode.com/problems/count-the-number-of-good-nodes>) | Medium | | [solution](<_3249. Count the Number of Good Nodes.md>) | py | Aug 12, 2024 |
1011
| 3248 | [Snake in Matrix](<https://leetcode.com/problems/snake-in-matrix>) | Easy | | [solution](<_3248. Snake in Matrix.md>) | py | Aug 12, 2024 |
1112
| 1568 | [Minimum Number of Days to Disconnect Island](<https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island>) | Hard | Daily | [solution](<_1568. Minimum Number of Days to Disconnect Island.md>) | py | Aug 11, 2024 |

‎markdowns/Topics.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -16,19 +16,19 @@
1616
- [Two Pointers](<by_topic/Two Pointers.md>) (51 completed)
1717
- [Stack](<by_topic/Stack.md>) (48 completed)
1818
- [Matrix](<by_topic/Matrix.md>) (43 completed)
19+
- [Dynamic Programming](<by_topic/Dynamic Programming.md>) (40 completed)
1920
- [Linked List](<by_topic/Linked List.md>) (40 completed)
20-
- [Dynamic Programming](<by_topic/Dynamic Programming.md>) (39 completed)
2121
- [Greedy](<by_topic/Greedy.md>) (39 completed)
2222
- [Simulation](<by_topic/Simulation.md>) (34 completed)
23-
- [Bit Manipulation](<by_topic/Bit Manipulation.md>) (28 completed)
23+
- [Bit Manipulation](<by_topic/Bit Manipulation.md>) (29 completed)
2424
- [Design](<by_topic/Design.md>) (28 completed)
2525
- [Counting](<by_topic/Counting.md>) (22 completed)
2626
- [Binary Search](<by_topic/Binary Search.md>) (21 completed)
2727
- [Heap (Priority Queue)](<by_topic/Heap (Priority Queue).md>) (19 completed)
2828
- [Database](<by_topic/Database.md>) (18 completed)
2929
- [Trie](<by_topic/Trie.md>) (18 completed)
30+
- [Backtracking](<by_topic/Backtracking.md>) (17 completed)
3031
- [Recursion](<by_topic/Recursion.md>) (17 completed)
31-
- [Backtracking](<by_topic/Backtracking.md>) (16 completed)
3232
- [Binary Search Tree](<by_topic/Binary Search Tree.md>) (16 completed)
3333
- [Sliding Window](<by_topic/Sliding Window.md>) (14 completed)
3434
- [Graph](<by_topic/Graph.md>) (12 completed)
@@ -56,11 +56,11 @@
5656
- [Number Theory](<by_topic/Number Theory.md>) (3 completed)
5757
- [Geometry](<by_topic/Geometry.md>) (2 completed)
5858
- [Interactive](<by_topic/Interactive.md>) (2 completed)
59+
- [Bitmask](<by_topic/Bitmask.md>) (2 completed)
5960
- [Merge Sort](<by_topic/Merge Sort.md>) (2 completed)
6061
- [Topological Sort](<by_topic/Topological Sort.md>) (2 completed)
6162
- [Ordered Set](<by_topic/Ordered Set.md>) (2 completed)
6263
- [Quickselect](<by_topic/Quickselect.md>) (2 completed)
63-
- [Bitmask](<by_topic/Bitmask.md>) (1 completed)
6464
- [Strongly Connected Component](<by_topic/Strongly Connected Component.md>) (1 completed)
6565
- [Probability and Statistics](<by_topic/Probability and Statistics.md>) (1 completed)
6666
- [Binary Indexed Tree](<by_topic/Binary Indexed Tree.md>) (1 completed)

0 commit comments

Comments
 (0)