Skip to content

Commit b659d5d

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 27baa71 commit b659d5d

10 files changed

+99
-41
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/)** (610 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (611 solved)
22

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

@@ -337,6 +337,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
337337
| 1079 | [Letter Tile Possibilities](<https://leetcode.com/problems/letter-tile-possibilities>) | Medium | Daily | [solution](<markdowns/_1079. Letter Tile Possibilities.md>) | py |
338338
| 1087 | [Brace Expansion](<https://leetcode.com/problems/brace-expansion>) | Medium | | [solution](<markdowns/_1087. Brace Expansion.md>) | py |
339339
| 1092 | [Shortest Common Supersequence ](<https://leetcode.com/problems/shortest-common-supersequence>) | Hard | Daily | [solution](<markdowns/_1092. Shortest Common Supersequence .md>) | py |
340+
| 1100 | [Find K-Length Substrings With No Repeated Characters](<https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters>) | Medium | Weekly Premium | [solution](<markdowns/_1100. Find K-Length Substrings With No Repeated Characters.md>) | py |
340341
| 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 |
341342
| 1105 | [Filling Bookcase Shelves](<https://leetcode.com/problems/filling-bookcase-shelves>) | Medium | Daily | [solution](<markdowns/_1105. Filling Bookcase Shelves.md>) | py |
342343
| 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/Medium.md

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

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

@@ -191,6 +191,7 @@
191191
| 1062 | [Longest Repeating Substring](<https://leetcode.com/problems/longest-repeating-substring>) | Medium | Weekly Premium | [solution](<_1062. Longest Repeating Substring.md>) | py | Aug 01, 2024 |
192192
| 1079 | [Letter Tile Possibilities](<https://leetcode.com/problems/letter-tile-possibilities>) | Medium | Daily | [solution](<_1079. Letter Tile Possibilities.md>) | py | Feb 17, 2025 |
193193
| 1087 | [Brace Expansion](<https://leetcode.com/problems/brace-expansion>) | Medium | | [solution](<_1087. Brace Expansion.md>) | py | Jun 15, 2024 |
194+
| 1100 | [Find K-Length Substrings With No Repeated Characters](<https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters>) | Medium | Weekly Premium | [solution](<_1100. Find K-Length Substrings With No Repeated Characters.md>) | py | Mar 10, 2025 |
194195
| 1101 | [The Earliest Moment When Everyone Become Friends](<https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends>) | Medium | Weekly Premium | [solution](<_1101. The Earliest Moment When Everyone Become Friends.md>) | py | Jul 04, 2024 |
195196
| 1105 | [Filling Bookcase Shelves](<https://leetcode.com/problems/filling-bookcase-shelves>) | Medium | Daily | [solution](<_1105. Filling Bookcase Shelves.md>) | py | Jul 31, 2024 |
196197
| 1110 | [Delete Nodes And Return Forest](<https://leetcode.com/problems/delete-nodes-and-return-forest>) | Medium | Daily | [solution](<_1110. Delete Nodes And Return Forest.md>) | py | Jul 17, 2024 |

‎markdowns/Questions_By_Code_Length.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -459,6 +459,7 @@ Calculations are based on the code files's byte sizes.
459459
| 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 |
460460
| 2620 | [Counter](<https://leetcode.com/problems/counter>) | Easy | | [solution](<_2620. Counter.md>) | js | Jul 09, 2024 |
461461
| 3163 | [String Compression III](<https://leetcode.com/problems/string-compression-iii>) | Medium | Daily | [solution](<_3163. String Compression III.md>) | py | Nov 04, 2024 |
462+
| 1100 | [Find K-Length Substrings With No Repeated Characters](<https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters>) | Medium | Weekly Premium | [solution](<_1100. Find K-Length Substrings With No Repeated Characters.md>) | py | Mar 10, 2025 |
462463
| 2610 | [Convert an Array Into a 2D Array With Conditions](<https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions>) | Medium | | [solution](<_2610. Convert an Array Into a 2D Array With Conditions.md>) | py | Jun 07, 2024 |
463464
| 1783 | [Grand Slam Titles](<https://leetcode.com/problems/grand-slam-titles>) | Medium | | [solution](<_1783. Grand Slam Titles.md>) | sql | Jun 07, 2024 |
464465
| 3106 | [Lexicographically Smallest String After Operations With Constraint](<https://leetcode.com/problems/lexicographically-smallest-string-after-operations-with-constraint>) | Medium | | [solution](<_3106. Lexicographically Smallest String After Operations With Constraint.md>) | py | Jun 29, 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+
| 1100 | [Find K-Length Substrings With No Repeated Characters](<https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters>) | Medium | Weekly Premium | [solution](<_1100. Find K-Length Substrings With No Repeated Characters.md>) | py | Mar 10, 2025 |
910
| 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 |
1011
| 2379 | [Minimum Recolors to Get K Consecutive Black Blocks](<https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks>) | Easy | Daily | [solution](<_2379. Minimum Recolors to Get K Consecutive Black Blocks.md>) | py | Mar 08, 2025 |
1112
| 2523 | [Closest Prime Numbers in Range](<https://leetcode.com/problems/closest-prime-numbers-in-range>) | Medium | Daily | [solution](<_2523. Closest Prime Numbers in Range.md>) | py | Mar 07, 2025 |

‎markdowns/Topics.md

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

77
- [Array](<by_topic/Array.md>) (300 completed)
8-
- [String](<by_topic/String.md>) (141 completed)
9-
- [Hash Table](<by_topic/Hash Table.md>) (135 completed)
8+
- [String](<by_topic/String.md>) (142 completed)
9+
- [Hash Table](<by_topic/Hash Table.md>) (136 completed)
1010
- [Depth-First Search](<by_topic/Depth-First Search.md>) (103 completed)
1111
- [Tree](<by_topic/Tree.md>) (91 completed)
1212
- [Binary Tree](<by_topic/Binary Tree.md>) (82 completed)
@@ -26,7 +26,7 @@
2626
- [Binary Search](<by_topic/Binary Search.md>) (30 completed)
2727
- [Backtracking](<by_topic/Backtracking.md>) (27 completed)
2828
- [Heap (Priority Queue)](<by_topic/Heap (Priority Queue).md>) (26 completed)
29-
- [Sliding Window](<by_topic/Sliding Window.md>) (21 completed)
29+
- [Sliding Window](<by_topic/Sliding Window.md>) (22 completed)
3030
- [Trie](<by_topic/Trie.md>) (19 completed)
3131
- [Prefix Sum](<by_topic/Prefix Sum.md>) (19 completed)
3232
- [Recursion](<by_topic/Recursion.md>) (19 completed)

0 commit comments

Comments
 (0)