-
-
Notifications
You must be signed in to change notification settings - Fork 161
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #329 from komal-agarwal5/main
Added GFG section under DSA problems
- Loading branch information
Showing
5 changed files
with
329 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,82 @@ | ||
| --- | ||
| id: problems | ||
| title: GFG basic problems | ||
| sidebar_label: problems | ||
| keywords: | ||
| - gfg problems | ||
| - gfg problems basic | ||
| - gfg problems problems | ||
| --- | ||
|
|
||
|
|
||
| export const problems = [ | ||
| { | ||
| "problemName": "1. Inorder Traversal", | ||
| "difficulty": "basic", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/inorder-traversal/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "2. Preorder Traversal", | ||
| "difficulty": "basic", | ||
| "leetCodeLink": "https://geeksforgeeks.org/problems/preorder-traversal/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "3. Peak element", | ||
| "difficulty": "basic", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/peak-element/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "4. Minimum-element-in-bst", | ||
| "difficulty": "basic", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-element-in-bst/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "5. Find-nk-th-node-in-linked-list", | ||
| "difficulty": "basic", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-nk-th-node-in-linked-list/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "6. Power-of-2", | ||
| "difficulty": "basic", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/power-of-2-1587115620/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "7. Search-an-element-in-an-array", | ||
| "difficulty": "basic", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/search-an-element-in-an-array-1587115621/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "8. Print-first-n-fibonacci-numbers", | ||
| "difficulty": "basic", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-first-n-fibonacci-numbers1002/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "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": "#" | ||
| }, | ||
| { | ||
| "problemName": "10. Factorial-number", | ||
| "difficulty": "basic", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/factorial-number2446/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. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -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. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,82 @@ | ||
| --- | ||
| id: problems | ||
| title: GFG hard problems | ||
| sidebar_label: problems | ||
| keywords: | ||
| - gfg problems | ||
| - gfg problems hard | ||
| - gfg problems problems | ||
| --- | ||
|
|
||
|
|
||
| export const problems = [ | ||
| { | ||
| "problemName": "1. Next-happy-number", | ||
| "difficulty": "hard", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/next-happy-number4538/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "2. Merge-two-sorted-arrays", | ||
| "difficulty": "hard", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-two-sorted-arrays-1587115620/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "3. Word-ladder", | ||
| "difficulty": "hard", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/word-ladder/1", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "4. Minimum-indexed-character", | ||
| "difficulty": "hard", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-indexed-character-1587115620/1", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "5. Minimum-x-xor-a", | ||
| "difficulty": "hard", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-x-xor-a--170645/1", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "6. Winner-of-an-election-where-votes-are-represented-as-candidate-names", | ||
| "difficulty": "hard", | ||
| "leetCodeLink": "hhttps://www.geeksforgeeks.org/problems/winner-of-an-election-where-votes-are-represented-as-candidate-names-1587115621/1", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "7. Shortest-unique-prefix-for-every-word", | ||
| "difficulty": "hard", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-unique-prefix-for-every-word/1", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "8. Closest-palindrome", | ||
| "difficulty": "hard", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/closest-palindrome4519/1?page=1&difficulty=Hard&sortBy=difficulty", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "9. Number-of-subsets-with-product-less-than-k", | ||
| "difficulty": "hard", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-subsets-with-product-less-than-k/1?page=1&difficulty=Hard&sortBy=difficulty", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "10. Minimize-max-distance-to-gas-station", | ||
| "difficulty": "hard", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimize-max-distance-to-gas-station/1?page=1&difficulty=Hard&sortBy=difficulty", | ||
| "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. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,82 @@ | ||
| --- | ||
| id: problems | ||
| title: GFG medium problems | ||
| sidebar_label: problems | ||
| keywords: | ||
| - gfg problems | ||
| - gfg problems medium | ||
| - gfg problems problems | ||
| --- | ||
|
|
||
|
|
||
| export const problems = [ | ||
| { | ||
| "problemName": "1. Matchsticks-game", | ||
| "difficulty": "medium", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/-matchsticks-game4906/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "2. Fibonacci-sum", | ||
| "difficulty": "medium", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/fibonacci-sum1423/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "3. Count-the-subarrays-having-product-less-than-k", | ||
| "difficulty": "medium", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-the-subarrays-having-product-less-than-k1708/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "4. How-many-X's", | ||
| "difficulty": "medium", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/how-many-xs4514/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "5. Pascal-triangle", | ||
| "difficulty": "medium", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/pascal-triangle0652/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "6. Paths-to-reach-origin3", | ||
| "difficulty": "medium", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/paths-to-reach-origin3850/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "7. Gray-to-binary-equivalent", | ||
| "difficulty": "medium", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/gray-to-binary-equivalent-1587115620/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "8. Find-triplets-with-zero-sum", | ||
| "difficulty": "medium", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-triplets-with-zero-sum/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "9. Two-repeated-elements", | ||
| "difficulty": "medium", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/two-repeated-elements-1587115621/0", | ||
| "solutionLink": "#" | ||
| }, | ||
| { | ||
| "problemName": "10. Lemonade-change", | ||
| "difficulty": "medium", | ||
| "leetCodeLink": "https://www.geeksforgeeks.org/problems/lemonade-change/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. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters