|
1 | | -# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (581 solved) |
| 1 | +# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (582 solved) |
2 | 2 |
|
3 | 3 | <!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) --> |
4 | 4 |
|
@@ -33,7 +33,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, |
33 | 33 |
|
34 | 34 | ------ |
35 | 35 |
|
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>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Math](<markdowns/by_topic/Math.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>), [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>), [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>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Graph](<markdowns/by_topic/Graph.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.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>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.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>), [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>), [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>), [Matrix](<markdowns/by_topic/Matrix.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.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>), [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>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Graph](<markdowns/by_topic/Graph.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.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>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.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>), [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>), [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>) |
37 | 37 |
|
38 | 38 | ------ |
39 | 39 |
|
@@ -555,6 +555,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, |
555 | 555 | | 2679 | [Sum in a Matrix](<https://leetcode.com/problems/sum-in-a-matrix>) | Medium | | [solution](<markdowns/_2679. Sum in a Matrix.md>) | java | |
556 | 556 | | 2683 | [Neighboring Bitwise XOR](<https://leetcode.com/problems/neighboring-bitwise-xor>) | Medium | Daily | [solution](<markdowns/_2683. Neighboring Bitwise XOR.md>) | c, java, py | |
557 | 557 | | 2684 | [Maximum Number of Moves in a Grid](<https://leetcode.com/problems/maximum-number-of-moves-in-a-grid>) | Medium | Daily | [solution](<markdowns/_2684. Maximum Number of Moves in a Grid.md>) | py | |
| 558 | +| 2698 | [Find the Punishment Number of an Integer](<https://leetcode.com/problems/find-the-punishment-number-of-an-integer>) | Medium | Daily | [solution](<markdowns/_2698. Find the Punishment Number of an Integer.md>) | py | |
558 | 559 | | 2703 | [Return Length of Arguments Passed](<https://leetcode.com/problems/return-length-of-arguments-passed>) | Easy | | [solution](<markdowns/_2703. Return Length of Arguments Passed.md>) | js, ts | |
559 | 560 | | 2704 | [To Be Or Not To Be](<https://leetcode.com/problems/to-be-or-not-to-be>) | Easy | | [solution](<markdowns/_2704. To Be Or Not To Be.md>) | js | |
560 | 561 | | 2723 | [Add Two Promises](<https://leetcode.com/problems/add-two-promises>) | Easy | | [solution](<markdowns/_2723. Add Two Promises.md>) | js | |
|
0 commit comments