Skip to content

Commit 040e555

Browse files
committed
update readme
1 parent 5d7e99d commit 040e555

File tree

5 files changed

+2
-19
lines changed

5 files changed

+2
-19
lines changed

.github/test.txt

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1 @@
1-
3718-smallest-missing-multiple-of-k python easy
2-
3719-longest-balanced-subarray-i python medium
3-
3720-lexicographically-smallest-permutation-greater-than-target python medium
1+
2011-final-value-of-variable-after-performing-operations python easy

Question_List_2001_3000.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,7 @@
44
| 2002 | [Maximum Product of the Length of Two Palindromic Subsequences](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences) | [Python](./Python/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.py) | [Medium](./Readme/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.md) |
55
| 2007 | [Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array) | [Python](./Python/2007-find-original-array-from-doubled-array.py) | [Medium](./Readme/2007-find-original-array-from-doubled-array.md) |
66
| 2009 | [Minimum Number of Operations to Make Array Continuous](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous/) | [Python](./Python/2009-minimum-number-of-operations-to-make-array-continuous.py) | [Hard](./Readme/2009-minimum-number-of-operations-to-make-array-continuous.md) |
7+
| 2011 | [Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/) | [Python](./Python/2011-final-value-of-variable-after-performing-operations.py) | [Easy](./Readme/2011-final-value-of-variable-after-performing-operations.md) |
78
| 2012 | [Sum of Beauty in the Array](https://leetcode.com/problems/sum-of-beauty-in-the-array) | [Python](./Python/2012-sum-of-beauty-in-the-array.py) | [Medium](./Readme/2012-sum-of-beauty-in-the-array.md) |
89
| 2013 | [Detect Squares](https://leetcode.com/problems/detect-squares/) | [Python](./Python/2013-detect-squares.py) | [Medium](./Readme/2013-detect-squares.md) |
910
| 2014 | [Longest Subsequence Repeated K Times](https://leetcode.com/problems/longest-subsequence-repeated-k-times) | [Python](./Python/2014-longest-subsequence-repeated-k-times.py) | [Hard](./Readme/2014-longest-subsequence-repeated-k-times.md) |

README.md

Lines changed: 0 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -115,19 +115,3 @@ It helps others discover the repo and keeps the project growing.
115115
---
116116

117117
Feedback / Questions → open an Issue or reach out on [LinkedIn](https://www.linkedin.com/in/hogan-l/)
118-
119-
<!---LeetCode Topics Start-->
120-
# LeetCode Topics
121-
## Array
122-
| |
123-
| ------- |
124-
| [2137-final-value-of-variable-after-performing-operations](https://github.com/hogan-tech/leetcode-solution/tree/master/2137-final-value-of-variable-after-performing-operations) |
125-
## String
126-
| |
127-
| ------- |
128-
| [2137-final-value-of-variable-after-performing-operations](https://github.com/hogan-tech/leetcode-solution/tree/master/2137-final-value-of-variable-after-performing-operations) |
129-
## Simulation
130-
| |
131-
| ------- |
132-
| [2137-final-value-of-variable-after-performing-operations](https://github.com/hogan-tech/leetcode-solution/tree/master/2137-final-value-of-variable-after-performing-operations) |
133-
<!---LeetCode Topics End-->
File renamed without changes.

0 commit comments

Comments
 (0)