Skip to content

Commit 444a031

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 47294df commit 444a031

17 files changed

+102
-44
lines changed

‎README.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -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>), [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>), [Matrix](<markdowns/by_topic/Matrix.md>), [Stack](<markdowns/by_topic/Stack.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Design](<markdowns/by_topic/Design.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.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>), [Trie](<markdowns/by_topic/Trie.md>), [Graph](<markdowns/by_topic/Graph.md>), [Recursion](<markdowns/by_topic/Recursion.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>), [Geometry](<markdowns/by_topic/Geometry.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>), [Enumeration](<markdowns/by_topic/Enumeration.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>), [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>), [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>)
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>), [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>), [Matrix](<markdowns/by_topic/Matrix.md>), [Stack](<markdowns/by_topic/Stack.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Design](<markdowns/by_topic/Design.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.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>), [Trie](<markdowns/by_topic/Trie.md>), [Recursion](<markdowns/by_topic/Recursion.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>), [Geometry](<markdowns/by_topic/Geometry.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>), [Enumeration](<markdowns/by_topic/Enumeration.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>), [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>), [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

@@ -485,9 +485,9 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
485485
| 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 |
486486
| 1768 | [Merge Strings Alternately](<https://leetcode.com/problems/merge-strings-alternately>) | Easy | | [solution](<markdowns/_1768. Merge Strings Alternately.md>) | java |
487487
| 1780 | [Check if Number is a Sum of Powers of Three](<https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three>) | Medium | Daily | [solution](<markdowns/_1780. Check if Number is a Sum of Powers of Three.md>) | py |
488-
| 1782 | [Count Pairs Of Nodes](<https://leetcode.com/problems/count-pairs-of-nodes>) | Hard | | [solution](<markdowns/_1782. Count Pairs Of Nodes.md>) | py |
489488
| 1783 | [Grand Slam Titles](<https://leetcode.com/problems/grand-slam-titles>) | Medium | | [solution](<markdowns/_1783. Grand Slam Titles.md>) | sql |
490489
| 1791 | [Find Center of Star Graph](<https://leetcode.com/problems/find-center-of-star-graph>) | Easy | Daily | [solution](<markdowns/_1791. Find Center of Star Graph.md>) | c, cpp, java, py |
490+
| 1792 | [Maximum Average Pass Ratio](<https://leetcode.com/problems/maximum-average-pass-ratio>) | Medium | Daily | [solution](<markdowns/_1792. Maximum Average Pass Ratio.md>) | py |
491491
| 1800 | [Maximum Ascending Subarray Sum](<https://leetcode.com/problems/maximum-ascending-subarray-sum>) | Easy | Daily | [solution](<markdowns/_1800. Maximum Ascending Subarray Sum.md>) | py |
492492
| 1804 | [Implement Trie II (Prefix Tree)](<https://leetcode.com/problems/implement-trie-ii-prefix-tree>) | Medium | Weekly Premium | [solution](<markdowns/_1804. Implement Trie II (Prefix Tree).md>) | py |
493493
| 1822 | [Sign of the Product of an Array](<https://leetcode.com/problems/sign-of-the-product-of-an-array>) | Easy | | [solution](<markdowns/_1822. Sign of the Product of an Array.md>) | c |

‎markdowns/Daily_Questions.md‎

Lines changed: 15 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -5,20 +5,21 @@
55
Dates are for the date I completed the question so due to the my time zone and how it lines up with UTC, it may be off by a day.
66

77
### September 2025
8-
| Su | Mo | Tu | We | Th | Fr | Sa |
9-
|-----:|-----:|-----------------------------------------------------------:|------------------------------------------------------------:|-----:|-----:|-----:|
10-
| | 1 | [2](<_3025. Find the Number of Ways to Place People I.md>) | [3](<_3027. Find the Number of Ways to Place People II.md>) | 4 | 5 | 6 |
11-
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
12-
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
13-
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
14-
| 28 | 29 | 30 | | | | |
8+
| Su | Mo | Tu | We | Th | Fr | Sa |
9+
|-----:|--------------------------------------------:|-----------------------------------------------------------:|------------------------------------------------------------:|-----:|-----:|-----:|
10+
| | [1](<_1792. Maximum Average Pass Ratio.md>) | [2](<_3025. Find the Number of Ways to Place People I.md>) | [3](<_3027. Find the Number of Ways to Place People II.md>) | 4 | 5 | 6 |
11+
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
12+
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
13+
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
14+
| 28 | 29 | 30 | | | | |
1515

1616

1717

1818
| # | Title | Level | Cats | Solution | Languages | Date Complete |
1919
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
2020
| 3027 | [Find the Number of Ways to Place People II](<https://leetcode.com/problems/find-the-number-of-ways-to-place-people-ii>) | Hard | Daily | [solution](<_3027. Find the Number of Ways to Place People II.md>) | py | Sep 03, 2025 |
2121
| 3025 | [Find the Number of Ways to Place People I](<https://leetcode.com/problems/find-the-number-of-ways-to-place-people-i>) | Medium | Daily | [solution](<_3025. Find the Number of Ways to Place People I.md>) | py | Sep 02, 2025 |
22+
| 1792 | [Maximum Average Pass Ratio](<https://leetcode.com/problems/maximum-average-pass-ratio>) | Medium | Daily | [solution](<_1792. Maximum Average Pass Ratio.md>) | py | Sep 01, 2025 |
2223
| 37 | [Sudoku Solver](<https://leetcode.com/problems/sudoku-solver>) | Hard | Daily | [solution](<_37. Sudoku Solver.md>) | py | Aug 31, 2025 |
2324
| 36 | [Valid Sudoku](<https://leetcode.com/problems/valid-sudoku>) | Medium | Daily, N150 | [solution](<_36. Valid Sudoku.md>) | py | Aug 30, 2025 |
2425
| 3021 | [Alice and Bob Playing Flower Game](<https://leetcode.com/problems/alice-and-bob-playing-flower-game>) | Medium | Daily | [solution](<_3021. Alice and Bob Playing Flower Game.md>) | go, py | Aug 29, 2025 |
@@ -361,11 +362,11 @@ Dates are for the date I completed the question so due to the my time zone and h
361362

362363

363364
### September 2025
364-
| Su | Mo | Tu | We | Th | Fr | Sa |
365-
|-----:|-----:|-----------------------------------------------------------:|------------------------------------------------------------:|-----:|-----:|-----:|
366-
| | 1 | [2](<_3025. Find the Number of Ways to Place People I.md>) | [3](<_3027. Find the Number of Ways to Place People II.md>) | 4 | 5 | 6 |
367-
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
368-
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
369-
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
370-
| 28 | 29 | 30 | | | | |
365+
| Su | Mo | Tu | We | Th | Fr | Sa |
366+
|-----:|--------------------------------------------:|-----------------------------------------------------------:|------------------------------------------------------------:|-----:|-----:|-----:|
367+
| | [1](<_1792. Maximum Average Pass Ratio.md>) | [2](<_3025. Find the Number of Ways to Place People I.md>) | [3](<_3027. Find the Number of Ways to Place People II.md>) | 4 | 5 | 6 |
368+
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
369+
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
370+
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
371+
| 28 | 29 | 30 | | | | |
371372

0 commit comments

Comments
 (0)