Skip to content

Commit 8c5ebca

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 51a6516 commit 8c5ebca

File tree

491 files changed

+595
-492
lines changed

Some content is hidden

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

491 files changed

+595
-492
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/)** (593 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (594 solved)
22

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

@@ -449,6 +449,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
449449
| 1740 | [Find Distance in a Binary Tree](<https://leetcode.com/problems/find-distance-in-a-binary-tree>) | Medium | Weekly Premium | [solution](<markdowns/_1740. Find Distance in a Binary Tree.md>) | py |
450450
| 1743 | [Restore the Array From Adjacent Pairs](<https://leetcode.com/problems/restore-the-array-from-adjacent-pairs>) | Medium | | [solution](<markdowns/_1743. Restore the Array From Adjacent Pairs.md>) | py |
451451
| 1748 | [Sum of Unique Elements](<https://leetcode.com/problems/sum-of-unique-elements>) | Easy | | [solution](<markdowns/_1748. Sum of Unique Elements.md>) | c |
452+
| 1749 | [Maximum Absolute Sum of Any Subarray](<https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray>) | Medium | | [solution](<markdowns/_1749. Maximum Absolute Sum of Any Subarray.md>) | py |
452453
| 1752 | [Check if Array Is Sorted and Rotated](<https://leetcode.com/problems/check-if-array-is-sorted-and-rotated>) | Easy | Daily | [solution](<markdowns/_1752. Check if Array Is Sorted and Rotated.md>) | py |
453454
| 1756 | [Design Most Recently Used Queue](<https://leetcode.com/problems/design-most-recently-used-queue>) | Medium | Weekly Premium | [solution](<markdowns/_1756. Design Most Recently Used Queue.md>) | py |
454455
| 1759 | [Count Number of Homogenous Substrings](<https://leetcode.com/problems/count-number-of-homogenous-substrings>) | Medium | | [solution](<markdowns/_1759. Count Number of Homogenous Substrings.md>) | c, java |
@@ -634,6 +635,6 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
634635
| 3248 | [Snake in Matrix](<https://leetcode.com/problems/snake-in-matrix>) | Easy | | [solution](<markdowns/_3248. Snake in Matrix.md>) | py |
635636
| 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 |
636637
| 3443 | [Maximum Manhattan Distance After K Changes](<https://leetcode.com/problems/maximum-manhattan-distance-after-k-changes>) | Medium | | [solution](<markdowns/_3443. Maximum Manhattan Distance After K Changes.md>) | py |
637-
| 3460 | Question 3460 | Medium | | [solution](<markdowns/_3460. Question 3460.md>) | py |
638+
| 3460 | [Longest Common Prefix After at Most One Removal](<https://leetcode.com/problems/longest-common-prefix-after-at-most-one-removal>) | Medium | | [solution](<markdowns/_3460. Longest Common Prefix After at Most One Removal.md>) | py |
638639

639640
<p align="right"><i>This README was generated using <a href="https://github.com/Zanger67/WikiLeet">WikiLeet</a></i></p>

‎markdowns/Medium.md‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Medium Questions (384)
1+
# Medium Questions (385)
22

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

@@ -273,6 +273,7 @@
273273
| 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 |
274274
| 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 |
275275
| 1743 | [Restore the Array From Adjacent Pairs](<https://leetcode.com/problems/restore-the-array-from-adjacent-pairs>) | Medium | | [solution](<_1743. Restore the Array From Adjacent Pairs.md>) | py | Jun 27, 2024 |
276+
| 1749 | [Maximum Absolute Sum of Any Subarray](<https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray>) | Medium | | [solution](<_1749. Maximum Absolute Sum of Any Subarray.md>) | py | Feb 26, 2025 |
276277
| 1756 | [Design Most Recently Used Queue](<https://leetcode.com/problems/design-most-recently-used-queue>) | Medium | Weekly Premium | [solution](<_1756. Design Most Recently Used Queue.md>) | py | Feb 15, 2025 |
277278
| 1759 | [Count Number of Homogenous Substrings](<https://leetcode.com/problems/count-number-of-homogenous-substrings>) | Medium | | [solution](<_1759. Count Number of Homogenous Substrings.md>) | c, java | Jun 10, 2024 |
278279
| 1762 | [Buildings With an Ocean View](<https://leetcode.com/problems/buildings-with-an-ocean-view>) | Medium | | [solution](<_1762. Buildings With an Ocean View.md>) | py | Jun 10, 2024 |
@@ -389,4 +390,4 @@
389390
| 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 |
390391
| 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 |
391392
| 3443 | [Maximum Manhattan Distance After K Changes](<https://leetcode.com/problems/maximum-manhattan-distance-after-k-changes>) | Medium | | [solution](<_3443. Maximum Manhattan Distance After K Changes.md>) | py | Feb 04, 2025 |
392-
| 3460 | Question 3460 | Medium | | [solution](<_3460. Question 3460.md>) | py | Feb 17, 2025 |
393+
| 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: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -350,6 +350,7 @@ Calculations are based on the code files's byte sizes.
350350
| 49 | [Group Anagrams](<https://leetcode.com/problems/group-anagrams>) | Medium | B75, N150 | [solution](<_49. Group Anagrams.md>) | py | Jun 13, 2024 |
351351
| 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence](<https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence>) | Easy | Daily | [solution](<_1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md>) | py | Jun 01, 2024 |
352352
| 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 |
353+
| 1749 | [Maximum Absolute Sum of Any Subarray](<https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray>) | Medium | | [solution](<_1749. Maximum Absolute Sum of Any Subarray.md>) | py | Feb 26, 2025 |
353354
| 1267 | [Count Servers that Communicate](<https://leetcode.com/problems/count-servers-that-communicate>) | Medium | Daily | [solution](<_1267. Count Servers that Communicate.md>) | py | Jan 23, 2025 |
354355
| 1929 | [Concatenation of Array](<https://leetcode.com/problems/concatenation-of-array>) | Easy | | [solution](<_1929. Concatenation of Array.md>) | c, java, py | Jun 03, 2024 |
355356
| 1026 | [Maximum Difference Between Node and Ancestor](<https://leetcode.com/problems/maximum-difference-between-node-and-ancestor>) | Medium | | [solution](<_1026. Maximum Difference Between Node and Ancestor.md>) | py | Jun 23, 2024 |
@@ -529,7 +530,7 @@ Calculations are based on the code files's byte sizes.
529530
| 175 | [Combine Two Tables](<https://leetcode.com/problems/combine-two-tables>) | Easy | | [solution](<_175. Combine Two Tables.md>) | py, sql | May 22, 2024 |
530531
| 848 | [Shifting Letters](<https://leetcode.com/problems/shifting-letters>) | Medium | | [solution](<_848. Shifting Letters.md>) | py | Jun 29, 2024 |
531532
| 1641 | [Count Sorted Vowel Strings](<https://leetcode.com/problems/count-sorted-vowel-strings>) | Medium | | [solution](<_1641. Count Sorted Vowel Strings.md>) | c, cpp, java | Jun 24, 2024 |
532-
| 3460 | Question 3460 | Medium | | [solution](<_3460. Question 3460.md>) | py | Feb 17, 2025 |
533+
| 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 |
533534
| 2455 | [Average Value of Even Numbers That Are Divisible by Three](<https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three>) | Easy | | [solution](<_2455. Average Value of Even Numbers That Are Divisible by Three.md>) | java | Jul 04, 2024 |
534535
| 3184 | Weekly Contest 402 - q1 - [Count Pairs That Form a Complete Day I](<https://leetcode.com/problems/count-pairs-that-form-a-complete-day-i>) | Easy | Contest | [solution](<_3184. Count Pairs That Form a Complete Day I.md>) | py | Jul 07, 2024 |
535536
| 3226 | Weekly Contest 407 - q1 - [Number of Bit Changes to Make Two Integers Equal](<https://leetcode.com/problems/number-of-bit-changes-to-make-two-integers-equal>) | Easy | Contest | [solution](<_3226. Number of Bit Changes to Make Two Integers Equal.md>) | py | Jul 21, 2024 |

0 commit comments

Comments
 (0)