diff --git a/dsa-problems/gfg-problems/easy/0101-0200.md b/dsa-problems/gfg-problems/easy/0101-0200.md
new file mode 100644
index 000000000..af3dc5cf1
--- /dev/null
+++ b/dsa-problems/gfg-problems/easy/0101-0200.md
@@ -0,0 +1,622 @@
+---
+id: 0101-0200 
+title: GFG easy problems 0101-0200
+sidebar_label: 0101-0200
+keywords:
+  - gfg problems
+  - gfg problems easy
+  - gfg problems problems
+---
+
+
+export const problems = [
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-distinct-elements-in-every-window/1",
+    "solutionLink": "#",
+    "problemName": "Count distinct elements in every window"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/inorder-successor-in-bst/1",
+    "solutionLink": "#",
+    "problemName": "Inorder Successor in BST"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/index-of-an-extra-element/1",
+    "solutionLink": "#",
+    "problemName": "Index of an Extra Element"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/armstrong-numbers2727/1",
+    "solutionLink": "#",
+    "problemName": "Armstrong Numbers"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-doubly-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Reverse a Doubly Linked List"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rightmost-different-bit-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Rightmost different bit"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-duplicates3034/1",
+    "solutionLink": "#",
+    "problemName": "Remove Duplicates"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-the-zeros2550/1",
+    "solutionLink": "#",
+    "problemName": "Count the Zeros"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-pairs-whose-sum-is-equal-to-x/1",
+    "solutionLink": "#",
+    "problemName": "Count Pairs whose sum is equal to X"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/is-binary-number-multiple-of-30654/1",
+    "solutionLink": "#",
+    "problemName": "Is Binary Number Multiple of 3"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/k-distance-from-root/1",
+    "solutionLink": "#",
+    "problemName": "K distance from root"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-element-occurences/1",
+    "solutionLink": "#",
+    "problemName": "Count More than n/k Occurences"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-element-in-a-sorted-and-rotated-array3611/1",
+    "solutionLink": "#",
+    "problemName": "Minimum element in a sorted and rotated array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/josephus-problem/1",
+    "solutionLink": "#",
+    "problemName": "Josephus problem"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/non-repeating-element3958/1",
+    "solutionLink": "#",
+    "problemName": "Non-Repeating Element"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/selection-sort/1",
+    "solutionLink": "#",
+    "problemName": "Selection Sort"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-nth-root-of-m5843/1",
+    "solutionLink": "#",
+    "problemName": "Find Nth root of M"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/root-to-leaf-path-sum/1",
+    "solutionLink": "#",
+    "problemName": "Root to leaf path sum"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/boundary-traversal-of-matrix-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Boundary traversal of matrix"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-optimum-operation4504/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Operations"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/transpose-of-matrix-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Transpose of Matrix"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-string-using-stack/1",
+    "solutionLink": "#",
+    "problemName": "Reverse a string using Stack"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/precise-fomat-java/1",
+    "solutionLink": "#",
+    "problemName": "Precise Format - Java"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/trailing-zeroes-in-factorial5134/1",
+    "solutionLink": "#",
+    "problemName": "Trailing zeroes in factorial"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-all-duplicates-from-a-given-string4321/1",
+    "solutionLink": "#",
+    "problemName": "Remove all duplicates from a given string"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-all-divisors-from-1-to-n4738/1",
+    "solutionLink": "#",
+    "problemName": "Sum of all divisors from 1 to n"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/in-first-but-second5423/1",
+    "solutionLink": "#",
+    "problemName": "Find missing in second array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-element-that-appears-once-in-sorted-array0624/1",
+    "solutionLink": "#",
+    "problemName": "Find the element that appears once in sorted array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/median-of-bst/1",
+    "solutionLink": "#",
+    "problemName": "Median of BST"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1",
+    "solutionLink": "#",
+    "problemName": "Count BST nodes that lie in a given range"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimize-the-sum-of-product1525/1",
+    "solutionLink": "#",
+    "problemName": "Minimize the sum of product"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-coding2452/1",
+    "solutionLink": "#",
+    "problemName": "Reverse Coding"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/winner-of-an-election-where-votes-are-represented-as-candidate-names-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Winner of an election"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-every-kth-node/1",
+    "solutionLink": "#",
+    "problemName": "Remove every kth node"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/need-some-change/1",
+    "solutionLink": "#",
+    "problemName": "Swap the array elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/delete-node-in-doubly-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Delete node in Doubly Linked List"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-subarray-of-0s-and-1s/1",
+    "solutionLink": "#",
+    "problemName": "Largest subarray of 0's and 1's"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-all-possible-paths-from-top-left-to-bottom-right3011/1",
+    "solutionLink": "#",
+    "problemName": "Count all possible paths from top left to bottom right"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/special-stack/1",
+    "solutionLink": "#",
+    "problemName": "Special Stack"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-pattern3549/1",
+    "solutionLink": "#",
+    "problemName": "Print Pattern"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-indexed-character-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Minimum indexed character"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rotate-bits4524/1",
+    "solutionLink": "#",
+    "problemName": "Rotate Bits"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/evaluation-of-postfix-expression1735/1",
+    "solutionLink": "#",
+    "problemName": "Evaluation of Postfix Expression"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-path-from-1-to-n0156/1",
+    "solutionLink": "#",
+    "problemName": "Shortest path from 1 to n"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/alone-in-couple5507/1",
+    "solutionLink": "#",
+    "problemName": "Party of Couples"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-closest-number5513/1",
+    "solutionLink": "#",
+    "problemName": "Find the closest number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/segregate-0s-and-1s5106/1",
+    "solutionLink": "#",
+    "problemName": "Segregate 0s and 1s"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-first-repeated-character4108/1",
+    "solutionLink": "#",
+    "problemName": "Find first repeated character"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximize-toys0331/1",
+    "solutionLink": "#",
+    "problemName": "Maximize Toys"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/level-order-traversal-line-by-line/1",
+    "solutionLink": "#",
+    "problemName": "Level order traversal Line by Line"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rotate-by-90-degree-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Rotate by 90 degree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/form-a-number-divisible-by-3-using-array-digits0717/1",
+    "solutionLink": "#",
+    "problemName": "Form a number divisible by 3 using array digits"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/start-coding-java/1",
+    "solutionLink": "#",
+    "problemName": "Start Coding - Java"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/binary-tree-to-bst/1",
+    "solutionLink": "#",
+    "problemName": "Binary Tree to BST"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-width-of-tree/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Width of Tree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/predict-the-column/1",
+    "solutionLink": "#",
+    "problemName": "Predict the Column"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/pangram-checking-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Panagram Checking"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/series-gp4646/1",
+    "solutionLink": "#",
+    "problemName": "Series GP"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/reach-the-nth-point5433/1",
+    "solutionLink": "#",
+    "problemName": "Reach the Nth point"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/modular-multiplicative-inverse-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Modular Multiplicative Inverse"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximize-sum-after-k-negations1149/1",
+    "solutionLink": "#",
+    "problemName": "Maximize sum after K negations"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/shop-in-candy-store1145/1",
+    "solutionLink": "#",
+    "problemName": "Shop in Candy Store"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-number-in-a-sorted-rotated-array-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Number in a sorted rotated array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-first-and-last-occurrence-of-x0849/1",
+    "solutionLink": "#",
+    "problemName": "Left most and right most index"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-frequency/1",
+    "solutionLink": "#",
+    "problemName": "Find the Frequency"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-the-status/1",
+    "solutionLink": "#",
+    "problemName": "Check the status - Python"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/decimal-equivalent-of-binary-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Decimal Equivalent of Binary Linked List"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/-minimum-number-of-coins4426/1",
+    "solutionLink": "#",
+    "problemName": "Minimum number of Coins"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/transform-to-sum-tree/1",
+    "solutionLink": "#",
+    "problemName": "Transform to Sum Tree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-new-line/1",
+    "solutionLink": "#",
+    "problemName": "The New Line"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-depth-of-a-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Depth of a Binary Tree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/second-most-repeated-string-in-a-sequence0534/1",
+    "solutionLink": "#",
+    "problemName": "Second most repeated string in a sequence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/plus-one/1",
+    "solutionLink": "#",
+    "problemName": "Plus One"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-highest-number2259/1",
+    "solutionLink": "#",
+    "problemName": "Find the Highest number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-matrix-in-snake-pattern-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Print Matrix in snake Pattern"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-a-number-is-divisible-by-83957/1",
+    "solutionLink": "#",
+    "problemName": "Check if a number is divisible by 8"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-bits3556/1",
+    "solutionLink": "#",
+    "problemName": "Reverse Bits"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-upper-and-lower-triangles-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Sum of upper and lower triangles"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/taking-input-java/1",
+    "solutionLink": "#",
+    "problemName": "Taking input - Java"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/search-insert-position-of-k-in-a-sorted-array/1",
+    "solutionLink": "#",
+    "problemName": "Search insert position of K in a sorted array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-ways-to-nth-stairorder-does-not-matter1322/1",
+    "solutionLink": "#",
+    "problemName": "Count ways to N'th Stair"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-new-line-java/1",
+    "solutionLink": "#",
+    "problemName": "The New Line - Java"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/play-with-or5515/1",
+    "solutionLink": "#",
+    "problemName": "Play With OR"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/row-with-minimum-number-of-1s5430/1",
+    "solutionLink": "#",
+    "problemName": "Row with minimum number of 1's"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-closest-pair-from-two-arrays4215/1",
+    "solutionLink": "#",
+    "problemName": "Find the closest pair from two arrays"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/k-largest-elements3736/1",
+    "solutionLink": "#",
+    "problemName": "K largest elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-consecutive-1s-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Longest Consecutive 1's"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-integer--170647/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Integer"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/for-loop-primechecl/1",
+    "solutionLink": "#",
+    "problemName": "For Loop- primeCheck"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/reach-a-given-score-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Reach a given score"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/brothers-from-different-root/1",
+    "solutionLink": "#",
+    "problemName": "Brothers From Different Roots"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/does-array-represent-heap4345/1",
+    "solutionLink": "#",
+    "problemName": "Does array represent Heap"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-the-elements1529/1",
+    "solutionLink": "#",
+    "problemName": "Count the elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/intersection-of-two-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Intersection of Two Linked Lists"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/get-min-at-pop/1",
+    "solutionLink": "#",
+    "problemName": "Get min at pop"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/learn-to-comment/1",
+    "solutionLink": "#",
+    "problemName": "Learn to Comment"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-two-strings-are-k-anagrams-or-not/1",
+    "solutionLink": "#",
+    "problemName": "Check if two strings are k-anagrams or not"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/for-loop-primecheck-java/1",
+    "solutionLink": "#",
+    "problemName": "For Loop- primeCheck - Java"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/run-length-encoding/1",
+    "solutionLink": "#",
+    "problemName": "Run Length Encoding"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/equal-to-product3836/1",
+    "solutionLink": "#",
+    "problemName": "Product Pair"
+  }
+]
+
+<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