added solution links for problems page

MuraliDharan7 · MuraliDharan7 · commit 940b2bd0918f · 2024-06-05T00:15:49.000+05:30
diff --git a/dsa-problems/gfg-problems/easy/problems.md b/dsa-problems/gfg-problems/easy/problems.md
@@ -14,61 +14,61 @@ export const problems = [
     "problemName": "1. Reverse-a-linked-list",
     "difficulty": "easy",
     "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-linked-list/0",
-    "solutionLink": "#"
+    "solutionLink": "/dsa-solutions/gfg-solutions/problems/Reverse-a-linked-list"
   },
     {
         "problemName": "2. Reverse-a-doubly-linked-list",
         "difficulty": "easy",
         "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-doubly-linked-list/0",
-        "solutionLink": "#"
+        "solutionLink": "/dsa-solutions/gfg-solutions/problems/Reverse-a-doubly-linked-list"
     },
     {
         "problemName": "3. Delete-without-head-pointer",
         "difficulty": "easy",
         "leetCodeLink": "https://www.geeksforgeeks.org/problems/delete-without-head-pointer/0",
-        "solutionLink": "#"
+        "solutionLink": "/dsa-solutions/gfg-solutions/problems/Delete-without-head-pointer"
     },
     {
         "problemName": "4. Check-for-balanced-tree",
         "difficulty": "easy",
         "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-for-balanced-tree/0",
-        "solutionLink": "#"
+        "solutionLink": "/dsa-solutions/gfg-solutions/problems/Check-for-balanced-tree"
     },
     {
         "problemName": "5. Delete-middle-of-linked-list",
         "difficulty": "easy",
         "leetCodeLink": "https://www.geeksforgeeks.org/problems/delete-middle-of-linked-list/0",
-        "solutionLink": "#"
+        "solutionLink": "/dsa-solutions/gfg-solutions/problems/Delete-middle-of-linked-list"
     },
     {
         "problemName": "6. Intersection-of-two-sorted-linked-lists",
         "difficulty": "easy",
         "leetCodeLink": "https://www.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/0",
-        "solutionLink": "#"
+        "solutionLink": "/dsa-solutions/gfg-solutions/problems/Intersection-of-two-sorted-linked-lists"
     },
     {
         "problemName": "7. DFS-traversal-of-graph",
         "difficulty": "easy",
         "leetCodeLink": "https://www.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/0",
-        "solutionLink": "#"
+        "solutionLink": "/dsa-solutions/gfg-solutions/problems/DFS-traversal-of-graph"
     },
     {
         "problemName": "8. BFS-traversal-of-graph",
         "difficulty": "easy",
         "leetCodeLink": "https://www.geeksforgeeks.org/problems/bfs-traversal-of-graph/0",
-        "solutionLink": "#"
+        "solutionLink": "/dsa-solutions/gfg-solutions/problems/BFS-traversal-of-graph"
     },
     {
         "problemName": "9. Square-root",
         "difficulty": "easy",
         "leetCodeLink": "https://www.geeksforgeeks.org/problems/square-root/0",
-        "solutionLink": "#"
+        "solutionLink": "/dsa-solutions/gfg-solutions/problems/Square-root"
     },
     {
         "problemName": "10. Implement-two-stacks-in-an-array",
         "difficulty": "easy",
         "leetCodeLink": "https://www.geeksforgeeks.org/problems/implement-two-stacks-in-an-array/0",
-        "solutionLink": "#"
+        "solutionLink": "/dsa-solutions/gfg-solutions/problems/Implement-two-stacks-in-an-array"
     }
 ]
 
diff --git a/dsa-solutions/gfg-solutions/problems/BFS-traversal-of-graph.md b/dsa-solutions/gfg-solutions/problems/BFS-traversal-of-graph.md
@@ -1,7 +1,7 @@
 ---
 id: BFS-traversal-of-graph
 title: BFS Traversal of Graph (Geeks for Geeks)
-sidebar_label: Problems - BFS Traversal of Graph
+sidebar_label: BFS Traversal of Graph
 tags:
   - Intermediate
   - Graph
diff --git a/dsa-solutions/gfg-solutions/problems/Check-for-balanced-tree.md b/dsa-solutions/gfg-solutions/problems/Check-for-balanced-tree.md
@@ -1,7 +1,7 @@
 ---
 id: Check-for-balanced-tree
 title: Check for Balanced Tree (Geeks for Geeks)
-sidebar_label: Problems - Check for Balanced Tree 
+sidebar_label: Check for Balanced Tree 
 tags:
   - Intermediate
   - Tree
diff --git a/dsa-solutions/gfg-solutions/problems/DFS-traversal-of-graph.md b/dsa-solutions/gfg-solutions/problems/DFS-traversal-of-graph.md
@@ -1,7 +1,7 @@
 ---
 id: DFS-traversal-of-graph
 title: DFS Traversal of Graph (Geeks for Geeks)
-sidebar_label: Problems - DFS Traversal of Graph
+sidebar_label: DFS Traversal of Graph
 tags:
   - Intermediate
   - Graph
diff --git a/dsa-solutions/gfg-solutions/problems/Delete-middle-of-linked-list.md b/dsa-solutions/gfg-solutions/problems/Delete-middle-of-linked-list.md
@@ -1,7 +1,7 @@
 ---
 id: Delete-middle-of-linked-list
 title: Delete Middle of Linked List (Geeks for Geeks)
-sidebar_label: Problems - Delete Middle of Linked List 
+sidebar_label: Delete Middle of Linked List 
 tags:
   - Intermediate
   - Linked List
diff --git a/dsa-solutions/gfg-solutions/problems/Delete-without-head-pointer.md b/dsa-solutions/gfg-solutions/problems/Delete-without-head-pointer.md
@@ -1,7 +1,7 @@
 ---
 id: Delete-without-head-pointer
 title: Delete without Head Pointer (Geeks for Geeks)
-sidebar_label: Problems - Delete without Head Pointer 
+sidebar_label: Delete without Head Pointer 
 tags:
   - Beginner
   - Linked List
diff --git a/dsa-solutions/gfg-solutions/problems/Implement-two-stacks-in-an-array.md b/dsa-solutions/gfg-solutions/problems/Implement-two-stacks-in-an-array.md
@@ -1,7 +1,7 @@
 ---
 id: Implement-two-stacks-in-an-array
 title: Implement Two Stacks in an Array (Geeks for Geeks)
-sidebar_label: Problems - Implement Two Stacks in an Array
+sidebar_label: Implement Two Stacks in an Array
 tags:
   - Intermediate
   - Stack
diff --git a/dsa-solutions/gfg-solutions/problems/Intersection-of-two-sorted-linked-lists.md b/dsa-solutions/gfg-solutions/problems/Intersection-of-two-sorted-linked-lists.md
@@ -1,7 +1,7 @@
 ---
 id: Intersection-of-two-sorted-linked-lists
 title: Intersection of Two Sorted Linked Lists (Geeks for Geeks)
-sidebar_label: Problems - Intersection of Two Sorted Linked Lists 
+sidebar_label: Intersection of Two Sorted Linked Lists 
 tags:
   - Intermediate
   - Linked List
diff --git a/dsa-solutions/gfg-solutions/problems/Reverse-a-doubly-linked-list.md b/dsa-solutions/gfg-solutions/problems/Reverse-a-doubly-linked-list.md
@@ -1,7 +1,7 @@
 ---
 id: Reverse-a-doubly-linked-list
 title: Reverse a Doubly Linked List (Geeks for Geeks)
-sidebar_label: Problems - Reverse a Doubly LinkedList 
+sidebar_label: Reverse a Doubly LinkedList 
 tags:
   - Beginner
   - Doubly Linked List
diff --git a/dsa-solutions/gfg-solutions/problems/Reverse-a-linked-list.md b/dsa-solutions/gfg-solutions/problems/Reverse-a-linked-list.md
@@ -1,7 +1,7 @@
 ---
 id: Reverse-a-linked-list
 title: Reverse a Linked List (Geeks for Geeks)
-sidebar_label: Problems - Reverse a LinkedList 
+sidebar_label: Reverse a LinkedList 
 tags:
   - Beginner
   - Linked List
diff --git a/dsa-solutions/gfg-solutions/problems/Square-root.md b/dsa-solutions/gfg-solutions/problems/Square-root.md
@@ -1,7 +1,7 @@
 ---
 id: Find-the-square-root
 title: Find the Square Root (Geeks for Geeks)
-sidebar_label: Problems - Find the Square Root
+sidebar_label: Find the Square Root
 tags:
   - Beginner
   - Math
diff --git a/dsa-solutions/gfg-solutions/problems/_category_.json b/dsa-solutions/gfg-solutions/problems/_category_.json
@@ -1,6 +1,6 @@
 {
     "label": "Easy problems GFG",
-    "position": 1,
+    "position": 10,
     "link": {
       "type": "generated-index",
       "description": "Solutions categorised by Problems in Easy problem folder"

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`{`
`2`	`2`	`"label": "Easy problems GFG",`
`3`		`- "position": 1,`
	`3`	`+ "position": 10,`
`4`	`4`	`"link": {`
`5`	`5`	`"type": "generated-index",`
`6`	`6`	`"description": "Solutions categorised by Problems in Easy problem folder"`