Skip to content

Commit 2d8dce3

Browse files
hard and medium gfg
1 parent 446d80a commit 2d8dce3

File tree

2 files changed

+164
-0
lines changed

2 files changed

+164
-0
lines changed
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.
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.

0 commit comments

Comments
 (0)