Skip to content

Commit 1e615a3

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent ab8f2ae commit 1e615a3

File tree

10 files changed

+80
-16
lines changed

10 files changed

+80
-16
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/)** (597 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (598 solved)
22

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

@@ -537,6 +537,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
537537
| 2451 | [Odd String Difference](<https://leetcode.com/problems/odd-string-difference>) | Easy | | [solution](<markdowns/_2451. Odd String Difference.md>) | py |
538538
| 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](<markdowns/_2455. Average Value of Even Numbers That Are Divisible by Three.md>) | java |
539539
| 2458 | [Height of Binary Tree After Subtree Removal Queries](<https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries>) | Hard | Daily | [solution](<markdowns/_2458. Height of Binary Tree After Subtree Removal Queries.md>) | py |
540+
| 2460 | [Apply Operations to an Array](<https://leetcode.com/problems/apply-operations-to-an-array>) | Easy | Daily | [solution](<markdowns/_2460. Apply Operations to an Array.md>) | py |
540541
| 2473 | [Minimum Cost to Buy Apples](<https://leetcode.com/problems/minimum-cost-to-buy-apples>) | Medium | | [solution](<markdowns/_2473. Minimum Cost to Buy Apples.md>) | py |
541542
| 2482 | [Difference Between Ones and Zeros in Row and Column](<https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column>) | Medium | | [solution](<markdowns/_2482. Difference Between Ones and Zeros in Row and Column.md>) | py |
542543
| 2486 | [Append Characters to String to Make Subsequence](<https://leetcode.com/problems/append-characters-to-string-to-make-subsequence>) | Medium | Daily | [solution](<markdowns/_2486. Append Characters to String to Make Subsequence.md>) | c, java, py |

‎markdowns/Daily_Questions.md‎

Lines changed: 21 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -4,19 +4,21 @@
44

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

7-
### February 2025
8-
| Su | Mo | Tu | We | Th | Fr | Sa |
9-
|-------------------------------------------------------------------------:|-----------------------------------------------------------------------------:|-----------------------------------------------------------:|-----------------------------------------------------------------------------------:|------------------------------------------------------------------:|--------------------------------------------------------------------:|-----------------------------------------------------------:|
10-
| | | | | | | [1](<_3151. Special Array I.md>) |
11-
| [2](<_1752. Check if Array Is Sorted and Rotated.md>) | [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>) |
12-
| 9 | [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>) |
13-
| [16](<_1718. Construct the Lexicographically Largest Valid Sequence.md>) | [17](<_1079. Letter Tile Possibilities.md>) | [18](<_2375. Construct Smallest Number From DI String.md>) | [19](<_1415. The k-th Lexicographical String of All Happy Strings of Length n.md>) | [20](<_1980. Find Unique Binary String.md>) | [21](<_1261. Find Elements in a Contaminated Binary Tree.md>) | [22](<_1028. Recover a Tree From Preorder Traversal.md>) |
14-
| 23 | 24 | [25](<_1524. Number of Sub-arrays With Odd Sum.md>) | [26](<_1749. Maximum Absolute Sum of Any Subarray.md>) | 27 | [28](<_1092. Shortest Common Supersequence .md>) | |
7+
### March 2025
8+
| Su | Mo | Tu | We | Th | Fr | Sa |
9+
|-----:|-----:|-----:|-----:|-----:|-----:|----------------------------------------------:|
10+
| | | | | | | [1](<_2460. Apply Operations to an Array.md>) |
11+
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
12+
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
13+
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
14+
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
15+
| 30 | 31 | | | | | |
1516

1617

1718

1819
| # | Title | Level | Cats | Solution | Languages | Date Complete |
1920
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
21+
| 2460 | [Apply Operations to an Array](<https://leetcode.com/problems/apply-operations-to-an-array>) | Easy | Daily | [solution](<_2460. Apply Operations to an Array.md>) | py | Mar 01, 2025 |
2022
| 1092 | [Shortest Common Supersequence ](<https://leetcode.com/problems/shortest-common-supersequence>) | Hard | Daily | [solution](<_1092. Shortest Common Supersequence .md>) | py | Feb 28, 2025 |
2123
| 1749 | [Maximum Absolute Sum of Any Subarray](<https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray>) | Medium | Daily | [solution](<_1749. Maximum Absolute Sum of Any Subarray.md>) | py | Feb 26, 2025 |
2224
| 1524 | [Number of Sub-arrays With Odd Sum](<https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum>) | Medium | Daily | [solution](<_1524. Number of Sub-arrays With Odd Sum.md>) | py | Feb 25, 2025 |
@@ -245,3 +247,14 @@ Dates are for the date I completed the question so due to the my time zone and h
245247
| [16](<_1718. Construct the Lexicographically Largest Valid Sequence.md>) | [17](<_1079. Letter Tile Possibilities.md>) | [18](<_2375. Construct Smallest Number From DI String.md>) | [19](<_1415. The k-th Lexicographical String of All Happy Strings of Length n.md>) | [20](<_1980. Find Unique Binary String.md>) | [21](<_1261. Find Elements in a Contaminated Binary Tree.md>) | [22](<_1028. Recover a Tree From Preorder Traversal.md>) |
246248
| 23 | 24 | [25](<_1524. Number of Sub-arrays With Odd Sum.md>) | [26](<_1749. Maximum Absolute Sum of Any Subarray.md>) | 27 | [28](<_1092. Shortest Common Supersequence .md>) | |
247249

250+
251+
### March 2025
252+
| Su | Mo | Tu | We | Th | Fr | Sa |
253+
|-----:|-----:|-----:|-----:|-----:|-----:|----------------------------------------------:|
254+
| | | | | | | [1](<_2460. Apply Operations to an Array.md>) |
255+
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
256+
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
257+
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
258+
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
259+
| 30 | 31 | | | | | |
260+

‎markdowns/Easy.md‎

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

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

@@ -140,6 +140,7 @@
140140
| 2423 | [Remove Letter To Equalize Frequency](<https://leetcode.com/problems/remove-letter-to-equalize-frequency>) | Easy | | [solution](<_2423. Remove Letter To Equalize Frequency.md>) | py | Jun 17, 2024 |
141141
| 2451 | [Odd String Difference](<https://leetcode.com/problems/odd-string-difference>) | Easy | | [solution](<_2451. Odd String Difference.md>) | py | Sep 25, 2024 |
142142
| 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 |
143+
| 2460 | [Apply Operations to an Array](<https://leetcode.com/problems/apply-operations-to-an-array>) | Easy | Daily | [solution](<_2460. Apply Operations to an Array.md>) | py | Mar 01, 2025 |
143144
| 2570 | [Merge Two 2D Arrays by Summing Values](<https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values>) | Easy | | [solution](<_2570. Merge Two 2D Arrays by Summing Values.md>) | c | Jun 10, 2024 |
144145
| 2582 | [Pass the Pillow](<https://leetcode.com/problems/pass-the-pillow>) | Easy | Daily | [solution](<_2582. Pass the Pillow.md>) | c, cpp, cs, java, js, py | Jul 06, 2024 |
145146
| 2619 | [Array Prototype Last](<https://leetcode.com/problems/array-prototype-last>) | Easy | | [solution](<_2619. Array Prototype Last.md>) | js | Jul 10, 2024 |

‎markdowns/Questions_By_Code_Length.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -489,6 +489,7 @@ Calculations are based on the code files's byte sizes.
489489
| 2599 | [Make the Prefix Sum Non-negative](<https://leetcode.com/problems/make-the-prefix-sum-non-negative>) | Medium | Weekly Premium | [solution](<_2599. Make the Prefix Sum Non-negative.md>) | py | Feb 10, 2025 |
490490
| 2545 | [Sort the Students by Their Kth Score](<https://leetcode.com/problems/sort-the-students-by-their-kth-score>) | Medium | | [solution](<_2545. Sort the Students by Their Kth Score.md>) | java, py | Jun 24, 2024 |
491491
| 392 | [Is Subsequence](<https://leetcode.com/problems/is-subsequence>) | Easy | | [solution](<_392. Is Subsequence.md>) | java | Jun 22, 2024 |
492+
| 2460 | [Apply Operations to an Array](<https://leetcode.com/problems/apply-operations-to-an-array>) | Easy | Daily | [solution](<_2460. Apply Operations to an Array.md>) | py | Mar 01, 2025 |
492493
| 2807 | [Insert Greatest Common Divisors in Linked List](<https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list>) | Medium | Daily | [solution](<_2807. Insert Greatest Common Divisors in Linked List.md>) | py | Jun 13, 2024 |
493494
| 167 | [Two Sum II - Input Array Is Sorted](<https://leetcode.com/problems/two-sum-ii-input-array-is-sorted>) | Medium | N150 | [solution](<_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 14, 2024 |
494495
| 2634 | [Filter Elements from Array](<https://leetcode.com/problems/filter-elements-from-array>) | Easy | | [solution](<_2634. Filter Elements from Array.md>) | js | Jul 09, 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+
| 2460 | [Apply Operations to an Array](<https://leetcode.com/problems/apply-operations-to-an-array>) | Easy | Daily | [solution](<_2460. Apply Operations to an Array.md>) | py | Mar 01, 2025 |
910
| 1092 | [Shortest Common Supersequence ](<https://leetcode.com/problems/shortest-common-supersequence>) | Hard | Daily | [solution](<_1092. Shortest Common Supersequence .md>) | py | Feb 28, 2025 |
1011
| 53 | [Maximum Subarray](<https://leetcode.com/problems/maximum-subarray>) | Medium | B75, N150 | [solution](<_53. Maximum Subarray.md>) | py | Feb 26, 2025 |
1112
| 1524 | [Number of Sub-arrays With Odd Sum](<https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum>) | Medium | Daily | [solution](<_1524. Number of Sub-arrays With Odd Sum.md>) | py | Feb 26, 2025 |

0 commit comments

Comments
 (0)