Skip to content

Commit 3b17e13

Browse files
ajay-dhangarajay-dhangar
authored
Merge pull request #329 from komal-agarwal5/main
Added GFG section under DSA problems
2 parents 3cd4c50 + 2d8dce3 commit 3b17e13

File tree

5 files changed

+329
-0
lines changed

5 files changed

+329
-0
lines changed

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

Lines changed: 82 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,82 @@
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+
"leetCodeLink": "https://geeksforgeeks.org/problems/preorder-traversal/0",
23+
"solutionLink": "#"
24+
},
25+
{
26+
"problemName": "3. Peak element",
27+
"difficulty": "basic",
28+
"leetCodeLink": "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 array",
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.

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

Lines changed: 82 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,82 @@
1+
---
2+
id: problems
3+
title: GFG easy problems
4+
sidebar_label: problems
5+
keywords:
6+
- gfg problems
7+
- gfg problems easy
8+
- gfg problems problems
9+
---
10+
11+
12+
export const problems = [
13+
{
14+
"problemName": "1. Reverse-a-linked-list",
15+
"difficulty": "easy",
16+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-linked-list/0",
17+
"solutionLink": "#"
18+
},
19+
{
20+
"problemName": "2. Reverse-a-doubly-linked-list",
21+
"difficulty": "easy",
22+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-doubly-linked-list/0",
23+
"solutionLink": "#"
24+
},
25+
{
26+
"problemName": "3. Delete-without-head-pointer",
27+
"difficulty": "easy",
28+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/delete-without-head-pointer/0",
29+
"solutionLink": "#"
30+
},
31+
{
32+
"problemName": "4. Check-for-balanced-tree",
33+
"difficulty": "easy",
34+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/check-for-balanced-tree/0",
35+
"solutionLink": "#"
36+
},
37+
{
38+
"problemName": "5. Delete-middle-of-linked-list",
39+
"difficulty": "easy",
40+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/delete-middle-of-linked-list/0",
41+
"solutionLink": "#"
42+
},
43+
{
44+
"problemName": "6. Intersection-of-two-sorted-linked-lists",
45+
"difficulty": "easy",
46+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/0",
47+
"solutionLink": "#"
48+
},
49+
{
50+
"problemName": "7. DFS-traversal-of-graph",
51+
"difficulty": "easy",
52+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/0",
53+
"solutionLink": "#"
54+
},
55+
{
56+
"problemName": "8. BFS-traversal-of-graph",
57+
"difficulty": "easy",
58+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/bfs-traversal-of-graph/0",
59+
"solutionLink": "#"
60+
},
61+
{
62+
"problemName": "9. Square-root",
63+
"difficulty": "easy",
64+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/square-root/0",
65+
"solutionLink": "#"
66+
},
67+
{
68+
"problemName": "10. Implement-two-stacks-in-an-array",
69+
"difficulty": "easy",
70+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/implement-two-stacks-in-an-array/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.

‎dsa-problems/gfg-problems/hard/problems.md

Lines changed: 82 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,82 @@
1+
---
2+
id: problems
3+
title: GFG hard problems
4+
sidebar_label: problems
5+
keywords:
6+
- gfg problems
7+
- gfg problems hard
8+
- gfg problems problems
9+
---
10+
11+
12+
export const problems = [
13+
{
14+
"problemName": "1. Next-happy-number",
15+
"difficulty": "hard",
16+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/next-happy-number4538/0",
17+
"solutionLink": "#"
18+
},
19+
{
20+
"problemName": "2. Merge-two-sorted-arrays",
21+
"difficulty": "hard",
22+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-two-sorted-arrays-1587115620/0",
23+
"solutionLink": "#"
24+
},
25+
{
26+
"problemName": "3. Word-ladder",
27+
"difficulty": "hard",
28+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/word-ladder/1",
29+
"solutionLink": "#"
30+
},
31+
{
32+
"problemName": "4. Minimum-indexed-character",
33+
"difficulty": "hard",
34+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-indexed-character-1587115620/1",
35+
"solutionLink": "#"
36+
},
37+
{
38+
"problemName": "5. Minimum-x-xor-a",
39+
"difficulty": "hard",
40+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-x-xor-a--170645/1",
41+
"solutionLink": "#"
42+
},
43+
{
44+
"problemName": "6. Winner-of-an-election-where-votes-are-represented-as-candidate-names",
45+
"difficulty": "hard",
46+
"leetCodeLink": "hhttps://www.geeksforgeeks.org/problems/winner-of-an-election-where-votes-are-represented-as-candidate-names-1587115621/1",
47+
"solutionLink": "#"
48+
},
49+
{
50+
"problemName": "7. Shortest-unique-prefix-for-every-word",
51+
"difficulty": "hard",
52+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-unique-prefix-for-every-word/1",
53+
"solutionLink": "#"
54+
},
55+
{
56+
"problemName": "8. Closest-palindrome",
57+
"difficulty": "hard",
58+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/closest-palindrome4519/1?page=1&difficulty=Hard&sortBy=difficulty",
59+
"solutionLink": "#"
60+
},
61+
{
62+
"problemName": "9. Number-of-subsets-with-product-less-than-k",
63+
"difficulty": "hard",
64+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-subsets-with-product-less-than-k/1?page=1&difficulty=Hard&sortBy=difficulty",
65+
"solutionLink": "#"
66+
},
67+
{
68+
"problemName": "10. Minimize-max-distance-to-gas-station",
69+
"difficulty": "hard",
70+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/minimize-max-distance-to-gas-station/1?page=1&difficulty=Hard&sortBy=difficulty",
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.

‎dsa-problems/gfg-problems/medium/problems.md

Lines changed: 82 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,82 @@
1+
---
2+
id: problems
3+
title: GFG medium problems
4+
sidebar_label: problems
5+
keywords:
6+
- gfg problems
7+
- gfg problems medium
8+
- gfg problems problems
9+
---
10+
11+
12+
export const problems = [
13+
{
14+
"problemName": "1. Matchsticks-game",
15+
"difficulty": "medium",
16+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/-matchsticks-game4906/0",
17+
"solutionLink": "#"
18+
},
19+
{
20+
"problemName": "2. Fibonacci-sum",
21+
"difficulty": "medium",
22+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/fibonacci-sum1423/0",
23+
"solutionLink": "#"
24+
},
25+
{
26+
"problemName": "3. Count-the-subarrays-having-product-less-than-k",
27+
"difficulty": "medium",
28+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/count-the-subarrays-having-product-less-than-k1708/0",
29+
"solutionLink": "#"
30+
},
31+
{
32+
"problemName": "4. How-many-X's",
33+
"difficulty": "medium",
34+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/how-many-xs4514/0",
35+
"solutionLink": "#"
36+
},
37+
{
38+
"problemName": "5. Pascal-triangle",
39+
"difficulty": "medium",
40+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/pascal-triangle0652/0",
41+
"solutionLink": "#"
42+
},
43+
{
44+
"problemName": "6. Paths-to-reach-origin3",
45+
"difficulty": "medium",
46+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/paths-to-reach-origin3850/0",
47+
"solutionLink": "#"
48+
},
49+
{
50+
"problemName": "7. Gray-to-binary-equivalent",
51+
"difficulty": "medium",
52+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/gray-to-binary-equivalent-1587115620/0",
53+
"solutionLink": "#"
54+
},
55+
{
56+
"problemName": "8. Find-triplets-with-zero-sum",
57+
"difficulty": "medium",
58+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/find-triplets-with-zero-sum/0",
59+
"solutionLink": "#"
60+
},
61+
{
62+
"problemName": "9. Two-repeated-elements",
63+
"difficulty": "medium",
64+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/two-repeated-elements-1587115621/0",
65+
"solutionLink": "#"
66+
},
67+
{
68+
"problemName": "10. Lemonade-change",
69+
"difficulty": "medium",
70+
"leetCodeLink": "https://www.geeksforgeeks.org/problems/lemonade-change/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.

‎dsa-problems/index.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@
22
title: Data Structures and Algorithms Problems
33
sidebar_label: DSA Problems
44
sidebar_position: 1
5+
56
---
67

78
In this section, you will learn about the problems of Data Structures and Algorithms.

0 commit comments

Comments
 (0)