Skip to content

Commit a9a10c6

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 722f520 commit a9a10c6

13 files changed

+84
-24
lines changed

Diff for: ‎README.md

+3-2
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (582 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (583 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>), [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>), [Ordered Set](<markdowns/by_topic/Ordered Set.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>), [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>), [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>)
3737

3838
------
3939

@@ -442,6 +442,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
442442
| 1743 | [Restore the Array From Adjacent Pairs](<https://leetcode.com/problems/restore-the-array-from-adjacent-pairs>) | Medium | | [solution](<markdowns/_1743. Restore the Array From Adjacent Pairs.md>) | py |
443443
| 1748 | [Sum of Unique Elements](<https://leetcode.com/problems/sum-of-unique-elements>) | Easy | | [solution](<markdowns/_1748. Sum of Unique Elements.md>) | c |
444444
| 1752 | [Check if Array Is Sorted and Rotated](<https://leetcode.com/problems/check-if-array-is-sorted-and-rotated>) | Easy | Daily | [solution](<markdowns/_1752. Check if Array Is Sorted and Rotated.md>) | py |
445+
| 1756 | [Design Most Recently Used Queue](<https://leetcode.com/problems/design-most-recently-used-queue>) | Medium | Weekly Premium | [solution](<markdowns/_1756. Design Most Recently Used Queue.md>) | py |
445446
| 1759 | [Count Number of Homogenous Substrings](<https://leetcode.com/problems/count-number-of-homogenous-substrings>) | Medium | | [solution](<markdowns/_1759. Count Number of Homogenous Substrings.md>) | c, java |
446447
| 1762 | [Buildings With an Ocean View](<https://leetcode.com/problems/buildings-with-an-ocean-view>) | Medium | | [solution](<markdowns/_1762. Buildings With an Ocean View.md>) | py |
447448
| 1768 | [Merge Strings Alternately](<https://leetcode.com/problems/merge-strings-alternately>) | Easy | | [solution](<markdowns/_1768. Merge Strings Alternately.md>) | java |

Diff for: ‎markdowns/Medium.md

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

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

@@ -266,6 +266,7 @@
266266
| 1730 | [Shortest Path to Get Food](<https://leetcode.com/problems/shortest-path-to-get-food>) | Medium | Weekly Premium | [solution](<_1730. Shortest Path to Get Food.md>) | py | Jun 26, 2024 |
267267
| 1740 | [Find Distance in a Binary Tree](<https://leetcode.com/problems/find-distance-in-a-binary-tree>) | Medium | Weekly Premium | [solution](<_1740. Find Distance in a Binary Tree.md>) | py | Jul 15, 2024 |
268268
| 1743 | [Restore the Array From Adjacent Pairs](<https://leetcode.com/problems/restore-the-array-from-adjacent-pairs>) | Medium | | [solution](<_1743. Restore the Array From Adjacent Pairs.md>) | py | Jun 27, 2024 |
269+
| 1756 | [Design Most Recently Used Queue](<https://leetcode.com/problems/design-most-recently-used-queue>) | Medium | Weekly Premium | [solution](<_1756. Design Most Recently Used Queue.md>) | py | Feb 15, 2025 |
269270
| 1759 | [Count Number of Homogenous Substrings](<https://leetcode.com/problems/count-number-of-homogenous-substrings>) | Medium | | [solution](<_1759. Count Number of Homogenous Substrings.md>) | c, java | Jun 10, 2024 |
270271
| 1762 | [Buildings With an Ocean View](<https://leetcode.com/problems/buildings-with-an-ocean-view>) | Medium | | [solution](<_1762. Buildings With an Ocean View.md>) | py | Jun 10, 2024 |
271272
| 1783 | [Grand Slam Titles](<https://leetcode.com/problems/grand-slam-titles>) | Medium | | [solution](<_1783. Grand Slam Titles.md>) | sql | Jun 07, 2024 |

Diff for: ‎markdowns/Questions_By_Code_Length.md

+1
Original file line numberDiff line numberDiff line change
@@ -533,6 +533,7 @@ Calculations are based on the code files's byte sizes.
533533
| 3178 | Weekly Contest 401 - q1 - [Find the Child Who Has the Ball After K Seconds](<https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds>) | Easy | Contest | [solution](<_3178. Find the Child Who Has the Ball After K Seconds.md>) | py | Jul 07, 2024 |
534534
| 819 | [Most Common Word](<https://leetcode.com/problems/most-common-word>) | Easy | | [solution](<_819. Most Common Word.md>) | py | Sep 24, 2024 |
535535
| 191 | [Number of 1 Bits](<https://leetcode.com/problems/number-of-1-bits>) | Easy | B75, N150 | [solution](<_191. Number of 1 Bits.md>) | py | Jul 03, 2024 |
536+
| 1756 | [Design Most Recently Used Queue](<https://leetcode.com/problems/design-most-recently-used-queue>) | Medium | Weekly Premium | [solution](<_1756. Design Most Recently Used Queue.md>) | py | Feb 15, 2025 |
536537
| 3074 | [Apple Redistribution into Boxes](<https://leetcode.com/problems/apple-redistribution-into-boxes>) | Easy | | [solution](<_3074. Apple Redistribution into Boxes.md>) | py | May 23, 2024 |
537538
| 1030 | [Matrix Cells in Distance Order](<https://leetcode.com/problems/matrix-cells-in-distance-order>) | Easy | | [solution](<_1030. Matrix Cells in Distance Order.md>) | py | Jun 04, 2024 |
538539
| 184 | [Department Highest Salary](<https://leetcode.com/problems/department-highest-salary>) | Medium | | [solution](<_184. Department Highest Salary.md>) | sql | Jun 07, 2024 |

Diff for: ‎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+
| 1756 | [Design Most Recently Used Queue](<https://leetcode.com/problems/design-most-recently-used-queue>) | Medium | Weekly Premium | [solution](<_1756. Design Most Recently Used Queue.md>) | py | Feb 15, 2025 |
910
| 2698 | [Find the Punishment Number of an Integer](<https://leetcode.com/problems/find-the-punishment-number-of-an-integer>) | Medium | Daily | [solution](<_2698. Find the Punishment Number of an Integer.md>) | py | Feb 15, 2025 |
1011
| 3066 | [Minimum Operations to Exceed Threshold Value II](<https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-ii>) | Medium | Daily | [solution](<_3066. Minimum Operations to Exceed Threshold Value II.md>) | py | Feb 13, 2025 |
1112
| 2342 | [Max Sum of a Pair With Equal Sum of Digits](<https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits>) | Medium | Daily | [solution](<_2342. Max Sum of a Pair With Equal Sum of Digits.md>) | py | Feb 12, 2025 |

0 commit comments

Comments
 (0)