diff --git a/dsa-problems/gfg-problems/medium/0001-0100.md b/dsa-problems/gfg-problems/medium/0001-0100.md
new file mode 100644
index 000000000..f2be4e399
--- /dev/null
+++ b/dsa-problems/gfg-problems/medium/0001-0100.md
@@ -0,0 +1,622 @@
+---
+id: 0001-0100
+title: GFG medium problems 0001-0100
+sidebar_label: 0001-0100
+keywords:
+  - gfg problems
+  - gfg problems medium
+  - gfg problems problems
+---
+
+
+export const problems = [
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/subarray-with-given-sum-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Find Indexes of a subarray with given sum"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Kadane's Algorithm"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-number-of-jumps-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Minimum number of jumps"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s4231/1",
+    "solutionLink": "#",
+    "problemName": "Sort an array of 0s, 1s and 2s"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/majority-element-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Majority Element"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/kth-smallest-element5635/1",
+    "solutionLink": "#",
+    "problemName": "Kth smallest element"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimize-the-heights3351/1",
+    "solutionLink": "#",
+    "problemName": "Minimize the Heights II"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/inversion-of-array-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Count Inversions"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-loop-in-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Remove loop in Linked List"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/detect-loop-in-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Detect Loop in linked list"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-platforms-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Platforms"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/trapping-rain-water-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Trapping Rain Water"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-missing-and-repeating2512/1",
+    "solutionLink": "#",
+    "problemName": "Find Missing And Repeating"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/0-1-knapsack-problem0945/1",
+    "solutionLink": "#",
+    "problemName": "0 - 1 Knapsack Problem"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1",
+    "solutionLink": "#",
+    "problemName": "Detect cycle in an undirected graph"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/next-larger-element-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Next Greater Element"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1",
+    "solutionLink": "#",
+    "problemName": "Detect cycle in a directed graph"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-product-subarray3604/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Product Subarray"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Boundary Traversal of binary tree"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/smallest-positive-missing-number-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Smallest Positive missing number"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-triplets-with-zero-sum/1",
+    "solutionLink": "#",
+    "problemName": "Find triplets with zero sum"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1",
+    "solutionLink": "#",
+    "problemName": "Check if Linked List is Palindrome"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k3101/1",
+    "solutionLink": "#",
+    "problemName": "Maximum of all subarrays of size k"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/ncr1019/1",
+    "solutionLink": "#",
+    "problemName": "nCr"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-palindrome-in-a-string3411/1",
+    "solutionLink": "#",
+    "problemName": "Longest Palindrome in a String"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-consecutive-subsequence2449/1",
+    "solutionLink": "#",
+    "problemName": "Longest consecutive subsequence"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/power-of-numbers-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Power Of Numbers"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/top-view-of-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Top View of Binary Tree"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-increasing-subsequence-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Longest Increasing Subsequence"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-subarray-with-0-sum/1",
+    "solutionLink": "#",
+    "problemName": "Largest subarray with 0 sum"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/triplet-sum-in-array-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Triplet Sum in Array"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/diameter-of-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Diameter of a Binary Tree"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-common-subsequence-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Longest Common Subsequence"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/perfect-sum-problem5633/1",
+    "solutionLink": "#",
+    "problemName": "Perfect Sum Problem"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1",
+    "solutionLink": "#",
+    "problemName": "Add two numbers represented by linked lists"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/stock-buy-and-sell-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Stock buy and sell"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1",
+    "solutionLink": "#",
+    "problemName": "Intersection Point in Y Shaped Linked Lists"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/subarray-with-0-sum-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Subarray with 0 sum"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/permutations-of-a-given-string2041/1",
+    "solutionLink": "#",
+    "problemName": "Permutations of a given string"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-sub-array-with-sum-k0809/1",
+    "solutionLink": "#",
+    "problemName": "Longest Sub-Array with Sum K"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/first-and-last-occurrences-of-x3116/1",
+    "solutionLink": "#",
+    "problemName": "First and last occurrences of x"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/coin-change2448/1",
+    "solutionLink": "#",
+    "problemName": "Coin Change"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/row-with-max-1s0023/1",
+    "solutionLink": "#",
+    "problemName": "Row with max 1s"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/spirally-traversing-a-matrix-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Spirally traversing a matrix"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rat-in-a-maze-problem/1",
+    "solutionLink": "#",
+    "problemName": "Rat in a Maze Problem - I"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/get-minimum-element-from-stack/1",
+    "solutionLink": "#",
+    "problemName": "Get minimum element from stack"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/fractional-knapsack-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Fractional Knapsack"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-index-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Index"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/-rearrange-array-alternately-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Rearrange Array Alternately"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-celebrity-problem/1",
+    "solutionLink": "#",
+    "problemName": "The Celebrity Problem"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/subset-sum-problem2014/1",
+    "solutionLink": "#",
+    "problemName": "Partition Equal Subset Sum"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/validate-an-ip-address-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Validate an IP Address"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-tree/1",
+    "solutionLink": "#",
+    "problemName": "Sum Tree"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/union-of-two-sorted-arrays-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Union of Two Sorted Arrays"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Bottom View of Binary Tree"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/stickler-theif-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Stickler Thief"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rotate-a-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Rotate a Linked List"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/k-th-element-of-two-sorted-array1317/1",
+    "solutionLink": "#",
+    "problemName": "K-th element of two  Arrays"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/implement-atoi/1",
+    "solutionLink": "#",
+    "problemName": "Implement Atoi"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/pythagorean-triplet3018/1",
+    "solutionLink": "#",
+    "problemName": "Pythagorean Triplet"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-index3307/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Index"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/multiply-two-strings/1",
+    "solutionLink": "#",
+    "problemName": "Multiply two strings"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/topological-sort/1",
+    "solutionLink": "#",
+    "problemName": "Topological sort"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/cutted-segments1642/1",
+    "solutionLink": "#",
+    "problemName": "Maximize The Cut Segments"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/subset-sum-problem-1611555638/1",
+    "solutionLink": "#",
+    "problemName": "Subset Sum Problem"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/job-sequencing-problem-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Job Sequencing Problem"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream1216/1",
+    "solutionLink": "#",
+    "problemName": "First non-repeating character in a stream"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-common-substring1452/1",
+    "solutionLink": "#",
+    "problemName": "Longest Common Substring"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/search-in-a-rotated-array4618/1",
+    "solutionLink": "#",
+    "problemName": "Search in a Rotated Array"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/quick-sort/1",
+    "solutionLink": "#",
+    "problemName": "Quick Sort"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/add-1-to-a-number-represented-as-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Add 1 to a number represented as linked list"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-all-four-sum-numbers1732/1",
+    "solutionLink": "#",
+    "problemName": "Find All Four Sum Numbers"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-ways-to-reach-the-nth-stair-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Count ways to reach the n'th stair"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-occurrence2259/1",
+    "solutionLink": "#",
+    "problemName": "Number of occurrence"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/allocate-minimum-number-of-pages0937/1",
+    "solutionLink": "#",
+    "problemName": "Allocate minimum number of pages"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-sum-increasing-subsequence4749/1",
+    "solutionLink": "#",
+    "problemName": "Maximum sum increasing subsequence"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-number-of-islands/1",
+    "solutionLink": "#",
+    "problemName": "Find the number of islands"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-a-binary-tree-in-vertical-order/1",
+    "solutionLink": "#",
+    "problemName": "Vertical Traversal of Binary Tree"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/stock-span-problem-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Stock span problem"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Lowest Common Ancestor in a Binary Tree"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/recursively-remove-all-adjacent-duplicates0744/1",
+    "solutionLink": "#",
+    "problemName": "Recursively remove all adjacent duplicates"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-coins1824/1",
+    "solutionLink": "#",
+    "problemName": "Number of Coins"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/circular-tour-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Circular tour"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/bipartite-graph/1",
+    "solutionLink": "#",
+    "problemName": "Bipartite Graph"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/construct-tree-1/1",
+    "solutionLink": "#",
+    "problemName": "Construct Tree from Inorder & Preorder"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/zigzag-tree-traversal/1",
+    "solutionLink": "#",
+    "problemName": "ZigZag Tree Traversal"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-sort/1",
+    "solutionLink": "#",
+    "problemName": "Merge Sort"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-swaps/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Swaps to Sort"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-number-formed-from-an-array1117/1",
+    "solutionLink": "#",
+    "problemName": "Largest Number formed from an Array"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/k-largest-elements4206/1",
+    "solutionLink": "#",
+    "problemName": "k largest elements"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-total-set-bits-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Count total set bits"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/implementing-dijkstra-set-1-adjacency-matrix/1",
+    "solutionLink": "#",
+    "problemName": "Implementing Dijkstra Algorithm"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-two-sorted-linked-lists/1",
+    "solutionLink": "#",
+    "problemName": "Merge two sorted linked lists"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/first-negative-integer-in-every-window-of-size-k3345/1",
+    "solutionLink": "#",
+    "problemName": "First negative integer in every window of size k"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/finding-the-numbers0215/1",
+    "solutionLink": "#",
+    "problemName": "Non Repeating Numbers"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-k-unique-characters-substring0853/1",
+    "solutionLink": "#",
+    "problemName": "Longest K unique characters substring"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/flattening-a-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Flattening a Linked List"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/factorials-of-large-numbers2508/1",
+    "solutionLink": "#",
+    "problemName": "Factorials of large numbers"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/tower-of-hanoi-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Tower Of Hanoi"
+  },
+  {
+    "difficulty": "Medium",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rotten-oranges2536/1",
+    "solutionLink": "#",
+    "problemName": "Rotten Oranges"
+  }
+]
+
+<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