Zanger67
diff --git a/‎README.md
+3-2 b/‎README.md
+3-2
@@ -1,4 +1,4 @@
-# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (630 solved)
+# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (631 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>), [Math](<markdowns/by_topic/Math.md>), [Binary Tree](<markdowns/by_topic/Binary Tree.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>), [Recursion](<markdowns/by_topic/Recursion.md>), [Trie](<markdowns/by_topic/Trie.md>), [Graph](<markdowns/by_topic/Graph.md>), [Database](<markdowns/by_topic/Database.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.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>), [Enumeration](<markdowns/by_topic/Enumeration.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>)
+[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>), [Math](<markdowns/by_topic/Math.md>), [Binary Tree](<markdowns/by_topic/Binary Tree.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>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Counting](<markdowns/by_topic/Counting.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>), [Recursion](<markdowns/by_topic/Recursion.md>), [Trie](<markdowns/by_topic/Trie.md>), [Graph](<markdowns/by_topic/Graph.md>), [Database](<markdowns/by_topic/Database.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.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>), [Enumeration](<markdowns/by_topic/Enumeration.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>)
 
 ------
 
@@ -163,6 +163,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 |  286 | [Walls and Gates](<https://leetcode.com/problems/walls-and-gates>)                                                                                                                         | Medium  | N150                      | [solution](<markdowns/_286. Walls and Gates.md>)                                                              | py                                          |
 |  287 | [Find the Duplicate Number](<https://leetcode.com/problems/find-the-duplicate-number>)                                                                                                     | Medium  | N150                      | [solution](<markdowns/_287. Find the Duplicate Number.md>)                                                    | c                                           |
 |  292 | [Nim Game](<https://leetcode.com/problems/nim-game>)                                                                                                                                       | Easy    |                           | [solution](<markdowns/_292. Nim Game.md>)                                                                     | py                                          |
+|  302 | [Smallest Rectangle Enclosing Black Pixels](<https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels>)                                                                     | Hard    | Weekly Premium            | [solution](<markdowns/_302. Smallest Rectangle Enclosing Black Pixels.md>)                                    | py                                          |
 |  314 | [Binary Tree Vertical Order Traversal](<https://leetcode.com/problems/binary-tree-vertical-order-traversal>)                                                                               | Medium  |                           | [solution](<markdowns/_314. Binary Tree Vertical Order Traversal.md>)                                         | py                                          |
 |  320 | [Generalized Abbreviation](<https://leetcode.com/problems/generalized-abbreviation>)                                                                                                       | Medium  | Weekly Premium            | [solution](<markdowns/_320. Generalized Abbreviation.md>)                                                     | py                                          |
 |  322 | [Coin Change](<https://leetcode.com/problems/coin-change>)                                                                                                                                 | Medium  | B75, N150                 | [solution](<markdowns/_322. Coin Change.md>)                                                                  | py                                          |