Skip to content

Commit eb8945c

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent f488de1 commit eb8945c

File tree

9 files changed

+79
-8
lines changed

9 files changed

+79
-8
lines changed

‎README.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (596 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (597 solved)
22

33
<!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) -->
44

@@ -332,6 +332,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
332332
| 1071 | [Greatest Common Divisor of Strings](<https://leetcode.com/problems/greatest-common-divisor-of-strings>) | Easy | | [solution](<markdowns/_1071. Greatest Common Divisor of Strings.md>) | py |
333333
| 1079 | [Letter Tile Possibilities](<https://leetcode.com/problems/letter-tile-possibilities>) | Medium | Daily | [solution](<markdowns/_1079. Letter Tile Possibilities.md>) | py |
334334
| 1087 | [Brace Expansion](<https://leetcode.com/problems/brace-expansion>) | Medium | | [solution](<markdowns/_1087. Brace Expansion.md>) | py |
335+
| 1092 | [Shortest Common Supersequence ](<https://leetcode.com/problems/shortest-common-supersequence>) | Hard | Daily | [solution](<markdowns/_1092. Shortest Common Supersequence .md>) | py |
335336
| 1101 | [The Earliest Moment When Everyone Become Friends](<https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends>) | Medium | Weekly Premium | [solution](<markdowns/_1101. The Earliest Moment When Everyone Become Friends.md>) | py |
336337
| 1105 | [Filling Bookcase Shelves](<https://leetcode.com/problems/filling-bookcase-shelves>) | Medium | Daily | [solution](<markdowns/_1105. Filling Bookcase Shelves.md>) | py |
337338
| 1110 | [Delete Nodes And Return Forest](<https://leetcode.com/problems/delete-nodes-and-return-forest>) | Medium | Daily | [solution](<markdowns/_1110. Delete Nodes And Return Forest.md>) | py |

‎markdowns/Daily_Questions.md‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11,12 +11,13 @@ 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](<_1524. Number of Sub-arrays With Odd Sum.md>) | [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](<_1092. Shortest Common Supersequence .md>) | |
1515

1616

1717

1818
| # | Title | Level | Cats | Solution | Languages | Date Complete |
1919
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
20+
| 1092 | [Shortest Common Supersequence ](<https://leetcode.com/problems/shortest-common-supersequence>) | Hard | Daily | [solution](<_1092. Shortest Common Supersequence .md>) | py | Feb 28, 2025 |
2021
| 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 |
2122
| 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 |
2223
| 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 |
@@ -242,5 +243,5 @@ Dates are for the date I completed the question so due to the my time zone and h
242243
| [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>) |
243244
| 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>) |
244245
| [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>) |
245-
| 23 | 24 | [25](<_1524. Number of Sub-arrays With Odd Sum.md>) | [26](<_1749. Maximum Absolute Sum of Any Subarray.md>) | 27 | 28 | |
246+
| 23 | 24 | [25](<_1524. Number of Sub-arrays With Odd Sum.md>) | [26](<_1749. Maximum Absolute Sum of Any Subarray.md>) | 27 | [28](<_1092. Shortest Common Supersequence .md>) | |
246247

‎markdowns/Hard.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Hard Questions (38)
1+
# Hard Questions (39)
22

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

@@ -28,6 +28,7 @@
2828
| 987 | [Vertical Order Traversal of a Binary Tree](<https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree>) | Hard | | [solution](<_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 12, 2024 |
2929
| 995 | [Minimum Number of K Consecutive Bit Flips](<https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips>) | Hard | Daily | [solution](<_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 24, 2024 |
3030
| 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 | Jul 01, 2024 |
31+
| 1092 | [Shortest Common Supersequence ](<https://leetcode.com/problems/shortest-common-supersequence>) | Hard | Daily | [solution](<_1092. Shortest Common Supersequence .md>) | py | Feb 28, 2025 |
3132
| 1255 | [Maximum Score Words Formed by Letters](<https://leetcode.com/problems/maximum-score-words-formed-by-letters>) | Hard | | [solution](<_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 |
3233
| 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](<https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix>) | Hard | | [solution](<_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md>) | py | Jun 09, 2024 |
3334
| 1368 | [Minimum Cost to Make at Least One Valid Path in a Grid](<https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid>) | Hard | Daily | [solution](<_1368. Minimum Cost to Make at Least One Valid Path in a Grid.md>) | py | Jan 18, 2025 |

‎markdowns/Questions_By_Code_Length.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -216,6 +216,7 @@ Calculations are based on the code files's byte sizes.
216216
| 1823 | [Find the Winner of the Circular Game](<https://leetcode.com/problems/find-the-winner-of-the-circular-game>) | Medium | Daily | [solution](<_1823. Find the Winner of the Circular Game.md>) | c, cpp, java, js, py | Jul 08, 2024 |
217217
| 1490 | [Clone N-ary Tree](<https://leetcode.com/problems/clone-n-ary-tree>) | Medium | | [solution](<_1490. Clone N-ary Tree.md>) | java, py | Jun 02, 2024 |
218218
| 2149 | [Rearrange Array Elements by Sign](<https://leetcode.com/problems/rearrange-array-elements-by-sign>) | Medium | | [solution](<_2149. Rearrange Array Elements by Sign.md>) | c, py | Jun 10, 2024 |
219+
| 1092 | [Shortest Common Supersequence ](<https://leetcode.com/problems/shortest-common-supersequence>) | Hard | Daily | [solution](<_1092. Shortest Common Supersequence .md>) | py | Feb 28, 2025 |
219220
| 2405 | [Optimal Partition of String](<https://leetcode.com/problems/optimal-partition-of-string>) | Medium | | [solution](<_2405. Optimal Partition of String.md>) | py | Jun 23, 2024 |
220221
| 1254 | [Number of Closed Islands](<https://leetcode.com/problems/number-of-closed-islands>) | Medium | | [solution](<_1254. Number of Closed Islands.md>) | py | Jun 26, 2024 |
221222
| 1380 | [Lucky Numbers in a Matrix](<https://leetcode.com/problems/lucky-numbers-in-a-matrix>) | Easy | Daily | [solution](<_1380. Lucky Numbers in a Matrix.md>) | js, py | Jul 19, 2024 |

‎markdowns/Questions_By_Recent.md‎

Lines changed: 1 addition & 0 deletions
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+
| 1092 | [Shortest Common Supersequence ](<https://leetcode.com/problems/shortest-common-supersequence>) | Hard | Daily | [solution](<_1092. Shortest Common Supersequence .md>) | py | Feb 28, 2025 |
910
| 53 | [Maximum Subarray](<https://leetcode.com/problems/maximum-subarray>) | Medium | B75, N150 | [solution](<_53. Maximum Subarray.md>) | py | Feb 26, 2025 |
1011
| 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 26, 2025 |
1112
| 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 |

‎markdowns/Topics.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
------
66

77
- [Array](<by_topic/Array.md>) (296 completed)
8-
- [String](<by_topic/String.md>) (137 completed)
8+
- [String](<by_topic/String.md>) (138 completed)
99
- [Hash Table](<by_topic/Hash Table.md>) (133 completed)
1010
- [Depth-First Search](<by_topic/Depth-First Search.md>) (102 completed)
1111
- [Tree](<by_topic/Tree.md>) (91 completed)
@@ -15,7 +15,7 @@
1515
- [Breadth-First Search](<by_topic/Breadth-First Search.md>) (70 completed)
1616
- [Two Pointers](<by_topic/Two Pointers.md>) (56 completed)
1717
- [Stack](<by_topic/Stack.md>) (55 completed)
18-
- [Dynamic Programming](<by_topic/Dynamic Programming.md>) (52 completed)
18+
- [Dynamic Programming](<by_topic/Dynamic Programming.md>) (53 completed)
1919
- [Matrix](<by_topic/Matrix.md>) (52 completed)
2020
- [Greedy](<by_topic/Greedy.md>) (48 completed)
2121
- [Linked List](<by_topic/Linked List.md>) (45 completed)

0 commit comments

Comments
 (0)