You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+2-1Lines changed: 2 additions & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -336,6 +336,7 @@ The solutions are organized as follows:
336
336
|2009|[Minimum Number of Operations to Make Array Continuous](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous/)|[Python](./2009-minimum-number-of-operations-to-make-array-continuous/2009-minimum-number-of-operations-to-make-array-continuous.py)|[Hard](./2009-minimum-number-of-operations-to-make-array-continuous/README.md)|
337
337
|2038|[Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/)|[Python](./2038-remove-colored-pieces-if-both-neighbors-are-the-same-color/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.py)|[Medium](./2038-remove-colored-pieces-if-both-neighbors-are-the-same-color/README.md)|
338
338
|2050|[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/)|[Python](./2050-number-of-different-integers-in-a-string/2050-number-of-different-integers-in-a-string.py)|[Easy](./2050-number-of-different-integers-in-a-string/README.md)|
339
+
|2125|[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/)|[Python](./2125-number-of-laser-beams-in-a-bank/2125-number-of-laser-beams-in-a-bank.py)|[Medium](./2125-number-of-laser-beams-in-a-bank/README.md)|
339
340
|2141|[Maximum Running Time of N Computers](https://leetcode.com/problems/maximum-running-time-of-n-computers/)|[Python](./2141-maximum-running-time-of-n-computers/2141-maximum-running-time-of-n-computers.py)|[Hard](./2141-maximum-running-time-of-n-computers/README.md)|
340
341
|2147|[Number of Ways to Divide a Long Corridor](https://leetcode.com/problems/number-of-ways-to-divide-a-long-corridor/)|[Python](./2147-number-of-ways-to-divide-a-long-corridor/2147-number-of-ways-to-divide-a-long-corridor.py)|[Hard](./2147-number-of-ways-to-divide-a-long-corridor/README.md)|
341
342
|2251|[Number of Flowers in Full Bloom](https://leetcode.com/problems/number-of-flowers-in-full-bloom/)|[Python](./2251-number-of-flowers-in-full-bloom/2251-number-of-flowers-in-full-bloom.py)|[Hard](./2251-number-of-flowers-in-full-bloom/README.md)|
@@ -417,7 +418,7 @@ The solutions are organized as follows:
417
418
|2833|[Furthest Point from Origin](https://leetcode.com/problems/furthest-point-from-origin/)|[Python](./2833-furthest-point-from-origin/2833-furthest-point-from-origin.py)|[Easy](./2833-furthest-point-from-origin/README.md)|
418
419
|2834|[Find the Minimum Possible Sum of a Beautiful Array](https://leetcode.com/problems/find-the-minimum-possible-sum-of-a-beautiful-array/)|[Python](./2834-find-the-minimum-possible-sum-of-a-beautiful-array/2834-find-the-minimum-possible-sum-of-a-beautiful-array.py)|[Medium](./2834-find-the-minimum-possible-sum-of-a-beautiful-array/README.md)|
419
420
|2849|[Determine if a Cell is Reachable at a Given Time](https://leetcode.com/problems/determine-if-a-cell-is-reachable-at-a-given-time/)|[Python](./2849-determine-if-a-cell-is-reachable-at-a-given-time/2849-determine-if-a-cell-is-reachable-at-a-given-time.py)|[Medium](./2849-determine-if-a-cell-is-reachable-at-a-given-time/README.md)|
420
-
|2125|[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/)|[Python](./2125-number-of-laser-beams-in-a-bank/2125-number-of-laser-beams-in-a-bank.py)|[Medium](./2125-number-of-laser-beams-in-a-bank/README.md)|
421
+
|2870|[Minimum Number of Operations to Make Array Empty](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-empty/)|[Python](./2870-minimum-number-of-operations-to-make-array-empty/2870-minimum-number-of-operations-to-make-array-empty.py)|[Medium](./2870-minimum-number-of-operations-to-make-array-empty/README.md)|
0 commit comments