Skip to content

Commit e303e69

Browse files
Fixes unmapped solution for 300-350 LeetCode Problems
1 parent 190596e commit e303e69

File tree

1 file changed

+13
-13
lines changed

1 file changed

+13
-13
lines changed

dsa-problems/leetcode-problems/0300-0399.md

Lines changed: 13 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ export const problems = [
2121
"problemName": "301. Remove Invalid Parentheses",
2222
"difficulty": "Hard",
2323
"leetCodeLink": "https://leetcode.com/problems/remove-invalid-parentheses/",
24-
"solutionLink": "#"
24+
"solutionLink": "dsa-solutions/lc-solutions/0300-0399/0301-Remove-Invalid-Parentheses"
2525
},
2626
{
2727
"problemName": "302. Smallest Rectangle Enclosing Black Pixels",
@@ -57,7 +57,7 @@ export const problems = [
5757
"problemName": "307. Range Sum Query - Mutable",
5858
"difficulty": "Medium",
5959
"leetCodeLink": "https://leetcode.com/problems/range-sum-query-mutable/",
60-
"solutionLink": "#"
60+
"solutionLink": "dsa-solutions/lc-solutions/0300-0399/0307-Range-Sum-Query-Mutable"
6161
},
6262
{
6363
"problemName": "308. range-sum-query-2d-mutable",
@@ -93,7 +93,7 @@ export const problems = [
9393
"problemName": "313. Super Ugly Number",
9494
"difficulty": "Medium",
9595
"leetCodeLink": "https://leetcode.com/problems/super-ugly-number/",
96-
"solutionLink": "#"
96+
"solutionLink": "dsa-solutions/lc-solutions/0300-0399/0313-Super-Ugly-Number"
9797
},
9898
{
9999
"problemName": "314. binary-tree-vertical-order-traversal",
@@ -171,13 +171,13 @@ export const problems = [
171171
"problemName": "326. Power of Three",
172172
"difficulty": "Easy",
173173
"leetCodeLink": "https://leetcode.com/problems/power-of-three/",
174-
"solutionLink": "#"
174+
"solutionLink": "dsa-solutions/lc-solutions/0300-0399/0326-power-of-three"
175175
},
176176
{
177177
"problemName": "327. Count of Range Sum",
178178
"difficulty": "Hard",
179179
"leetCodeLink": "https://leetcode.com/problems/count-of-range-sum/",
180-
"solutionLink": "#"
180+
"solutionLink": "dsa-solutions/lc-solutions/0300-0399/0327-Count-of-Range-Sum"
181181
},
182182
{
183183
"problemName": "328. Odd Even Linked List",
@@ -195,7 +195,7 @@ export const problems = [
195195
"problemName": "330. Patching Array",
196196
"difficulty": "Hard",
197197
"leetCodeLink": "https://leetcode.com/problems/patching-array/",
198-
"solutionLink": "#"
198+
"solutionLink": "dsa-solutions/lc-solutions/0300-0399/0330-patching-array"
199199
},
200200
{
201201
"problemName": "331. Verify Preorder Serialization of a Binary Tree",
@@ -219,7 +219,7 @@ export const problems = [
219219
"problemName": "334. Increasing Triplet Subsequence",
220220
"difficulty": "Medium",
221221
"leetCodeLink": "https://leetcode.com/problems/increasing-triplet-subsequence/",
222-
"solutionLink": "#"
222+
"solutionLink": "dsa-solutions/lc-solutions/0300-0399/0334-increasing-triplet-subsequence"
223223
},
224224
{
225225
"problemName": "335. Self Crossing",
@@ -267,7 +267,7 @@ export const problems = [
267267
"problemName": "342. Power of Four",
268268
"difficulty": "Easy",
269269
"leetCodeLink": "https://leetcode.com/problems/power-of-four/",
270-
"solutionLink": "#"
270+
"solutionLink": "dsa-solutions/lc-solutions/0300-0399/0342-powerof-four"
271271
},
272272
{
273273
"problemName": "343. Integer Break",
@@ -285,13 +285,13 @@ export const problems = [
285285
"problemName": "345. Reverse Vowels of a String",
286286
"difficulty": "Easy",
287287
"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"
289289
},
290290
{
291291
"problemName": "346. moving-average-from-data-stream",
292292
"difficulty": "Medium",
293293
"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"
295295
},
296296
{
297297
"problemName": "347. Top K Frequent Elements",
@@ -309,13 +309,13 @@ export const problems = [
309309
"problemName": "349. Intersection of Two Arrays",
310310
"difficulty": "Easy",
311311
"leetCodeLink": "https://leetcode.com/problems/intersection-of-two-arrays/",
312-
"solutionLink": "#"
312+
"solutionLink": "dsa-solutions/lc-solutions/0300-0399/0349-Intersection-of-Two-Arrays"
313313
},
314314
{
315315
"problemName": "350. Intersection of Two Arrays II",
316316
"difficulty": "Easy",
317317
"leetCodeLink": "350. Intersection of Two Arrays II",
318-
"solutionLink": "#"
318+
"solutionLink": "dsa-solutions/lc-solutions/0300-0399/0350-Intersection-of-Two-Arrays-II"
319319
},
320320
{
321321
"problemName": "351. android-unlock-patterns",
@@ -614,4 +614,4 @@ export const problems = [
614614
collectionLink="https://leetcode.com/study-plan/programming-skills"
615615
/>
616616

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

Comments
 (0)