Skip to content

Commit 3e7b369

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent ec07e72 commit 3e7b369

File tree

9 files changed

+68
-21
lines changed

9 files changed

+68
-21
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/)** (664 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (665 solved)
22

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

@@ -700,6 +700,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
700700
| 3249 | [Count the Number of Good Nodes](<https://leetcode.com/problems/count-the-number-of-good-nodes>) | Medium | | [solution](<markdowns/_3249. Count the Number of Good Nodes.md>) | py |
701701
| 3306 | [Count of Substrings Containing Every Vowel and K Consonants II](<https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii>) | Medium | Daily | [solution](<markdowns/_3306. Count of Substrings Containing Every Vowel and K Consonants II.md>) | py |
702702
| 3349 | [Adjacent Increasing Subarrays Detection I](<https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i>) | Easy | Daily | [solution](<markdowns/_3349. Adjacent Increasing Subarrays Detection I.md>) | py |
703+
| 3350 | [Adjacent Increasing Subarrays Detection II](<https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii>) | Medium | Daily | [solution](<markdowns/_3350. Adjacent Increasing Subarrays Detection II.md>) | py |
703704
| 3392 | [Count Subarrays of Length Three With a Condition](<https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition>) | Easy | Daily | [solution](<markdowns/_3392. Count Subarrays of Length Three With a Condition.md>) | py |
704705
| 3396 | [Minimum Number of Operations to Make Elements in Array Distinct](<https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct>) | Easy | Daily | [solution](<markdowns/_3396. Minimum Number of Operations to Make Elements in Array Distinct.md>) | py |
705706
| 3443 | [Maximum Manhattan Distance After K Changes](<https://leetcode.com/problems/maximum-manhattan-distance-after-k-changes>) | Medium | Daily | [solution](<markdowns/_3443. Maximum Manhattan Distance After K Changes.md>) | py |

‎markdowns/Daily_Questions.md‎

Lines changed: 15 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -5,18 +5,19 @@
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
### October 2025
8-
| Su | Mo | Tu | We | Th | Fr | Sa |
9-
|-----:|-----:|------------------------------------------------------------:|-------------------------------:|-----:|----------------------------------------------------------------:|----------------------------------------------------------:|
10-
| | | | [1](<_1518. Water Bottles.md>) | 2 | 3 | 4 |
11-
| 5 | 6 | 7 | 8 | 9 | [10](<_3147. Taking Maximum Energy From the Mystic Dungeon.md>) | [11](<_3186. Maximum Total Damage With Spell Casting.md>) |
12-
| 12 | 13 | [14](<_3349. Adjacent Increasing Subarrays Detection I.md>) | 15 | 16 | 17 | 18 |
13-
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
14-
| 26 | 27 | 28 | 29 | 30 | 31 | |
8+
| Su | Mo | Tu | We | Th | Fr | Sa |
9+
|-----:|-----:|------------------------------------------------------------:|-------------------------------------------------------------:|-----:|----------------------------------------------------------------:|----------------------------------------------------------:|
10+
| | | | [1](<_1518. Water Bottles.md>) | 2 | 3 | 4 |
11+
| 5 | 6 | 7 | 8 | 9 | [10](<_3147. Taking Maximum Energy From the Mystic Dungeon.md>) | [11](<_3186. Maximum Total Damage With Spell Casting.md>) |
12+
| 12 | 13 | [14](<_3349. Adjacent Increasing Subarrays Detection I.md>) | [15](<_3350. Adjacent Increasing Subarrays Detection II.md>) | 16 | 17 | 18 |
13+
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
14+
| 26 | 27 | 28 | 29 | 30 | 31 | |
1515

1616

1717

1818
| # | Title | Level | Cats | Solution | Languages | Date Complete |
1919
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
20+
| 3350 | [Adjacent Increasing Subarrays Detection II](<https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii>) | Medium | Daily | [solution](<_3350. Adjacent Increasing Subarrays Detection II.md>) | py | Oct 15, 2025 |
2021
| 3349 | [Adjacent Increasing Subarrays Detection I](<https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i>) | Easy | Daily | [solution](<_3349. Adjacent Increasing Subarrays Detection I.md>) | py | Oct 14, 2025 |
2122
| 3186 | Weekly Contest 402 - q3 - [Maximum Total Damage With Spell Casting](<https://leetcode.com/problems/maximum-total-damage-with-spell-casting>) | Medium | Contest, Daily | [solution](<_3186. Maximum Total Damage With Spell Casting.md>) | py | Oct 11, 2025 |
2223
| 3147 | [Taking Maximum Energy From the Mystic Dungeon](<https://leetcode.com/problems/taking-maximum-energy-from-the-mystic-dungeon>) | Medium | Daily | [solution](<_3147. Taking Maximum Energy From the Mystic Dungeon.md>) | py | Oct 10, 2025 |
@@ -390,11 +391,11 @@ Dates are for the date I completed the question so due to the my time zone and h
390391

391392

392393
### October 2025
393-
| Su | Mo | Tu | We | Th | Fr | Sa |
394-
|-----:|-----:|------------------------------------------------------------:|-------------------------------:|-----:|----------------------------------------------------------------:|----------------------------------------------------------:|
395-
| | | | [1](<_1518. Water Bottles.md>) | 2 | 3 | 4 |
396-
| 5 | 6 | 7 | 8 | 9 | [10](<_3147. Taking Maximum Energy From the Mystic Dungeon.md>) | [11](<_3186. Maximum Total Damage With Spell Casting.md>) |
397-
| 12 | 13 | [14](<_3349. Adjacent Increasing Subarrays Detection I.md>) | 15 | 16 | 17 | 18 |
398-
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
399-
| 26 | 27 | 28 | 29 | 30 | 31 | |
394+
| Su | Mo | Tu | We | Th | Fr | Sa |
395+
|-----:|-----:|------------------------------------------------------------:|-------------------------------------------------------------:|-----:|----------------------------------------------------------------:|----------------------------------------------------------:|
396+
| | | | [1](<_1518. Water Bottles.md>) | 2 | 3 | 4 |
397+
| 5 | 6 | 7 | 8 | 9 | [10](<_3147. Taking Maximum Energy From the Mystic Dungeon.md>) | [11](<_3186. Maximum Total Damage With Spell Casting.md>) |
398+
| 12 | 13 | [14](<_3349. Adjacent Increasing Subarrays Detection I.md>) | [15](<_3350. Adjacent Increasing Subarrays Detection II.md>) | 16 | 17 | 18 |
399+
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
400+
| 26 | 27 | 28 | 29 | 30 | 31 | |
400401

‎markdowns/Medium.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Medium Questions (421)
1+
# Medium Questions (422)
22

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

@@ -425,5 +425,6 @@
425425
| 3240 | Biweekly Contest 136 - q3 - [Minimum Number of Flips to Make Binary Grid Palindromic II](<https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-ii>) | Medium | Contest | [solution](<_3240. Minimum Number of Flips to Make Binary Grid Palindromic II.md>) | py | Aug 03, 2024 |
426426
| 3249 | [Count the Number of Good Nodes](<https://leetcode.com/problems/count-the-number-of-good-nodes>) | Medium | | [solution](<_3249. Count the Number of Good Nodes.md>) | py | Aug 12, 2024 |
427427
| 3306 | [Count of Substrings Containing Every Vowel and K Consonants II](<https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii>) | Medium | Daily | [solution](<_3306. Count of Substrings Containing Every Vowel and K Consonants II.md>) | py | Mar 10, 2025 |
428+
| 3350 | [Adjacent Increasing Subarrays Detection II](<https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii>) | Medium | Daily | [solution](<_3350. Adjacent Increasing Subarrays Detection II.md>) | py | Oct 15, 2025 |
428429
| 3443 | [Maximum Manhattan Distance After K Changes](<https://leetcode.com/problems/maximum-manhattan-distance-after-k-changes>) | Medium | Daily | [solution](<_3443. Maximum Manhattan Distance After K Changes.md>) | py | Feb 04, 2025 |
429430
| 3460 | [Longest Common Prefix After at Most One Removal](<https://leetcode.com/problems/longest-common-prefix-after-at-most-one-removal>) | Medium | | [solution](<_3460. Longest Common Prefix After at Most One Removal.md>) | py | Feb 17, 2025 |

‎markdowns/Questions_By_Code_Length.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -552,6 +552,7 @@ Calculations are based on the code files's byte sizes.
552552
| 1399 | [Count Largest Group](<https://leetcode.com/problems/count-largest-group>) | Easy | Daily | [solution](<_1399. Count Largest Group.md>) | py | Apr 23, 2025 |
553553
| 3228 | Weekly Contest 407 - q3 - [Maximum Number of Operations to Move Ones to the End](<https://leetcode.com/problems/maximum-number-of-operations-to-move-ones-to-the-end>) | Medium | Contest | [solution](<_3228. Maximum Number of Operations to Move Ones to the End.md>) | py | Jul 21, 2024 |
554554
| 196 | [Delete Duplicate Emails](<https://leetcode.com/problems/delete-duplicate-emails>) | Easy | | [solution](<_196. Delete Duplicate Emails.md>) | py, sql | Jun 07, 2024 |
555+
| 3350 | [Adjacent Increasing Subarrays Detection II](<https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii>) | Medium | Daily | [solution](<_3350. Adjacent Increasing Subarrays Detection II.md>) | py | Oct 15, 2025 |
555556
| 2529 | [Maximum Count of Positive Integer and Negative Integer](<https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer>) | Easy | Daily | [solution](<_2529. Maximum Count of Positive Integer and Negative Integer.md>) | py | Mar 12, 2025 |
556557
| 415 | [Add Strings](<https://leetcode.com/problems/add-strings>) | Easy | | [solution](<_415. Add Strings.md>) | py | Oct 14, 2025 |
557558
| 3516 | [Find Closest Person](<https://leetcode.com/problems/find-closest-person>) | Easy | Daily | [solution](<_3516. Find Closest Person.md>) | go, py | Sep 04, 2025 |

0 commit comments

Comments
 (0)