|
| 1 | +--- |
| 2 | +id: problems |
| 3 | +title: GFG basic problems |
| 4 | +sidebar_label: problems |
| 5 | +keywords: |
| 6 | + - gfg problems |
| 7 | + - gfg problems basic |
| 8 | + - gfg problems problems |
| 9 | +--- |
| 10 | + |
| 11 | + |
| 12 | +export const problems = [ |
| 13 | + { |
| 14 | + "problemName": "1. Inorder Traversal", |
| 15 | + "difficulty": "basic", |
| 16 | + "leetCodeLink": "https://www.geeksforgeeks.org/problems/inorder-traversal/0", |
| 17 | + "solutionLink": "#" |
| 18 | + }, |
| 19 | + { |
| 20 | + "problemName": "2. Preorder Traversal", |
| 21 | + "difficulty": "basic", |
| 22 | + "gfgLink": "https://geeksforgeeks.org/problems/preorder-traversal/0", |
| 23 | + "solutionLink": "#" |
| 24 | + }, |
| 25 | + { |
| 26 | + "problemName": "3. Peak element", |
| 27 | + "difficulty": "basic", |
| 28 | + "gfgLink": "https://www.geeksforgeeks.org/problems/peak-element/0", |
| 29 | + "solutionLink": "#" |
| 30 | + }, |
| 31 | + { |
| 32 | + "problemName": "4. Minimum-element-in-bst", |
| 33 | + "difficulty": "basic", |
| 34 | + "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-element-in-bst/0", |
| 35 | + "solutionLink": "#" |
| 36 | + }, |
| 37 | + { |
| 38 | + "problemName": "5. Find-nk-th-node-in-linked-list", |
| 39 | + "difficulty": "basic", |
| 40 | + "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-nk-th-node-in-linked-list/0", |
| 41 | + "solutionLink": "#" |
| 42 | + }, |
| 43 | + { |
| 44 | + "problemName": "6. Power-of-2", |
| 45 | + "difficulty": "basic", |
| 46 | + "leetCodeLink": "https://www.geeksforgeeks.org/problems/power-of-2-1587115620/0", |
| 47 | + "solutionLink": "#" |
| 48 | + }, |
| 49 | + { |
| 50 | + "problemName": "7. Search-an-element-in-an-array", |
| 51 | + "difficulty": "basic", |
| 52 | + "leetCodeLink": "https://www.geeksforgeeks.org/problems/search-an-element-in-an-array-1587115621/0", |
| 53 | + "solutionLink": "#" |
| 54 | + }, |
| 55 | + { |
| 56 | + "problemName": "8. Print-first-n-fibonacci-numbers", |
| 57 | + "difficulty": "basic", |
| 58 | + "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-first-n-fibonacci-numbers1002/0", |
| 59 | + "solutionLink": "#" |
| 60 | + }, |
| 61 | + { |
| 62 | + "problemName": "9. Find minimum and maximum element in an arra", |
| 63 | + "difficulty": "basic", |
| 64 | + "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-minimum-and-maximum-element-in-an-array4428/0", |
| 65 | + "solutionLink": "#" |
| 66 | + }, |
| 67 | + { |
| 68 | + "problemName": "10. Factorial-number", |
| 69 | + "difficulty": "basic", |
| 70 | + "leetCodeLink": "https://www.geeksforgeeks.org/problems/factorial-number2446/0", |
| 71 | + "solutionLink": "#" |
| 72 | + } |
| 73 | +] |
| 74 | + |
| 75 | +<Table |
| 76 | + title="" |
| 77 | + data={problems} |
| 78 | + isSorted={false} |
| 79 | + collectionLink="https://www.geeksforgeeks.org/" |
| 80 | +/> |
| 81 | + |
| 82 | +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. |
0 commit comments