diff --git a/dsa-problems/gfg-problems/hard/0101-0200.md b/dsa-problems/gfg-problems/hard/0101-0200.md
new file mode 100644
index 000000000..2c5c93252
--- /dev/null
+++ b/dsa-problems/gfg-problems/hard/0101-0200.md
@@ -0,0 +1,622 @@
+---
+id: 0101-0200
+title: GFG hard problems 0101-0200
+sidebar_label: 0101-0200
+keywords:
+  - gfg problems
+  - gfg problems hard
+  - gfg problems problems
+---
+
+
+export const problems = [
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-turns-in-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Number of Turns in Binary Tree"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-bst-sum-subtree--170647/1",
+    "solutionLink": "#",
+    "problemName": "Minimum BST Sum Subtree"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/partition-the-array--170647/1",
+    "solutionLink": "#",
+    "problemName": "Partition the Array"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-path-by-removing-k-walls/1",
+    "solutionLink": "#",
+    "problemName": "Shortest Path by Removing K walls"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/scrambled-string/1",
+    "solutionLink": "#",
+    "problemName": "Scrambled String"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/travelling-salesman-problem2732/1",
+    "solutionLink": "#",
+    "problemName": "Travelling Salesman Problem"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/divide-in-incremental-groups--170647/1",
+    "solutionLink": "#",
+    "problemName": "Divide in Incremental Groups"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/game-of-subsets/1",
+    "solutionLink": "#",
+    "problemName": "Game Of Subsets"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/132-geeky-buildings--141631/1",
+    "solutionLink": "#",
+    "problemName": "132 Geeky Buildings"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/median-of-the-subarrays--170647/1",
+    "solutionLink": "#",
+    "problemName": "Median of the Subarrays"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-number-of-coins--170647/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Number of coins"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/fixing-two-swapped-nodes-of-a-bst--170646/1",
+    "solutionLink": "#",
+    "problemName": "Fixing Two swapped nodes of a BST"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/palindrome-pairs/1",
+    "solutionLink": "#",
+    "problemName": "Palindrome Pairs"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/water-connection-problem5822/1",
+    "solutionLink": "#",
+    "problemName": "Water Connection Problem"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-path-using-atmost-one-curved-edge--170647/1",
+    "solutionLink": "#",
+    "problemName": "Shortest Path Using Atmost One Curved Edge"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-formation3506/1",
+    "solutionLink": "#",
+    "problemName": "Number Formation"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/avoid-explosion--170647/1",
+    "solutionLink": "#",
+    "problemName": "Avoid Explosion"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/ipl-2021-final--141634/1",
+    "solutionLink": "#",
+    "problemName": "IPL 2021 - Final"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/max-min-height--170647/1",
+    "solutionLink": "#",
+    "problemName": "Max min Height"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/select-nodes--170645/1",
+    "solutionLink": "#",
+    "problemName": "Select Nodes"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-occurences-of-a-given-word-in-a-2-d-array/1",
+    "solutionLink": "#",
+    "problemName": "Count occurrences of a given word in a 2-d array"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-connected-group/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Connected group"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-insertions-to-make-two-arrays-equal/1",
+    "solutionLink": "#",
+    "problemName": "Minimum operations to convert array A to B"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-the-substring--170645/1",
+    "solutionLink": "#",
+    "problemName": "Count the Substring"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-sublist-of-a-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Reverse a sublist of a linked list"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-lucky-permutations--170645/1",
+    "solutionLink": "#",
+    "problemName": "Count Lucky Permutations"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/burst-balloons/1",
+    "solutionLink": "#",
+    "problemName": "Burst Balloons"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-unique-prefix-for-every-word/1",
+    "solutionLink": "#",
+    "problemName": "Shortest Unique prefix for every word"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/assignment-problem3016/1",
+    "solutionLink": "#",
+    "problemName": "Assignment Problem"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/x-xor-a-is-minimum-and-set-bits-in-x-b/1",
+    "solutionLink": "#",
+    "problemName": "Minimum X (xor) A"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/convex-hull2138/1",
+    "solutionLink": "#",
+    "problemName": "Convex Hull"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/adventure-in-a-maze2051/1",
+    "solutionLink": "#",
+    "problemName": "Adventure in a Maze"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/ncr-mod-m-part-10038/1",
+    "solutionLink": "#",
+    "problemName": "nCr mod M | Part 1"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-subsets-with-product-less-than-k/1",
+    "solutionLink": "#",
+    "problemName": "Number of subsets with product less than k"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-the-number-of-subarrays/1",
+    "solutionLink": "#",
+    "problemName": "Count the number of subarrays"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-tree-traversal--141628/1",
+    "solutionLink": "#",
+    "problemName": "Check Tree Traversal"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-path-in-a-matrix3019/1",
+    "solutionLink": "#",
+    "problemName": "Longest Path in a matrix"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/bike-racing0543/1",
+    "solutionLink": "#",
+    "problemName": "Bike Racing"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/word-break-trie--141631/1",
+    "solutionLink": "#",
+    "problemName": "Word Break (Trie)"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/chocolates-pickup/1",
+    "solutionLink": "#",
+    "problemName": "Chocolates Pickup"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/huffman-decoding/1",
+    "solutionLink": "#",
+    "problemName": "Huffman Decoding"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-zig-zag-sub-sequence2656/1",
+    "solutionLink": "#",
+    "problemName": "Longest Zig-Zag Sub Sequence"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/optimal-binary-search-tree2214/1",
+    "solutionLink": "#",
+    "problemName": "Optimal binary search tree"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-time-to-fulfil-all-orders/1",
+    "solutionLink": "#",
+    "problemName": "Minimum time to fulfil all orders"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-maximum-flow2126/1",
+    "solutionLink": "#",
+    "problemName": "Find the Maximum Flow"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-palindromic-substring-in-linear-time/1",
+    "solutionLink": "#",
+    "problemName": "Longest Palindromic Substring in Linear Time"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/points-in-straight-line/1",
+    "solutionLink": "#",
+    "problemName": "Points in Straight Line"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/articulation-point2616/1",
+    "solutionLink": "#",
+    "problemName": "Articulation Point - II"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/interesting-queries4742/1",
+    "solutionLink": "#",
+    "problemName": "Interesting Queries"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-distinct-words-with-k-maximum-contiguous-vowels--141631/1",
+    "solutionLink": "#",
+    "problemName": "Number of distinct words with K maximum contiguous vowels"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-substring-whose-character-rearranged-can-form-a-palindrome/1",
+    "solutionLink": "#",
+    "problemName": "Longest substring to form a Palindrome"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/corona-vaccine--141631/1",
+    "solutionLink": "#",
+    "problemName": "Corona Vaccine"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/kill-captain-america0228/1",
+    "solutionLink": "#",
+    "problemName": "Kill Captain America"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/geek-in-a-maze--170637/1",
+    "solutionLink": "#",
+    "problemName": "Geek in a Maze"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-increasing-path-in-a-matrix/1",
+    "solutionLink": "#",
+    "problemName": "Longest Increasing Path in a Matrix"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/array-partition/1",
+    "solutionLink": "#",
+    "problemName": "Array Partition"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-largest-rectangle-of-1s-with-swapping-of-columns-allowed0243/1",
+    "solutionLink": "#",
+    "problemName": "Largest rectangle of 1s with swapping of columns allowed"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-invalid-parentheses/1",
+    "solutionLink": "#",
+    "problemName": "Remove Invalid Parentheses"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/lets-play0201/1",
+    "solutionLink": "#",
+    "problemName": "Let's Play!!!"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/doctor-strange2206/1",
+    "solutionLink": "#",
+    "problemName": "Doctor Strange"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-reverse-pairs/1",
+    "solutionLink": "#",
+    "problemName": "Count Reverse Pairs"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-swap-required-to-convert-binary-tree-to-binary-search-tree/1",
+    "solutionLink": "#",
+    "problemName": "Minimum swap required to convert binary tree to binary search tree"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/secret-cipher--141631/1",
+    "solutionLink": "#",
+    "problemName": "Secret Cipher"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-xor-subset0715/1",
+    "solutionLink": "#",
+    "problemName": "Maximum XOR subset"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-path-in-a-directed-acyclic-graph/1",
+    "solutionLink": "#",
+    "problemName": "Longest Path in a Directed Acyclic Graph"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-number-to-make-median-x3029/1",
+    "solutionLink": "#",
+    "problemName": "Minimum number to make median X"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/kth-smallest-number-in-multiplication-table/1",
+    "solutionLink": "#",
+    "problemName": "Kth Smallest Number in Multiplication Table"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/nth-digit-of-pie5851/1",
+    "solutionLink": "#",
+    "problemName": "Nth digit of pi"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/elixir-of-life--141631/1",
+    "solutionLink": "#",
+    "problemName": "Elixir of Life"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/all-numbers-with-specific-difference3558/1",
+    "solutionLink": "#",
+    "problemName": "All numbers with specific difference"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-pairs-1645358985/1",
+    "solutionLink": "#",
+    "problemName": "Number of pairs"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rearrange-the-array-1639032648/1",
+    "solutionLink": "#",
+    "problemName": "Rearrange the array"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-range-in-bst--141631/1",
+    "solutionLink": "#",
+    "problemName": "Shortest Range In BST"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/search-query-auto-complete/1",
+    "solutionLink": "#",
+    "problemName": "Search Query Auto Complete"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/cut-woods/1",
+    "solutionLink": "#",
+    "problemName": "Cut woods"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/intersecting-intervals/1",
+    "solutionLink": "#",
+    "problemName": "Maximum number of overlapping Intervals"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/create-your-own-calculator4308/1",
+    "solutionLink": "#",
+    "problemName": "Create your own Calculator"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/very-tough-problem2653/1",
+    "solutionLink": "#",
+    "problemName": "Very Tough Problem"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-number-of-elements-which-are-not-part-of-increasing-or-decreasing-subsequence2617/1",
+    "solutionLink": "#",
+    "problemName": "Minimum number of elements"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-minimum-s-t-cut-in-a-flow-network2902/1",
+    "solutionLink": "#",
+    "problemName": "Find minimum s-t cut in a flow network"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/lfu-cache-1665050355/1",
+    "solutionLink": "#",
+    "problemName": "LFU cache"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sid-and-his-prime-money5736/1",
+    "solutionLink": "#",
+    "problemName": "Sid and his prime money"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-difference-between-pair-in-a-matrix/1",
+    "solutionLink": "#",
+    "problemName": "Maximum difference between pair in a matrix"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-palindrome-pattern3900/1",
+    "solutionLink": "#",
+    "problemName": "The Palindrome Pattern"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-pattern4155/1",
+    "solutionLink": "#",
+    "problemName": "Find the pattern"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/akku-and-arrays4452/1",
+    "solutionLink": "#",
+    "problemName": "Akku and Arrays"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/subset-sums-between-the-given-range/1",
+    "solutionLink": "#",
+    "problemName": "Subset sums between the given range"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/partition-a-set-into-two-subsets-such-that-the-difference-of-subset-sums-is-minimum-set-2/1",
+    "solutionLink": "#",
+    "problemName": "Partition a set into two subsets such that the difference of subset sums is minimum (Set-2)"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/k-centers-problem/1",
+    "solutionLink": "#",
+    "problemName": "K Centers Problem"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/ipl-2021-match-day-6-semi-final--141634/1",
+    "solutionLink": "#",
+    "problemName": "IPL 2021 - Match Day 6 - Semi Final"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-xor-with-an-element-from-array/1",
+    "solutionLink": "#",
+    "problemName": "Maximum XOR With an Element From Array"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/next-optimal-move-in-tic-tac-toe2842/1",
+    "solutionLink": "#",
+    "problemName": "Next Optimal Move in Tic Tac Toe"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/hexadecimal-to-decimal-counter1627/1",
+    "solutionLink": "#",
+    "problemName": "Hexadecimal to decimal counter"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-triple-product/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Triple Product"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/total-number-of-spanning-trees-in-a-graph/1",
+    "solutionLink": "#",
+    "problemName": "Total Number Of Spanning Trees In A Graph"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-travel-time/1",
+    "solutionLink": "#",
+    "problemName": "Minimum travel time"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-number-of-sprinkler--170645/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Number Of Sprinkler"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/joey-doesnt-share-food5712/1",
+    "solutionLink": "#",
+    "problemName": "Joey doesn't share food"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/greater-or-less--170646/1",
+    "solutionLink": "#",
+    "problemName": "Greater or Less"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-cost-to-merge-stones/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Cost to Merge Stones"
+  }
+]
+
+<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.
\ No newline at end of file