Skip to content

Commit ecaade9

Browse files
enginebaienginebai
committed
Split all problems out to be a single file
1 parent 2a66fbb commit ecaade9

13 files changed

+470
-474
lines changed

‎leetcode/README.md‎

Lines changed: 11 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,17 @@
22
### Practice Guidelines
33

44
> TODO
5-
5+
* [Array](./array-problems.md)
6+
* [String](./string-problems.md)
7+
* [Hash Table](./hash-table-problems.md)
8+
* [Binary Search](./binary-search-problems.md)
9+
* [Linked List](./linked-list-problems.md)
10+
* [Stack & Queue](./stack-queue-problems.md)
611
* [Tree](./tree-problems.md)
712
* [Binary Search Tree](./bst-problems.md)
813
* [Heap](./heap-problems.md)
9-
* [Graph](./graph-problems.md)
14+
* [Graph](./graph-problems.md)
15+
* [Dynamic Programming](./dynamic-programming-problems.md)
16+
* [Greedy](./greedy-problems.md)
17+
* [Backtracking](./backtracking-problems.md)
18+
* [Design](./design-problems.md)

‎leetcode/array-problems.md‎

Lines changed: 100 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,100 @@
1+
## [Array](../topics/array.md)
2+
| Problem | Difficulty |
3+
|------------------|------------|
4+
|[989. Add to Array-Form of Integer](../leetcode/989.add-to-array-form-of-integer.md)|Easy|
5+
|[238. Product of Array Except Self](../leetcode/238.product-of-array-except-self.md)|Medium|
6+
|[2909. Minimum Sum of Mountain Triplets II](../leetcode/2909.minimum-sum-of-mountain-triplets-ii.md)|Medium|
7+
|[2874. Maximum Value of an Ordered Triplet II](../leetcode/2874.maximum-value-of-an-ordered-triplet-ii.md)|Medium|
8+
|[581. Shortest Unsorted Continuous Subarray](../leetcode/581.shortest-unsorted-continuous-subarray.md)|Medium|
9+
|[941. Valid Mountain Array](../leetcode/941.valid-mountain-array.md)|Easy|
10+
|[845. Longest Mountain in Array](../leetcode/845.longest-mountain-in-array.md)|Medium|
11+
|[73. Set Matrix Zeroes](../leetcode/73.set-matrix-zeros.md)|Medium|
12+
|[766. Toeplitz Matrix](../leetcode/76.minimum-window-substring.md)|Easy|
13+
|[48. Rotate Image](../leetcode/48.rotate-image.md)|Medium|
14+
|[54. Spiral Matrix](../leetcode/54.spiral-matrix.md)|Medium|
15+
|[59. Spiral Matrix II](../leetcode/59.spiral-matrix-ii.md)|Medium|
16+
|[221. Maximal Square](../leetcode/221.maximal-square.md)|Medium|
17+
|[621. Task Scheduler](../leetcode/621.task-scheduler.md)|Medium|
18+
|[189. Rotate Array](../leetcode/189.rotate-array.md)|Medium|
19+
|[136. Single Number](../leetcode/136.single-number.md)|Easy|
20+
|[31. Next Permutation](../leetcode/31.next-permutation.md)|Medium|
21+
22+
> * https://leetcode.com/problems/valid-palindrome-ii/ 8k e
23+
> * https://leetcode.com/problems/diagonal-traverse-ii/
24+
> * https://leetcode.com/problems/number-of-matching-subsequences/ 5k m
25+
> ----
26+
> * https://leetcode.com/problems/burst-balloons/ 7k h
27+
> * https://leetcode.com/problems/reverse-pairs/ 6k h
28+
> * https://leetcode.com/problems/couples-holding-hands/ 2k h
29+
> * https://leetcode.com/problems/swim-in-rising-water/ 3k h
30+
> * https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/ 3k h
31+
> * https://leetcode.com/problems/maximum-performance-of-a-team/ 3k h
32+
> * https://leetcode.com/problems/minimize-deviation-in-array/ 2k h
33+
34+
### Two Pointers
35+
| Problem | Difficulty |
36+
|------------------|------------|
37+
|[167. Two Sum II - Input Array Is Sorted](../leetcode/167.two-sum-ii-input-array-is-sorted.md)|Medium|
38+
|[15. 3Sum](../leetcode/15.3sum.md)|Medium|
39+
|[16. 3Sum Closest](../leetcode/16.3sum-closest.md)|Medium|
40+
|[11. Container With Most Water](../leetcode/11.container-with-most-water.md)|Medium|
41+
|[977. Squares of a Sorted Array](../leetcode/977.squares-of-a-sorted-array.md)|Easy|
42+
|[283. Move Zeroes](../leetcode/283.move-zeros.md)|Easy|
43+
|[26. Remove Duplicates from Sorted Array](../leetcode/26.remove-duplicates-from-sorted-array.md)|Easy|
44+
|[80. Remove Duplicates from Sorted Array II](../leetcode/80.remove-duplicates-from-sorted-array-ii.md)|Medium|
45+
|[905. Sort Array By Parity](../leetcode/905.sort-array-by-parity.md)|Easy|
46+
47+
### Sliding Windows
48+
| Problem | Difficulty |
49+
|------------------|------------|
50+
|[438. Find All Anagrams in a String](../leetcode/438.find-all-anagrams-in-a-string.md)|Medium|
51+
|[567. Permutation in String](../leetcode/567.permutation-in-string.md)|Medium|
52+
|[3. Longest Substring Without Repeating Characters](../leetcode/3.longest-substring-without-repeating-characters.md)|Medium|
53+
|[1004. Max Consecutive Ones III](../leetcode/1004.max-consecutive-ones-iii.md)|Medium|
54+
|[209. Minimum Size Subarray Sum](../leetcode/209.minimum-size-subarray-sum.md)|Medium|
55+
|[424. Longest Repeating Character Replacement](../leetcode/424.longest-repeating-character-replacement.md)|Medium|
56+
|[713. Subarray Product Less Than K](../leetcode/713.subarray-product-less-than-k.md)|Medium|
57+
|[674. Longest Continuous Increasing Subsequence](../leetcode/674.longest-continuous-increasing-subsequence.md)|Easy|
58+
|[76. Minimum Window Substring](../leetcode/76.minimum-window-substring.md)|Hard|
59+
|[239. Sliding Window Maximum](../leetcode/239.sliding-window-maximium.md)|Hard|
60+
|[1876. Substrings of Size Three with Distinct Characters](../leetcode/1876.substrings-of-size-three-with-distinct-characters.md)|Easy|
61+
|[2461. Maximum Sum of Distinct Subarrays With Length K](../leetcode/2461.maximum-sum-of-distinct-subarrays-with-length-k.md)|Medium|
62+
|[2875. Minimum Size Subarray in Infinite Array](../leetcode/2875.minimum-size-subarray-in-infinite-array.md)|Medium|
63+
64+
> * https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/ 5k m
65+
> * https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/ 6k m
66+
> * https://leetcode.com/problems/fruit-into-baskets/ 4k m
67+
> * https://leetcode.com/problems/count-number-of-nice-subarrays/ 4k m
68+
> * https://leetcode.com/problems/binary-subarrays-with-sum/ 3k m
69+
> * https://leetcode.com/problems/longest-nice-subarray/description/ 1k m
70+
> * https://leetcode.com/problems/word-subsets 3k m
71+
> * https://leetcode.com/problems/frequency-of-the-most-frequent-element
72+
> ----
73+
> * https://leetcode.com/problems/subarrays-with-k-different-integers/ 4k h
74+
> * https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/ 4k h
75+
76+
### [Sorting](../topics/sorting.md)
77+
| Problem | Difficulty |
78+
|------------------|------------|
79+
|[88. Merge Sorted Array](../leetcode/88.merge-sorted-array.md)|Easy|
80+
|[912. Sort an Array](../topics/sorting.md)|Medium|
81+
|[75. Sort Colors](../leetcode/75.sort-colors.md)|Medium|
82+
|[148. Sort List](../leetcode/148.sort-list.md)|Medium|
83+
84+
### Intervals
85+
| Problem | Difficulty |
86+
|------------------|------------|
87+
|[56. Merge Intervals](../leetcode/56.merge-intervals.md)|Medium|
88+
|[57. Insert Interval](../leetcode/57.insert-interval.md)|Medium|
89+
|[986. Interval List Intersections](../leetcode/986.interval-list-intersections.md)|Medium|
90+
|[452. Minimum Number of Arrows to Burst Balloons](../leetcode/452.minimum-number-of-arrows-to-burst-balloons.md)|Medium|
91+
|[1094. Car Pooling](../leetcode/1094.car-pooling.md)|Medium|
92+
93+
> Study guidelines: https://leetcode.com/discuss/study-guide/2166045/ (Have reviwed the problem listing)
94+
> https://leetcode.cn/problems/my-calendar-i/solutions/1646264/by-jiang-hui-4-pyfn/
95+
> * https://leetcode.com/problems/non-overlapping-intervals/description/ 8k m
96+
> * https://leetcode.com/problems/number-of-flowers-in-full-bloom 1k h
97+
> * https://leetcode.com/problems/points-that-intersect-with-cars/description/
98+
> * https://leetcode.com/problems/my-calendar-ii/description/ 2k m
99+
> ----
100+
> * https://leetcode.com/problems/maximum-population-year/description/ 1k e

‎leetcode/backtracking-problems.md‎

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
## [Backtracking](../topics/backtracking.md)
2+
| Problem | Difficulty |
3+
|------------------|------------|
4+
|[77. Combinations](../leetcode/77.combinations.md)|Medium|
5+
|[39. Combination Sum](../leetcode/39.combination-sum.md)|Medium|
6+
|[40. Combination Sum II](../leetcode/40.combination-sum-ii.md)|Medium|
7+
|[216. Combination Sum III](../leetcode/216.combination-sum-iii.md)|Medium|
8+
|[22. Generate Parentheses](../leetcode/22.generate-parentheses.md)|Medium|
9+
|[17. Letter Combinations of a Phone Number](../leetcode/17.letter-combinations-of-a-phone-number.md)|Medium|
10+
|[79. Word Search](../leetcode/79.word-search.md)|Medium|
11+
|[78. Subsets](../leetcode/78.subsets.md)|Medium|
12+
|[90. Subsets II](../leetcode/90.subsets-ii.md)|Medium|
13+
|[46. Permutations](../leetcode/46.permutations.md)|Medium|
14+
|[47. Permutations II](../leetcode/47.permutations-ii.md)|Medium|
15+
|[257. Binary Tree Paths](../leetcode/257.binary-tree-paths.md)|Easy|
16+
|[113. Path Sum II](../leetcode/113.path-sum-ii.md)|Medium|
17+
|[437. Path Sum III](../leetcode/437.path-sum-iii.md)|Medium|
18+
|[131. Palindrome Partitioning](../leetcode/131.palindrome-partitioning.md)|Medium|
19+
|[212. Word Search II](../leetcode/212.word-search-ii.md)|Hard|
20+
|[967. Numbers With Same Consecutive Differences](../leetcode/967.numbers-with-same-consecutive-differences.md)|Medium|
21+
22+
> * https://leetcode.com/problems/permutation-sequence/ 4k h
23+
> * https://leetcode.com/problems/remove-invalid-parentheses/ 4k h
24+
> * https://leetcode.com/problems/regular-expression-matching/ 8k h
25+
> * https://leetcode.com/problems/beautiful-arrangement/ 2k m
26+
> * https://leetcode.cn/problems/reconstruct-itinerary/ 4k h
27+
> * https://leetcode.com/problems/n-queens/ 8k h
28+
> * https://leetcode.com/problems/sudoku-solver/ 6k h
29+
> * https://leetcode.com/problems/restore-ip-addresses/description/ 5k m

‎leetcode/binary-search-problems.md‎

Lines changed: 54 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
## [Binary Search](../topics/binary-search.md)
2+
| Problem | Difficulty |
3+
|------------------|------------|
4+
|[704. Binary Search](../leetcode/704.binary-search.md)|Easy|
5+
|[69. Sqrt(x)](../leetcode/69.sqrt(x).md)|Easy|
6+
|[35. Search Insert Position](../leetcode/35.search-insert-position.md)|Easy|
7+
|[278. First Bad Version](../leetcode/278.first-bad-version.md)|Easy|
8+
|[34. Find First and Last Position of Element in Sorted Array](../leetcode/34.find-first-and-last-position-of-element-in-sorted-array.md)|Medium|
9+
|[162. Find Peak Element](../leetcode/162.find-peak-element.md)|Medium|
10+
|[1095. Find in Mountain Array](../leetcode/1095.find-in-mountain-array.md)|Hard|
11+
|[658. Find K Closest Elements](../leetcode/658.find-k-closest-elements.md)|Medium|
12+
13+
### Search in Rotated Array
14+
| Problem | Difficulty |
15+
|------------------|------------|
16+
|[33. Search in Rotated Sorted Array](../leetcode/33.search-in-rotated-sorted-array.md)|Medium|
17+
|[153. Find Minimum in Rotated Sorted Array](../leetcode/153.find-minimum-in-rotated-sorted-array.md)|Medium|
18+
|[287. Find the Duplicate Number](../leetcode/287.find-the-duplicate-number.md)|Medium|
19+
|[540. Single Element in a Sorted Array](../leetcode/540.single-element-in-a-sorted-array.md)|Medium|
20+
21+
### Search in Matrix
22+
| Problem | Difficulty |
23+
|------------------|------------|
24+
|[74. Search a 2D Matrix](../leetcode/74.search-a-2d-matrix.md)|Medium|
25+
|[240. Search a 2D Matrix II](../leetcode/240.search-a-2d-matrix-ii.md)|Medium|
26+
|[378. Kth Smallest Element in a Sorted Matrix](../leetcode/378.kth-smallest-element-in-a-sorted-matrix.md)|Medium|
27+
28+
### Search on Value
29+
| Problem | Difficulty |
30+
|------------------|------------|
31+
|[875. Koko Eating Bananas](../leetcode/875.koko-eating-bananas.md)|Medium|
32+
|[2560. House Robber IV](../leetcode/2560.house-robber-iv.md)|Medium|
33+
34+
> * https://leetcode.com/problems/search-in-rotated-sorted-array-ii/ 8k m
35+
> * https://leetcode.com/problems/capacity-to-ship-packages-within-d-days 9k m
36+
> * https://leetcode.com/problems/peak-index-in-a-mountain-array/ 6k
37+
> * https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/ 5k e
38+
> * https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs m 2k
39+
> * https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/ 5k e
40+
> * Search on value:
41+
> * https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/description/
42+
> * https://leetcode.com/problems/minimum-time-to-complete-trips/description/
43+
> * https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store/description/
44+
>
45+
> Maximize the minimum value / Minimize the maximum value: 最小化最大值
46+
> * https://leetcode.com/problems/split-array-largest-sum/description/ 10k h
47+
> * https://leetcode.com/problems/path-with-minimum-effort/description/ 5k m
48+
> * https://leetcode.com/problems/magnetic-force-between-two-balls/
49+
> * https://leetcode.cn/problems/house-robber-iv/
50+
> ----
51+
> * https://leetcode.com/problems/count-of-smaller-numbers-after-self/ 9k h
52+
> * https://leetcode.com/problems/russian-doll-envelopes/ 6k h
53+
> * https://leetcode.com/problems/median-of-two-sorted-arrays/ 26k
54+
> * https://leetcode.com/problems/count-of-range-sum/ 2k h

‎leetcode/design-problems.md‎

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
## Design
2+
| Problem | Difficulty |
3+
|------------------|------------|
4+
|[146. LRU Cache](../leetcode/146.lru-cache.md)|Medium|
5+
|[295. Find Median from Data Stream](../leetcode/295.find-median-from-data-stream.md)|Hard|
6+
|[1472. Design Browser History](../leetcode/1472.design-browser-history.md)|Medium|
7+
|[706. Design HashMap](../leetcode/706.design-hashmap.md)|Easy|
8+
|[705. Design HashSet](../leetcode/705.design-hashset.md)|Easy|
9+
|[173. Binary Search Tree Iterator](../leetcode/173.binary-search-tree-iterator.md)|Medium|
10+
|[380. Insert Delete GetRandom O(1)](../leetcode/380.insert-delete-getrandom-o1.md)|Medium|
11+
|[341. Flatten Nested List Iterator](../leetcode/341.flatten-nested-list-iterator.md)|Medium|
12+
|[729. My Calendar I](../leetcode/729.my-calendar-i.md)|Medium|
13+
|[981. Time Based Key-Value Store](../leetcode/981.time-based-key-value-store.md)|Medium|
14+
15+
> * https://leetcode.com/problems/range-sum-query-mutable/description/ 4k m
16+
> * https://leetcode.com/problems/range-sum-query-2d-immutable/description/ 4k m
17+
> * https://leetcode.com/problems/design-twitter/description/ 3k m
18+
> * https://leetcode.com/problems/snapshot-array/description/ 3k m
19+
> * https://leetcode.com/problems/serialize-and-deserialize-bst/description/ 3k m
20+
> * https://leetcode.com/problems/design-underground-system/description/ 3k m
21+
> * https://leetcode.com/problems/peeking-iterator/description/ 2k m
22+
> * https://leetcode.com/problems/design-parking-system/description/ 2k e
23+
> * https://leetcode.com/problems/smallest-number-in-infinite-set/description/ 1.5k m
24+
> ----
25+
> * https://leetcode.com/problems/lfu-cache/ 4k h
26+
> * https://leetcode.com/problems/maximum-frequency-stack/ 4k h
27+
> * https://leetcode.com/problems/random-pick-with-blacklist/ 1k h
28+
> * https://leetcode.com/problems/design-add-and-search-words-data-structure/ 7k m
29+
> * https://leetcode.com/problems/range-module/ 1k h

‎leetcode/dynamic-programming-problems.md‎

Lines changed: 84 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,84 @@
1+
## [Dynamic Programming](../topics/dynamic-programming.md)
2+
| Problem | Difficulty |
3+
|------------------|------------|
4+
|[509. Fibonacci Number](../leetcode/509.fibonacci-number.md)|Easy|
5+
|[70. Climbing Stairs](../leetcode/70.climbing-stairs.md)|Easy|
6+
|[746. Min Cost Climbing Stairs](../leetcode/746.min-cost-climbing-stairs.md)|Easy|
7+
|[62. Unique Paths](../leetcode/62.unique-paths.md)|Medium|
8+
|[63. Unique Paths II](../leetcode/63.unique-paths.ii.md)|Medium|
9+
|[96. Unique Binary Search Trees](../leetcode/96.unique-binary-search-trees.md)|Medium|
10+
|[121. Best Time to Buy and Sell Stock](../leetcode/121.best-time-to-buy-and-sell-stock.md)|Easy|
11+
|[122. Best Time to Buy and Sell Stock II](../leetcode/122.best-time-to-buy-and-sell-stock-ii.md)|Medium|
12+
|[123. Best Time to Buy and Sell Stock III](../leetcode/123.best-time-to-buy-and-sell-stock-iii.md)|Hard|
13+
|[309. Best Time to Buy and Sell Stock with Cooldown](../leetcode/309.best-time-to-buy-and-sell-stock-with-cooldown.md)|Medium|
14+
|[198. House Robber](../leetcode/198.house-robber.md)|Medium|
15+
|[213. House Robber II](../leetcode/213.house-robber-ii.md)|Medium|
16+
|[337. House Robber III](../leetcode/337.house-robber-iii.md)|Medium|
17+
|[1143. Longest Common Subsequence](../topics/dynamic-programming.md#longest-common-subsequence-problem)|Medium|
18+
|[300. Longest Increasing Subsequence](../leetcode/300.longest-increasing-subsequence.md)|Medium|
19+
|[673. Number of Longest Increasing Subsequence](../leetcode/673.number-of-longest-increasing-subsequence.md)|Medium|
20+
|[516. Longest Palindromic Subsequence](../leetcode/516.longest-palindromic-subsequence.md)|Medium|
21+
|[5. Longest Palindromic Substring](../leetcode/5.longest-palindromic-substring.md)|Medium|
22+
|[647. Palindromic Substrings](../leetcode/647.palindromic-substrings.md)|Medium|
23+
|[718. Maximum Length of Repeated Subarray](../leetcode/718.maximum-length-of-repeated-subarray.md)|Medium|
24+
|[53. Maximum Subarray](../leetcode/53.maximum-subarray.md)|Medium|
25+
|[152. Maximum Product Subarray](../leetcode/152.maximum-product-subarray.md)|Medium|
26+
|[32. Longest Valid Parentheses](../leetcode/32.longest-valid-parentheses.md)|Hard|
27+
|[139. Word Break](../leetcode/139.word-break.md)|Medium|
28+
|[64. Minimum Path Sum](../leetcode/64.minimum-path-sum.md)|Medium|
29+
|[279. Perfect Squares](../leetcode/279.perfect-squares.md)|Medium|
30+
|[263. Ugly Number](../leetcode/263.ugly-number.md)|Easy|
31+
|[264. Ugly Number II](../leetcode/264.ugly-number-ii.md)|Medium|
32+
|[983. Minimum Cost For Tickets](../leetcode/983.minimum-cost-for-tickets.md)|Medium|
33+
|[1235. Maximum Profit in Job Scheduling](../leetcode/1235.maximum-profit-in-job-scheduling.md)|Hard|
34+
35+
### Problem Lists
36+
> * https://leetcode.com/discuss/general-discussion/662866/dp-for-beginners-problems-patterns-sample-solutions
37+
> * https://leetcode.com/discuss/general-discussion/592146/dynamic-programming-summary
38+
> * https://leetcode.com/discuss/general-discussion/1000929/solved-all-dynamic-programming-dp-problems-in-7-months
39+
> * https://leetcode.com/discuss/general-discussion/458695/Dynamic-Programming-Patterns
40+
41+
### Knapsack
42+
| Problem | Difficulty |
43+
|------------------|------------|
44+
|[416. Partition Equal Subset Sum](../leetcode/416.partition-equal-subset-sum.md)|Medium|
45+
|[494. Target Sum](../leetcode/494.target-sum.md)|Medium|
46+
|[279. Perfect Squares](../leetcode/279.perfect-squares.md)|Medium|
47+
|[322. Coin Change](../leetcode/322.coin-change.md)|Medium|
48+
|[518. Coin Change 2](../leetcode/518.coin-change-2.md)|Medium|
49+
|[1155. Number of Dice Rolls With Target Sum](../leetcode/1155.number-of-dice-rolls-with-target-sum.md)|Medium|
50+
51+
> * https://leetcode.com/problems/triangle/ 9k m
52+
> * https://leetcode.com/problems/combination-sum-iv/ 5k m
53+
> * https://leetcode.com/problems/last-stone-weight-ii/ 2k m
54+
> * https://leetcode.com/problems/ones-and-zeroes/ 5k m
55+
> * https://leetcode.com/problems/integer-break/ 5k m
56+
57+
### LCS
58+
> * https://leetcode.com/problems/distinct-subsequences/ 4k h
59+
> * https://leetcode.com/problems/max-dot-product-of-two-subsequences/ h
60+
61+
### LIC
62+
> * https://leetcode.com/problems/longest-string-chain/ 7k m
63+
> * https://leetcode.com/problems/russian-doll-envelopes/ 4k h
64+
> * https://leetcode.com/problems/maximum-length-of-pair-chain/ 4k m
65+
66+
### Other
67+
> * Solved: https://leetcode.com/problems/pascals-triangle/ 9k e
68+
> * https://leetcode.com/problems/out-of-boundary-paths/description 4k m
69+
> * https://leetcode.com/problems/delete-and-earn/ 5k m
70+
> * https://leetcode.com/problems/minimum-falling-path-sum/ 5k m
71+
> * https://leetcode.com/problems/maximal-rectangle/ 6k h
72+
> * https://leetcode.com/problems/edit-distance/ 8k h
73+
> * https://leetcode.com/problems/longest-increasing-path-in-a-matrix/ 6k h
74+
> * https://leetcode.com/problems/dungeon-game/ 4k h
75+
> * https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/
76+
> * https://leetcode.com/problems/counting-bits/ 8k e
77+
> * https://leetcode.com/problems/interleaving-string/ 6k m
78+
> * https://leetcode.com/problems/arithmetic-slices/ 4k m
79+
> * https://leetcode.com/problems/cherry-pickup/ 3k h
80+
> * https://leetcode.com/problems/cherry-pickup-ii/
81+
> * https://leetcode.com/problems/super-egg-drop/ 3k h
82+
> * https://leetcode.com/problems/minimum-cost-to-cut-a-stick/ 3k h
83+
> * https://leetcode.com/problems/arithmetic-slices-ii-subsequence/ 2k h
84+
> * https://leetcode.com/problems/maximum-profit-in-job-scheduling/

0 commit comments

Comments
 (0)