basic and easy gfg

Author: komal-agarwal5

dsa-problems/gfg-problems/basic/problems.md

@@ -19,13 +19,13 @@ export const problems = [
     {
         "problemName": "2. Preorder Traversal",
         "difficulty": "basic",
-        "gfgLink": "https://geeksforgeeks.org/problems/preorder-traversal/0",
+        "leetCodeLink": "https://geeksforgeeks.org/problems/preorder-traversal/0",
         "solutionLink": "#"
     },
     {
         "problemName": "3. Peak element",
         "difficulty": "basic",
-        "gfgLink": "https://www.geeksforgeeks.org/problems/peak-element/0",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/peak-element/0",
         "solutionLink": "#"
     },
     {
@@ -59,7 +59,7 @@ export const problems = [
         "solutionLink": "#"
     },
     {
-        "problemName": "9. Find minimum and maximum element in an arra",
+        "problemName": "9. Find minimum and maximum element in an array",
         "difficulty": "basic",
         "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-minimum-and-maximum-element-in-an-array4428/0",
         "solutionLink": "#"

dsa-problems/gfg-problems/easy/problems.md

@@ -0,0 +1,82 @@
+---
+id: problems
+title: GFG easy problems
+sidebar_label: problems
+keywords:
+  - gfg problems
+  - gfg problems easy
+  - gfg problems problems
+---
+
+
+export const problems = [
+  {
+    "problemName": "1. Reverse-a-linked-list",
+    "difficulty": "easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-linked-list/0",
+    "solutionLink": "#"
+  },
+    {
+        "problemName": "2. Reverse-a-doubly-linked-list",
+        "difficulty": "easy",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-doubly-linked-list/0",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "3. Delete-without-head-pointer",
+        "difficulty": "easy",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/delete-without-head-pointer/0",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "4. Check-for-balanced-tree",
+        "difficulty": "easy",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-for-balanced-tree/0",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "5. Delete-middle-of-linked-list",
+        "difficulty": "easy",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/delete-middle-of-linked-list/0",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "6. Intersection-of-two-sorted-linked-lists",
+        "difficulty": "easy",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/0",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "7. DFS-traversal-of-graph",
+        "difficulty": "easy",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/0",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "8. BFS-traversal-of-graph",
+        "difficulty": "easy",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/bfs-traversal-of-graph/0",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "9. Square-root",
+        "difficulty": "easy",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/square-root/0",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "10. Implement-two-stacks-in-an-array",
+        "difficulty": "easy",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/implement-two-stacks-in-an-array/0",
+        "solutionLink": "#"
+    }
+]
+
+<Table 
+    title=""
+    data={problems}
+    isSorted={false}
+    collectionLink="https://www.geeksforgeeks.org/"
+/>
+
+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 GFG website. You can also click on the solution link to view the solution of the problem.