Skip to content

Commit 5e2ddca

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent a7880f3 commit 5e2ddca

File tree

11 files changed

+71
-26
lines changed

11 files changed

+71
-26
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/)** (680 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (681 solved)
22

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

@@ -550,6 +550,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
550550
| 2134 | [Minimum Swaps to Group All 1's Together II](<https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii>) | Medium | Daily | [solution](<markdowns/_2134. Minimum Swaps to Group All 1's Together II.md>) | py |
551551
| 2145 | [Count the Hidden Sequences](<https://leetcode.com/problems/count-the-hidden-sequences>) | Medium | Daily | [solution](<markdowns/_2145. Count the Hidden Sequences.md>) | py |
552552
| 2149 | [Rearrange Array Elements by Sign](<https://leetcode.com/problems/rearrange-array-elements-by-sign>) | Medium | | [solution](<markdowns/_2149. Rearrange Array Elements by Sign.md>) | c, py |
553+
| 2154 | [Keep Multiplying Found Values by Two](<https://leetcode.com/problems/keep-multiplying-found-values-by-two>) | Easy | Daily | [solution](<markdowns/_2154. Keep Multiplying Found Values by Two.md>) | py |
553554
| 2161 | [Partition Array According to Given Pivot](<https://leetcode.com/problems/partition-array-according-to-given-pivot>) | Medium | Daily | [solution](<markdowns/_2161. Partition Array According to Given Pivot.md>) | py |
554555
| 2165 | [Smallest Value of the Rearranged Number](<https://leetcode.com/problems/smallest-value-of-the-rearranged-number>) | Medium | | [solution](<markdowns/_2165. Smallest Value of the Rearranged Number.md>) | py |
555556
| 2169 | [Count Operations to Obtain Zero](<https://leetcode.com/problems/count-operations-to-obtain-zero>) | Easy | Daily | [solution](<markdowns/_2169. Count Operations to Obtain Zero.md>) | py |

‎markdowns/Daily_Questions.md‎

Lines changed: 17 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -5,19 +5,20 @@
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
### November 2025
8-
| Su | Mo | Tu | We | Th | Fr | Sa |
9-
|-------------------------------------------------:|----------------------------------------------------:|--------------------------------------------:|-----:|-----------------------------------------------------------------------:|-----:|----------------------------------------------------------------:|
10-
| | | | | | | [1](<_3217. Delete Nodes From Linked List Present in Array.md>) |
11-
| 2 | [3](<_1578. Minimum Time to Make Rope Colorful.md>) | 4 | 5 | 6 | 7 | 8 |
12-
| [9](<_2169. Count Operations to Obtain Zero.md>) | 10 | 11 | 12 | [13](<_3228. Maximum Number of Operations to Move Ones to the End.md>) | 14 | 15 |
13-
| 16 | 17 | [18](<_717. 1-bit and 2-bit Characters.md>) | 19 | 20 | 21 | 22 |
14-
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
15-
| 30 | | | | | | |
8+
| Su | Mo | Tu | We | Th | Fr | Sa |
9+
|-------------------------------------------------:|----------------------------------------------------:|--------------------------------------------:|-------------------------------------------------------:|-----------------------------------------------------------------------:|-----:|----------------------------------------------------------------:|
10+
| | | | | | | [1](<_3217. Delete Nodes From Linked List Present in Array.md>) |
11+
| 2 | [3](<_1578. Minimum Time to Make Rope Colorful.md>) | 4 | 5 | 6 | 7 | 8 |
12+
| [9](<_2169. Count Operations to Obtain Zero.md>) | 10 | 11 | 12 | [13](<_3228. Maximum Number of Operations to Move Ones to the End.md>) | 14 | 15 |
13+
| 16 | 17 | [18](<_717. 1-bit and 2-bit Characters.md>) | [19](<_2154. Keep Multiplying Found Values by Two.md>) | 20 | 21 | 22 |
14+
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
15+
| 30 | | | | | | |
1616

1717

1818

1919
| # | Title | Level | Cats | Solution | Languages | Date Complete |
2020
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
21+
| 2154 | [Keep Multiplying Found Values by Two](<https://leetcode.com/problems/keep-multiplying-found-values-by-two>) | Easy | Daily | [solution](<_2154. Keep Multiplying Found Values by Two.md>) | py | Nov 19, 2025 |
2122
| 717 | [1-bit and 2-bit Characters](<https://leetcode.com/problems/1-bit-and-2-bit-characters>) | Easy | Daily | [solution](<_717. 1-bit and 2-bit Characters.md>) | py | Nov 18, 2025 |
2223
| 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, Daily | [solution](<_3228. Maximum Number of Operations to Move Ones to the End.md>) | py | Nov 13, 2025 |
2324
| 2169 | [Count Operations to Obtain Zero](<https://leetcode.com/problems/count-operations-to-obtain-zero>) | Easy | Daily | [solution](<_2169. Count Operations to Obtain Zero.md>) | py | Nov 09, 2025 |
@@ -413,12 +414,12 @@ Dates are for the date I completed the question so due to the my time zone and h
413414

414415

415416
### November 2025
416-
| Su | Mo | Tu | We | Th | Fr | Sa |
417-
|-------------------------------------------------:|----------------------------------------------------:|--------------------------------------------:|-----:|-----------------------------------------------------------------------:|-----:|----------------------------------------------------------------:|
418-
| | | | | | | [1](<_3217. Delete Nodes From Linked List Present in Array.md>) |
419-
| 2 | [3](<_1578. Minimum Time to Make Rope Colorful.md>) | 4 | 5 | 6 | 7 | 8 |
420-
| [9](<_2169. Count Operations to Obtain Zero.md>) | 10 | 11 | 12 | [13](<_3228. Maximum Number of Operations to Move Ones to the End.md>) | 14 | 15 |
421-
| 16 | 17 | [18](<_717. 1-bit and 2-bit Characters.md>) | 19 | 20 | 21 | 22 |
422-
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
423-
| 30 | | | | | | |
417+
| Su | Mo | Tu | We | Th | Fr | Sa |
418+
|-------------------------------------------------:|----------------------------------------------------:|--------------------------------------------:|-------------------------------------------------------:|-----------------------------------------------------------------------:|-----:|----------------------------------------------------------------:|
419+
| | | | | | | [1](<_3217. Delete Nodes From Linked List Present in Array.md>) |
420+
| 2 | [3](<_1578. Minimum Time to Make Rope Colorful.md>) | 4 | 5 | 6 | 7 | 8 |
421+
| [9](<_2169. Count Operations to Obtain Zero.md>) | 10 | 11 | 12 | [13](<_3228. Maximum Number of Operations to Move Ones to the End.md>) | 14 | 15 |
422+
| 16 | 17 | [18](<_717. 1-bit and 2-bit Characters.md>) | [19](<_2154. Keep Multiplying Found Values by Two.md>) | 20 | 21 | 22 |
423+
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
424+
| 30 | | | | | | |
424425

‎markdowns/Easy.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Easy Questions (204)
1+
# Easy Questions (205)
22

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

@@ -150,6 +150,7 @@
150150
| 2037 | [Minimum Number of Moves to Seat Everyone](<https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone>) | Easy | Daily | [solution](<_2037. Minimum Number of Moves to Seat Everyone.md>) | c, py | Jun 03, 2024 |
151151
| 2053 | [Kth Distinct String in an Array](<https://leetcode.com/problems/kth-distinct-string-in-an-array>) | Easy | Daily | [solution](<_2053. Kth Distinct String in an Array.md>) | py | Aug 05, 2024 |
152152
| 2085 | [Count Common Words With One Occurrence](<https://leetcode.com/problems/count-common-words-with-one-occurrence>) | Easy | | [solution](<_2085. Count Common Words With One Occurrence.md>) | py | Oct 14, 2025 |
153+
| 2154 | [Keep Multiplying Found Values by Two](<https://leetcode.com/problems/keep-multiplying-found-values-by-two>) | Easy | Daily | [solution](<_2154. Keep Multiplying Found Values by Two.md>) | py | Nov 19, 2025 |
153154
| 2169 | [Count Operations to Obtain Zero](<https://leetcode.com/problems/count-operations-to-obtain-zero>) | Easy | Daily | [solution](<_2169. Count Operations to Obtain Zero.md>) | py | Nov 09, 2025 |
154155
| 2206 | [Divide Array Into Equal Pairs](<https://leetcode.com/problems/divide-array-into-equal-pairs>) | Easy | Daily | [solution](<_2206. Divide Array Into Equal Pairs.md>) | c, py | Jun 08, 2024 |
155156
| 2235 | [Add Two Integers](<https://leetcode.com/problems/add-two-integers>) | Easy | | [solution](<_2235. Add Two Integers.md>) | py | Oct 10, 2025 |

0 commit comments

Comments
 (0)