@@ -21,7 +21,7 @@ export const problems = [
21
21
"problemName": "301. Remove Invalid Parentheses",
22
22
"difficulty": "Hard",
23
23
"leetCodeLink": "https://leetcode.com/problems/remove-invalid-parentheses/ ",
24
- "solutionLink": "# "
24
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0301-Remove-Invalid-Parentheses "
25
25
},
26
26
{
27
27
"problemName": "302. Smallest Rectangle Enclosing Black Pixels",
@@ -57,7 +57,7 @@ export const problems = [
57
57
"problemName": "307. Range Sum Query - Mutable",
58
58
"difficulty": "Medium",
59
59
"leetCodeLink": "https://leetcode.com/problems/range-sum-query-mutable/ ",
60
- "solutionLink": "# "
60
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0307-Range-Sum-Query-Mutable "
61
61
},
62
62
{
63
63
"problemName": "308. range-sum-query-2d-mutable",
@@ -93,7 +93,7 @@ export const problems = [
93
93
"problemName": "313. Super Ugly Number",
94
94
"difficulty": "Medium",
95
95
"leetCodeLink": "https://leetcode.com/problems/super-ugly-number/ ",
96
- "solutionLink": "# "
96
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0313-Super-Ugly-Number "
97
97
},
98
98
{
99
99
"problemName": "314. binary-tree-vertical-order-traversal",
@@ -171,13 +171,13 @@ export const problems = [
171
171
"problemName": "326. Power of Three",
172
172
"difficulty": "Easy",
173
173
"leetCodeLink": "https://leetcode.com/problems/power-of-three/ ",
174
- "solutionLink": "# "
174
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0326-power-of-three "
175
175
},
176
176
{
177
177
"problemName": "327. Count of Range Sum",
178
178
"difficulty": "Hard",
179
179
"leetCodeLink": "https://leetcode.com/problems/count-of-range-sum/ ",
180
- "solutionLink": "# "
180
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0327-Count-of-Range-Sum "
181
181
},
182
182
{
183
183
"problemName": "328. Odd Even Linked List",
@@ -195,7 +195,7 @@ export const problems = [
195
195
"problemName": "330. Patching Array",
196
196
"difficulty": "Hard",
197
197
"leetCodeLink": "https://leetcode.com/problems/patching-array/ ",
198
- "solutionLink": "# "
198
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0330-patching-array "
199
199
},
200
200
{
201
201
"problemName": "331. Verify Preorder Serialization of a Binary Tree",
@@ -219,7 +219,7 @@ export const problems = [
219
219
"problemName": "334. Increasing Triplet Subsequence",
220
220
"difficulty": "Medium",
221
221
"leetCodeLink": "https://leetcode.com/problems/increasing-triplet-subsequence/ ",
222
- "solutionLink": "# "
222
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0334-increasing-triplet-subsequence "
223
223
},
224
224
{
225
225
"problemName": "335. Self Crossing",
@@ -267,7 +267,7 @@ export const problems = [
267
267
"problemName": "342. Power of Four",
268
268
"difficulty": "Easy",
269
269
"leetCodeLink": "https://leetcode.com/problems/power-of-four/ ",
270
- "solutionLink": "# "
270
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0342-powerof-four "
271
271
},
272
272
{
273
273
"problemName": "343. Integer Break",
@@ -285,13 +285,13 @@ export const problems = [
285
285
"problemName": "345. Reverse Vowels of a String",
286
286
"difficulty": "Easy",
287
287
"leetCodeLink": "https://leetcode.com/problems/reverse-vowels-of-a-string/ ",
288
- "solutionLink": "# "
288
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0345-reverse-vowels-of-a-string "
289
289
},
290
290
{
291
291
"problemName": "346. moving-average-from-data-stream",
292
292
"difficulty": "Medium",
293
293
"leetCodeLink": "https://leetcode.com/problems/moving-average-from-data-stream/ ",
294
- "solutionLink": "# "
294
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0346-moving-average-from-data-stream "
295
295
},
296
296
{
297
297
"problemName": "347. Top K Frequent Elements",
@@ -309,13 +309,13 @@ export const problems = [
309
309
"problemName": "349. Intersection of Two Arrays",
310
310
"difficulty": "Easy",
311
311
"leetCodeLink": "https://leetcode.com/problems/intersection-of-two-arrays/ ",
312
- "solutionLink": "# "
312
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0349-Intersection-of-Two-Arrays "
313
313
},
314
314
{
315
315
"problemName": "350. Intersection of Two Arrays II",
316
316
"difficulty": "Easy",
317
317
"leetCodeLink": "350. Intersection of Two Arrays II",
318
- "solutionLink": "# "
318
+ "solutionLink": "/dsa-solutions/lc-solutions/0300-0399/0350-Intersection-of-Two-Arrays-II "
319
319
},
320
320
{
321
321
"problemName": "351. android-unlock-patterns",
@@ -614,4 +614,4 @@ export const problems = [
614
614
collectionLink="https://leetcode.com/study-plan/programming-skills"
615
615
/>
616
616
617
- Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the LeetCode website. You can also click on the solution link to view the solution of the problem.
617
+ Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the LeetCode website. You can also click on the solution link to view the solution of the problem.
0 commit comments