Skip to content

Commit 8174938

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent d157c1c commit 8174938

File tree

498 files changed

+649
-504
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

498 files changed

+649
-504
lines changed

README.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (583 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (584 solved)
22

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

@@ -435,6 +435,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
435435
| 1700 | [Number of Students Unable to Eat Lunch](<https://leetcode.com/problems/number-of-students-unable-to-eat-lunch>) | Easy | | [solution](<markdowns/_1700. Number of Students Unable to Eat Lunch.md>) | py |
436436
| 1701 | [Average Waiting Time](<https://leetcode.com/problems/average-waiting-time>) | Medium | Daily | [solution](<markdowns/_1701. Average Waiting Time.md>) | js, py |
437437
| 1717 | [Maximum Score From Removing Substrings](<https://leetcode.com/problems/maximum-score-from-removing-substrings>) | Medium | Daily | [solution](<markdowns/_1717. Maximum Score From Removing Substrings.md>) | py |
438+
| 1718 | [Construct the Lexicographically Largest Valid Sequence](<https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence>) | Medium | Daily | [solution](<markdowns/_1718. Construct the Lexicographically Largest Valid Sequence.md>) | py |
438439
| 1721 | [Swapping Nodes in a Linked List](<https://leetcode.com/problems/swapping-nodes-in-a-linked-list>) | Medium | | [solution](<markdowns/_1721. Swapping Nodes in a Linked List.md>) | c |
439440
| 1730 | [Shortest Path to Get Food](<https://leetcode.com/problems/shortest-path-to-get-food>) | Medium | Weekly Premium | [solution](<markdowns/_1730. Shortest Path to Get Food.md>) | py |
440441
| 1736 | [Latest Time by Replacing Hidden Digits](<https://leetcode.com/problems/latest-time-by-replacing-hidden-digits>) | Easy | | [solution](<markdowns/_1736. Latest Time by Replacing Hidden Digits.md>) | c |

markdowns/Daily_Questions.md

+10-9
Original file line numberDiff line numberDiff line change
@@ -87,18 +87,19 @@ Dates are for the date I completed the question so due to the my time zone and h
8787
| 5 | [27](<_1462. | Course | Schedule | IV.md>) | [28](<_2658. | Maximum | Number | of | Fish | in | a | Grid.md>) | [29](<_684. | Redundant | Connection.md>) | [30](<_2493. | Divide | Nodes | Into | the | Maximum | Number | of | Groups.md>) | [31](<_827. | Making | A | Large | Island.md>) |
8888
| 6 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
8989
February 2025
90-
| | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 |
91-
|---:|:-------------|:--------|:------------|:-------------|:------------|:---------|:------------|:--------------|:------------|:---------------|:-------------|:-------------|:---------|:-----|:-----|:------------|:-----|:------|:-------|:-----|:------------|:-------------|:--------|:-----------|:-----------|:------------|:----------|:------|:--------|:----------|:-------------|:-----|:-----|:-----------|:-------|:-----|:-----|:-------------|-----:|
92-
| 0 | Mo | Tu | We | Th | Fr | Sa | Su | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
93-
| 1 | [1](<_3151. | Special | Array | I.md>) | [2](<_1752. | Check | if | Array | Is | Sorted | and | Rotated.md>) | | | | | | | | | | | | | | | | | | | | | | | | | | | |
94-
| 2 | [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>) | 9 | | | | | | | |
95-
| 3 | [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>) | 16 |
96-
| 4 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
97-
| 5 | 24 | 25 | 26 | 27 | 28 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
98-
| 6 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
90+
| | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 |
91+
|---:|:-------------|:--------|:------------|:-------------|:------------|:---------|:------------|:--------------|:------------|:---------------|:-------------|:-------------|:---------|:-----|:-----|:------------|:-----|:------|:-------|:-----|:------------|:-------------|:--------|:-----------|:-----------|:------------|:----------|:------|:--------|:----------|:-------------|:-----|:-----|:-----------|:-------|:-----|:-----|:-------------|:-------------|:----------|:-----|:------------------|:--------|:------|:--------------|
92+
| 0 | Mo | Tu | We | Th | Fr | Sa | Su | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
93+
| 1 | [1](<_3151. | Special | Array | I.md>) | [2](<_1752. | Check | if | Array | Is | Sorted | and | Rotated.md>) | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
94+
| 2 | [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>) | 9 | | | | | | | | | | | | | |
95+
| 3 | [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>) | [16](<_1718. | Construct | the | Lexicographically | Largest | Valid | Sequence.md>) |
96+
| 4 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
97+
| 5 | 24 | 25 | 26 | 27 | 28 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
98+
| 6 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
9999

100100
| # | Title | Level | Cats | Solution | Languages | Date Complete |
101101
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
102+
| 1718 | [Construct the Lexicographically Largest Valid Sequence](<https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence>) | Medium | Daily | [solution](<_1718. Construct the Lexicographically Largest Valid Sequence.md>) | py | Feb 16, 2025 |
102103
| 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 |
103104
| 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 |
104105
| 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 |

markdowns/Medium.md

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

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

@@ -262,6 +262,7 @@
262262
| 1698 | [Number of Distinct Substrings in a String](<https://leetcode.com/problems/number-of-distinct-substrings-in-a-string>) | Medium | | [solution](<_1698. Number of Distinct Substrings in a String.md>) | java, py | Jun 02, 2024 |
263263
| 1701 | [Average Waiting Time](<https://leetcode.com/problems/average-waiting-time>) | Medium | Daily | [solution](<_1701. Average Waiting Time.md>) | js, py | Jul 09, 2024 |
264264
| 1717 | [Maximum Score From Removing Substrings](<https://leetcode.com/problems/maximum-score-from-removing-substrings>) | Medium | Daily | [solution](<_1717. Maximum Score From Removing Substrings.md>) | py | Jul 12, 2024 |
265+
| 1718 | [Construct the Lexicographically Largest Valid Sequence](<https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence>) | Medium | Daily | [solution](<_1718. Construct the Lexicographically Largest Valid Sequence.md>) | py | Feb 16, 2025 |
265266
| 1721 | [Swapping Nodes in a Linked List](<https://leetcode.com/problems/swapping-nodes-in-a-linked-list>) | Medium | | [solution](<_1721. Swapping Nodes in a Linked List.md>) | c | Jun 07, 2024 |
266267
| 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 |
267268
| 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 |

0 commit comments

Comments
 (0)