Updated markdown files

Zanger67 · Sep 25, 2024 · f39bb0f · f39bb0f
1 parent e7405be
commit f39bb0f
Show file tree

Hide file tree

Showing 10 changed files with 122 additions and 11 deletions.
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (527 solved)
+# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (528 solved)
 
 <!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) -->
 
@@ -33,7 +33,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 
 ------
 
-[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>), [Backtracking](<markdowns/by_topic/Backtracking.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>), [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>), [Graph](<markdowns/by_topic/Graph.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>), [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>), [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>), [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>), [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>)
+[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>), [Database](<markdowns/by_topic/Database.md>), [Trie](<markdowns/by_topic/Trie.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>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Graph](<markdowns/by_topic/Graph.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>), [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>), [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>), [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>), [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>)
 
 ------
 
@@ -192,6 +192,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 |  451 | [Sort Characters By Frequency](<https://leetcode.com/problems/sort-characters-by-frequency>)                                                                                               | Medium  |                | [solution](<markdowns/_451. Sort Characters By Frequency.md>)                                                 | py                                          |
 |  475 | [Heaters](<https://leetcode.com/problems/heaters>)                                                                                                                                         | Medium  |                | [solution](<markdowns/_475. Heaters.md>)                                                                      | py                                          |
 |  476 | [Number Complement](<https://leetcode.com/problems/number-complement>)                                                                                                                     | Easy    | Daily          | [solution](<markdowns/_476. Number Complement.md>)                                                            | py                                          |
+|  480 | [Sliding Window Median](<https://leetcode.com/problems/sliding-window-median>)                                                                                                             | Hard    |                | [solution](<markdowns/_480. Sliding Window Median.md>)                                                        | py                                          |
 |  502 | [IPO](<https://leetcode.com/problems/ipo>)                                                                                                                                                 | Hard    | Daily          | [solution](<markdowns/_502. IPO.md>)                                                                          | py                                          |
 |  503 | [Next Greater Element II](<https://leetcode.com/problems/next-greater-element-ii>)                                                                                                         | Medium  |                | [solution](<markdowns/_503. Next Greater Element II.md>)                                                      | py                                          |
 |  509 | [Fibonacci Number](<https://leetcode.com/problems/fibonacci-number>)                                                                                                                       | Easy    |                | [solution](<markdowns/_509. Fibonacci Number.md>)                                                             | c                                           |

diff --git a/markdowns/Hard.md b/markdowns/Hard.md
@@ -1,4 +1,4 @@
-# Hard Questions (32)
+# Hard Questions (33)
 
 *[Back to top](<../README.md>)*
 
@@ -18,6 +18,7 @@
 |  330 | [Patching Array](<https://leetcode.com/problems/patching-array>)                                                                                                   | Hard    | Daily     | [solution](<_330. Patching Array.md>)                                                   | py          | Jun 16, 2024    |
 |  381 | [Insert Delete GetRandom O(1) - Duplicates allowed](<https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed>)                                 | Hard    |           | [solution](<_381. Insert Delete GetRandom O(1) - Duplicates allowed.md>)                | java        | Jul 06, 2024    |
 |  431 | [Encode N-ary Tree to Binary Tree](<https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree>)                                                               | Hard    |           | [solution](<_431. Encode N-ary Tree to Binary Tree.md>)                                 | java, py    | Jun 28, 2024    |
+|  480 | [Sliding Window Median](<https://leetcode.com/problems/sliding-window-median>)                                                                                     | Hard    |           | [solution](<_480. Sliding Window Median.md>)                                            | py          | Sep 25, 2024    |
 |  502 | [IPO](<https://leetcode.com/problems/ipo>)                                                                                                                         | Hard    | Daily     | [solution](<_502. IPO.md>)                                                              | py          | Jun 15, 2024    |
 |  664 | [Strange Printer](<https://leetcode.com/problems/strange-printer>)                                                                                                 | Hard    | Daily     | [solution](<_664. Strange Printer.md>)                                                  | py          | Aug 21, 2024    |
 |  719 | [Find K-th Smallest Pair Distance](<https://leetcode.com/problems/find-k-th-smallest-pair-distance>)                                                               | Hard    | Daily     | [solution](<_719. Find K-th Smallest Pair Distance.md>)                                 | py          | Aug 14, 2024    |

diff --git a/markdowns/Questions_By_Code_Length.md b/markdowns/Questions_By_Code_Length.md
@@ -36,6 +36,7 @@ Calculations are based on the code files's byte sizes.
 |  861 | [Score After Flipping Matrix](<https://leetcode.com/problems/score-after-flipping-matrix>)                                                                                                 | Medium  |                | [solution](<_861. Score After Flipping Matrix.md>)                                                  | c, py                                       | Jun 10, 2024    |
 |  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    |
 |  431 | [Encode N-ary Tree to Binary Tree](<https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree>)                                                                                       | Hard    |                | [solution](<_431. Encode N-ary Tree to Binary Tree.md>)                                             | java, py                                    | Jun 28, 2024    |
+|  480 | [Sliding Window Median](<https://leetcode.com/problems/sliding-window-median>)                                                                                                             | Hard    |                | [solution](<_480. Sliding Window Median.md>)                                                        | py                                          | Sep 25, 2024    |
 |  224 | [Basic Calculator](<https://leetcode.com/problems/basic-calculator>)                                                                                                                       | Hard    |                | [solution](<_224. Basic Calculator.md>)                                                             | py                                          | Jun 10, 2024    |
 |   19 | [Remove Nth Node From End of List](<https://leetcode.com/problems/remove-nth-node-from-end-of-list>)                                                                                       | Medium  | B75, N150      | [solution](<_19. Remove Nth Node From End of List.md>)                                              | c, java, py                                 | Jun 07, 2024    |
 |  114 | [Flatten Binary Tree to Linked List](<https://leetcode.com/problems/flatten-binary-tree-to-linked-list>)                                                                                   | Medium  |                | [solution](<_114. Flatten Binary Tree to Linked List.md>)                                           | c, py                                       | Jun 11, 2024    |

diff --git a/markdowns/Questions_By_Recent.md b/markdowns/Questions_By_Recent.md
@@ -6,6 +6,7 @@ Calculations are based on the date of the first solve.
 
 |    # | Title                                                                                                                                                                                      | Level   | Cats           | Solution                                                                                            | Languages                                   | Date Complete   |
 |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:--------------------------------------------|:----------------|
+|  480 | [Sliding Window Median](<https://leetcode.com/problems/sliding-window-median>)                                                                                                             | Hard    |                | [solution](<_480. Sliding Window Median.md>)                                                        | py                                          | Sep 25, 2024    |
 | 2451 | [Odd String Difference](<https://leetcode.com/problems/odd-string-difference>)                                                                                                             | Easy    |                | [solution](<_2451. Odd String Difference.md>)                                                       | py                                          | Sep 25, 2024    |
 | 1452 | [People Whose List of Favorite Companies Is Not a Subset of Another List](<https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list>)         | Medium  |                | [solution](<_1452. People Whose List of Favorite Companies Is Not a Subset of Another List.md>)     | py                                          | Sep 25, 2024    |
 | 1232 | [Check If It Is a Straight Line](<https://leetcode.com/problems/check-if-it-is-a-straight-line>)                                                                                           | Easy    |                | [solution](<_1232. Check If It Is a Straight Line.md>)                                              | py                                          | Sep 25, 2024    |

diff --git a/markdowns/Topics.md b/markdowns/Topics.md
@@ -4,9 +4,9 @@
 
 ------
 
-- [Array](<by_topic/Array.md>) (250 completed)
+- [Array](<by_topic/Array.md>) (251 completed)
 - [String](<by_topic/String.md>) (120 completed)
-- [Hash Table](<by_topic/Hash Table.md>) (116 completed)
+- [Hash Table](<by_topic/Hash Table.md>) (117 completed)
 - [Depth-First Search](<by_topic/Depth-First Search.md>) (88 completed)
 - [Tree](<by_topic/Tree.md>) (85 completed)
 - [Binary Tree](<by_topic/Binary Tree.md>) (77 completed)
@@ -24,14 +24,14 @@
 - [Design](<by_topic/Design.md>) (28 completed)
 - [Counting](<by_topic/Counting.md>) (25 completed)
 - [Binary Search](<by_topic/Binary Search.md>) (23 completed)
+- [Heap (Priority Queue)](<by_topic/Heap (Priority Queue).md>) (20 completed)
 - [Backtracking](<by_topic/Backtracking.md>) (19 completed)
-- [Heap (Priority Queue)](<by_topic/Heap (Priority Queue).md>) (19 completed)
 - [Database](<by_topic/Database.md>) (18 completed)
 - [Trie](<by_topic/Trie.md>) (18 completed)
 - [Recursion](<by_topic/Recursion.md>) (17 completed)
 - [Binary Search Tree](<by_topic/Binary Search Tree.md>) (16 completed)
+- [Sliding Window](<by_topic/Sliding Window.md>) (15 completed)
 - [Prefix Sum](<by_topic/Prefix Sum.md>) (14 completed)
-- [Sliding Window](<by_topic/Sliding Window.md>) (14 completed)
 - [Graph](<by_topic/Graph.md>) (12 completed)
 - [Queue](<by_topic/Queue.md>) (11 completed)
 - [Monotonic Stack](<by_topic/Monotonic Stack.md>) (10 completed)