Skip to content

Commit 0217bea

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent a6cbe9d commit 0217bea

File tree

11 files changed

+120
-13
lines changed

11 files changed

+120
-13
lines changed

‎README.md‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (594 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (595 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>), [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>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Trie](<markdowns/by_topic/Trie.md>), [Database](<markdowns/by_topic/Database.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.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>), [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>)
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>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Trie](<markdowns/by_topic/Trie.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Database](<markdowns/by_topic/Database.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.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>), [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

@@ -409,6 +409,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
409409
| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves](<https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves>) | Medium | Daily | [solution](<markdowns/_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | c, cpp, java, py |
410410
| 1518 | [Water Bottles](<https://leetcode.com/problems/water-bottles>) | Easy | Daily | [solution](<markdowns/_1518. Water Bottles.md>) | c, cpp, cs, java, js, py, ts |
411411
| 1522 | [Diameter of N-Ary Tree](<https://leetcode.com/problems/diameter-of-n-ary-tree>) | Medium | | [solution](<markdowns/_1522. Diameter of N-Ary Tree.md>) | py |
412+
| 1524 | [Number of Sub-arrays With Odd Sum](<https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum>) | Medium | Daily | [solution](<markdowns/_1524. Number of Sub-arrays With Odd Sum.md>) | py |
412413
| 1525 | [Number of Good Ways to Split a String](<https://leetcode.com/problems/number-of-good-ways-to-split-a-string>) | Medium | | [solution](<markdowns/_1525. Number of Good Ways to Split a String.md>) | py |
413414
| 1530 | [Number of Good Leaf Nodes Pairs](<https://leetcode.com/problems/number-of-good-leaf-nodes-pairs>) | Medium | Daily | [solution](<markdowns/_1530. Number of Good Leaf Nodes Pairs.md>) | py |
414415
| 1535 | [Find the Winner of an Array Game](<https://leetcode.com/problems/find-the-winner-of-an-array-game>) | Medium | | [solution](<markdowns/_1535. Find the Winner of an Array Game.md>) | py |

‎markdowns/Daily_Questions.md‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11,13 +11,14 @@ Dates are for the date I completed the question so due to the my time zone and h
1111
| [2](<_1752. Check if Array Is Sorted and Rotated.md>) | [3](<_3105. Longest Strictly Increasing or Strictly Decreasing Subarray.md>) | [4](<_1800. Maximum Ascending Subarray Sum.md>) | 5 | 6 | [7](<_3160. Find the Number of Distinct Colors Among the Balls.md>) | [8](<_2349. Design a Number Container System.md>) |
1212
| 9 | [10](<_3174. Clear Digits.md>) | [11](<_1910. Remove All Occurrences of a Substring.md>) | [12](<_2342. Max Sum of a Pair With Equal Sum of Digits.md>) | [13](<_3066. Minimum Operations to Exceed Threshold Value II.md>) | 14 | [15](<_2698. Find the Punishment Number of an Integer.md>) |
1313
| [16](<_1718. Construct the Lexicographically Largest Valid Sequence.md>) | [17](<_1079. Letter Tile Possibilities.md>) | [18](<_2375. Construct Smallest Number From DI String.md>) | [19](<_1415. The k-th Lexicographical String of All Happy Strings of Length n.md>) | [20](<_1980. Find Unique Binary String.md>) | [21](<_1261. Find Elements in a Contaminated Binary Tree.md>) | [22](<_1028. Recover a Tree From Preorder Traversal.md>) |
14-
| 23 | 24 | 25 | [26](<_1749. Maximum Absolute Sum of Any Subarray.md>) | 27 | 28 | |
14+
| 23 | 24 | [25](<_1524. Number of Sub-arrays With Odd Sum.md>) | [26](<_1749. Maximum Absolute Sum of Any Subarray.md>) | 27 | 28 | |
1515

1616

1717

1818
| # | Title | Level | Cats | Solution | Languages | Date Complete |
1919
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
2020
| 1749 | [Maximum Absolute Sum of Any Subarray](<https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray>) | Medium | Daily | [solution](<_1749. Maximum Absolute Sum of Any Subarray.md>) | py | Feb 26, 2025 |
21+
| 1524 | [Number of Sub-arrays With Odd Sum](<https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum>) | Medium | Daily | [solution](<_1524. Number of Sub-arrays With Odd Sum.md>) | py | Feb 25, 2025 |
2122
| 1028 | [Recover a Tree From Preorder Traversal](<https://leetcode.com/problems/recover-a-tree-from-preorder-traversal>) | Hard | Daily | [solution](<_1028. Recover a Tree From Preorder Traversal.md>) | py | Feb 22, 2025 |
2223
| 1261 | [Find Elements in a Contaminated Binary Tree](<https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree>) | Medium | Daily | [solution](<_1261. Find Elements in a Contaminated Binary Tree.md>) | py | Feb 21, 2025 |
2324
| 1980 | [Find Unique Binary String](<https://leetcode.com/problems/find-unique-binary-string>) | Medium | Daily | [solution](<_1980. Find Unique Binary String.md>) | c, py | Feb 20, 2025 |
@@ -241,5 +242,5 @@ Dates are for the date I completed the question so due to the my time zone and h
241242
| [2](<_1752. Check if Array Is Sorted and Rotated.md>) | [3](<_3105. Longest Strictly Increasing or Strictly Decreasing Subarray.md>) | [4](<_1800. Maximum Ascending Subarray Sum.md>) | 5 | 6 | [7](<_3160. Find the Number of Distinct Colors Among the Balls.md>) | [8](<_2349. Design a Number Container System.md>) |
242243
| 9 | [10](<_3174. Clear Digits.md>) | [11](<_1910. Remove All Occurrences of a Substring.md>) | [12](<_2342. Max Sum of a Pair With Equal Sum of Digits.md>) | [13](<_3066. Minimum Operations to Exceed Threshold Value II.md>) | 14 | [15](<_2698. Find the Punishment Number of an Integer.md>) |
243244
| [16](<_1718. Construct the Lexicographically Largest Valid Sequence.md>) | [17](<_1079. Letter Tile Possibilities.md>) | [18](<_2375. Construct Smallest Number From DI String.md>) | [19](<_1415. The k-th Lexicographical String of All Happy Strings of Length n.md>) | [20](<_1980. Find Unique Binary String.md>) | [21](<_1261. Find Elements in a Contaminated Binary Tree.md>) | [22](<_1028. Recover a Tree From Preorder Traversal.md>) |
244-
| 23 | 24 | 25 | [26](<_1749. Maximum Absolute Sum of Any Subarray.md>) | 27 | 28 | |
245+
| 23 | 24 | [25](<_1524. Number of Sub-arrays With Odd Sum.md>) | [26](<_1749. Maximum Absolute Sum of Any Subarray.md>) | 27 | 28 | |
245246

0 commit comments

Comments
 (0)