diff --git a/dsa-problems/leetcode-problems/0300-0399.md b/dsa-problems/leetcode-problems/0300-0399.md
index 24164a662..3f4fd178f 100644
--- a/dsa-problems/leetcode-problems/0300-0399.md
+++ b/dsa-problems/leetcode-problems/0300-0399.md
@@ -21,7 +21,7 @@ export const problems = [
         "problemName": "301. Remove Invalid Parentheses",
         "difficulty": "Hard",
         "leetCodeLink": "https://leetcode.com/problems/remove-invalid-parentheses/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0301-Remove-Invalid-Parentheses"
     },
     {
         "problemName": "302. Smallest Rectangle Enclosing Black Pixels",
@@ -57,7 +57,7 @@ export const problems = [
         "problemName": "307. Range Sum Query - Mutable",
         "difficulty": "Medium",
         "leetCodeLink": "https://leetcode.com/problems/range-sum-query-mutable/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0307-Range-Sum-Query-Mutable"
     },
     {
         "problemName": "308. range-sum-query-2d-mutable",
@@ -93,7 +93,7 @@ export const problems = [
         "problemName": "313. Super Ugly Number",
         "difficulty": "Medium",
         "leetCodeLink": "https://leetcode.com/problems/super-ugly-number/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0313-Super-Ugly-Number"
     },
     {
         "problemName": "314. binary-tree-vertical-order-traversal",
@@ -171,13 +171,13 @@ export const problems = [
         "problemName": "326. Power of Three",
         "difficulty": "Easy",
         "leetCodeLink": "https://leetcode.com/problems/power-of-three/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0326-power-of-three"
     },
     {
         "problemName": "327. Count of Range Sum",
         "difficulty": "Hard",
         "leetCodeLink": "https://leetcode.com/problems/count-of-range-sum/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0327-Count-of-Range-Sum"
     },
     {
         "problemName": "328. Odd Even Linked List",
@@ -195,7 +195,7 @@ export const problems = [
         "problemName": "330. Patching Array",
         "difficulty": "Hard",
         "leetCodeLink": "https://leetcode.com/problems/patching-array/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0330-patching-array"
     },
     {
         "problemName": "331. Verify Preorder Serialization of a Binary Tree",
@@ -219,7 +219,7 @@ export const problems = [
         "problemName": "334. Increasing Triplet Subsequence",
         "difficulty": "Medium",
         "leetCodeLink": "https://leetcode.com/problems/increasing-triplet-subsequence/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0334-increasing-triplet-subsequence"
     },
     {
         "problemName": "335. Self Crossing",
@@ -267,7 +267,7 @@ export const problems = [
         "problemName": "342. Power of Four",
         "difficulty": "Easy",
         "leetCodeLink": "https://leetcode.com/problems/power-of-four/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0342-powerof-four"
     },
     {
         "problemName": "343. Integer Break",
@@ -285,13 +285,13 @@ export const problems = [
         "problemName": "345. Reverse Vowels of a String",
         "difficulty": "Easy",
         "leetCodeLink": "https://leetcode.com/problems/reverse-vowels-of-a-string/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0345-reverse-vowels-of-a-string"
     },
     {
         "problemName": "346. moving-average-from-data-stream",
         "difficulty": "Medium",
         "leetCodeLink": "https://leetcode.com/problems/moving-average-from-data-stream/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0346-moving-average-from-data-stream"
     },
     {
         "problemName": "347. Top K Frequent Elements",
@@ -309,13 +309,13 @@ export const problems = [
         "problemName": "349. Intersection of Two Arrays",
         "difficulty": "Easy",
         "leetCodeLink": "https://leetcode.com/problems/intersection-of-two-arrays/",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0349-Intersection-of-Two-Arrays"
     },
     {
         "problemName": "350. Intersection of Two Arrays II",
         "difficulty": "Easy",
         "leetCodeLink": "350. Intersection of Two Arrays II",
-        "solutionLink": "#"
+        "solutionLink": "dsa-solutions/lc-solutions/0300-0399/0350-Intersection-of-Two-Arrays-II"
     },
     {
         "problemName": "351. android-unlock-patterns",
@@ -614,4 +614,4 @@ export const problems = [
     collectionLink="https://leetcode.com/study-plan/programming-skills"
 />
 
-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.
\ No newline at end of file
+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.