diff --git a/dsa-problems/gfg-problems/easy/0201-0300.md b/dsa-problems/gfg-problems/easy/0201-0300.md
new file mode 100644
index 000000000..20fdac69f
--- /dev/null
+++ b/dsa-problems/gfg-problems/easy/0201-0300.md
@@ -0,0 +1,622 @@
+---
+id: 0201-0300 
+title: GFG easy problems 0201-0300 
+sidebar_label: 0201-0300 
+keywords:
+  - gfg problems
+  - gfg problems easy
+  - gfg problems problems
+---
+
+
+export const problems = [
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/occurence-of-an-integer-in-a-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Occurence of an integer in a Linked List"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-all-prime-numbers-between-1-and-n4404/1",
+    "solutionLink": "#",
+    "problemName": "Sum of all prime numbers between 1 and N."
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-sum-problem2211/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Sum Problem"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/learn-to-comment-java/1",
+    "solutionLink": "#",
+    "problemName": "Learn to Comment - Java"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-open-doors1552/1",
+    "solutionLink": "#",
+    "problemName": "Number Of Open Doors"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sieve-of-eratosthenes5242/1",
+    "solutionLink": "#",
+    "problemName": "Sieve of Eratosthenes"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-it-is-possible-to-survive-on-island4922/1",
+    "solutionLink": "#",
+    "problemName": "Check if it is possible to survive on Island"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/four-elements2452/1",
+    "solutionLink": "#",
+    "problemName": "Four Elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/copy-set-bits-in-range0623/1",
+    "solutionLink": "#",
+    "problemName": "Copy Set Bits in Range"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/three-great-candidates0515/1",
+    "solutionLink": "#",
+    "problemName": "Three Great Candidates"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/split-a-circular-linked-list-into-two-halves/1",
+    "solutionLink": "#",
+    "problemName": "Split a Circular Linked List into two halves"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-bst-elements-in-given-range/1",
+    "solutionLink": "#",
+    "problemName": "Print BST elements in given range"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/smallest-window-containing-0-1-and-2--170637/1",
+    "solutionLink": "#",
+    "problemName": "Smallest window containing 0, 1 and 2"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/roof-top-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Roof Top"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/numbers-containing-1-2-and-32555/1",
+    "solutionLink": "#",
+    "problemName": "Numbers containing 1, 2 and 3"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/right-triangle/1",
+    "solutionLink": "#",
+    "problemName": "Pattern 2"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/inorder-traversal-and-bst5855/1",
+    "solutionLink": "#",
+    "problemName": "Inorder Traversal and BST"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Delete N nodes after M nodes of a linked list"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/frogs-and-jumps--170647/1",
+    "solutionLink": "#",
+    "problemName": "Frogs and Jumps"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-number-with-given-sum-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Largest number with given sum"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/recursive-sequence1611/1",
+    "solutionLink": "#",
+    "problemName": "Recursive sequence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sort-by-set-bit-count1153/1",
+    "solutionLink": "#",
+    "problemName": "Sort by Set Bit Count"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/make-the-array-beautiful--170647/1",
+    "solutionLink": "#",
+    "problemName": "Make the array beautiful"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/pair-with-given-sum-in-a-sorted-array4940/1",
+    "solutionLink": "#",
+    "problemName": "Pair with given sum in a sorted array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/closest-neighbor-in-bst/1",
+    "solutionLink": "#",
+    "problemName": "Closest Neighbour in BST"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/smallest-subset-with-greater-sum/1",
+    "solutionLink": "#",
+    "problemName": "Smallest Subset with Greater Sum"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/fibonacci-series-up-to-nth-term/1",
+    "solutionLink": "#",
+    "problemName": "Fibonacci series up to Nth term"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/unique-rows-in-boolean-matrix/1",
+    "solutionLink": "#",
+    "problemName": "Unique rows in boolean matrix"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/ceil-the-floor2802/1",
+    "solutionLink": "#",
+    "problemName": "Ceil The Floor"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/min-number-of-flips3210/1",
+    "solutionLink": "#",
+    "problemName": "Min Number of Flips"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-of-strings-that-can-be-formed-using-a-b-and-c-under-given-constraints1135/1",
+    "solutionLink": "#",
+    "problemName": "String's Count"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-dependencies-in-a-graph5311/1",
+    "solutionLink": "#",
+    "problemName": "Sum of dependencies in a graph"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/search-in-a-rotated-array0959/1",
+    "solutionLink": "#",
+    "problemName": "Search an element in sorted and rotated array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-leaf-nodes-in-bst/1",
+    "solutionLink": "#",
+    "problemName": "Sum of leaf nodes in BST"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/triangle-number/1",
+    "solutionLink": "#",
+    "problemName": "Pattern 3"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/chinky-and-diamonds3340/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Diamonds"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/facing-the-sun2126/1",
+    "solutionLink": "#",
+    "problemName": "Facing the sun"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/searching-in-an-array-where-adjacent-differ-by-at-most-k0456/1",
+    "solutionLink": "#",
+    "problemName": "Searching in an array where adjacent differ by at most k"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/adding-ones3628/1",
+    "solutionLink": "#",
+    "problemName": "Adding Ones"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/multiply-two-linked-lists/1",
+    "solutionLink": "#",
+    "problemName": "Multiply two linked lists"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/swap-all-odd-and-even-bits-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Swap all odd and even bits"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/unique-frequencies-of-not/1",
+    "solutionLink": "#",
+    "problemName": "Unique Number of Occurrences"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/seating-arrangement--170647/1",
+    "solutionLink": "#",
+    "problemName": "Seating Arrangement"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/leaf-under-budget/1",
+    "solutionLink": "#",
+    "problemName": "Leaf under budget"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-pairs-sum-in-matrices4332/1",
+    "solutionLink": "#",
+    "problemName": "Count pairs Sum in matrices"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/convert-an-array-to-reduced-form1101/1",
+    "solutionLink": "#",
+    "problemName": "Convert an array to reduced form"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/generate-binary-numbers-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Generate Binary Numbers"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-first-node-of-loop-in-linked-list--170645/1",
+    "solutionLink": "#",
+    "problemName": "Find the first node of loop in linked list"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/page-faults-in-lru5603/1",
+    "solutionLink": "#",
+    "problemName": "Page Faults in LRU"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/max-distance-between-same-elements/1",
+    "solutionLink": "#",
+    "problemName": "Max distance between same elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/nextline-and-next/1",
+    "solutionLink": "#",
+    "problemName": "nextLine and next"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/surround-the-1s2505/1",
+    "solutionLink": "#",
+    "problemName": "Surround the 1's"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-two-binary-max-heap0144/1",
+    "solutionLink": "#",
+    "problemName": "Merge two binary Max heaps"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/common-elements5420/1",
+    "solutionLink": "#",
+    "problemName": "Common Elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/overlapping-rectangles1924/1",
+    "solutionLink": "#",
+    "problemName": "Overlapping rectangles"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-elements-between-k1th-and-k2th-smallest-elements3133/1",
+    "solutionLink": "#",
+    "problemName": "Sum of elements between k1'th and k2'th smallest elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/swap-two-nibbles-in-a-byte0446/1",
+    "solutionLink": "#",
+    "problemName": "Swap two nibbles in a byte"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/min-sum-formed-by-digits3551/1",
+    "solutionLink": "#",
+    "problemName": "Min sum formed by digits"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/recamans-sequence4856/1",
+    "solutionLink": "#",
+    "problemName": "Recamans sequence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/triangle-number-1661428795/1",
+    "solutionLink": "#",
+    "problemName": "Pattern 4"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/counting-sort/1",
+    "solutionLink": "#",
+    "problemName": "Counting Sort"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/primes-sum5827/1",
+    "solutionLink": "#",
+    "problemName": "Primes sum"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/data-types-java/1",
+    "solutionLink": "#",
+    "problemName": "Data Types - Java"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/juggler-sequence3930/1",
+    "solutionLink": "#",
+    "problemName": "Juggler Sequence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-no-of-1s-row3027/1",
+    "solutionLink": "#",
+    "problemName": "Maximum no of 1's row"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/taking-input/1",
+    "solutionLink": "#",
+    "problemName": "Taking input"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/intersection-of-two-sorted-array-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Intersection of two sorted arrays"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sort-by-absolute-difference-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Sort by Absolute Difference"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/step-by-step-condition-java/1",
+    "solutionLink": "#",
+    "problemName": "Step by Step Condition - Java"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/frequency-game/1",
+    "solutionLink": "#",
+    "problemName": "Frequency Game"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/ancestors-in-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Ancestors in Binary Tree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/twice-counter4236/1",
+    "solutionLink": "#",
+    "problemName": "Twice Counter"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/you-and-your-books/1",
+    "solutionLink": "#",
+    "problemName": "You and your books"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/help-nobita0532/1",
+    "solutionLink": "#",
+    "problemName": "Odd Even Problem"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/insert-an-element-at-the-bottom-of-a-stack/1",
+    "solutionLink": "#",
+    "problemName": "Insert an Element at the Bottom of a Stack"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/remainder-on-dividing-by-11--170647/1",
+    "solutionLink": "#",
+    "problemName": "Remainder on dividing by 11"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/if-loop-python/1",
+    "solutionLink": "#",
+    "problemName": "If conditional statement- Python"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/nearest-multiple-of-102437/1",
+    "solutionLink": "#",
+    "problemName": "Nearest multiple of 10"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/adding-array-element4756/1",
+    "solutionLink": "#",
+    "problemName": "Adding Array Elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/ease-the-array0633/1",
+    "solutionLink": "#",
+    "problemName": "Ease the Array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/xoring-and-clearing/1",
+    "solutionLink": "#",
+    "problemName": "Xoring and Clearing"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/missing-element-of-ap2228/1",
+    "solutionLink": "#",
+    "problemName": "Missing element of AP"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/queue-operations/1",
+    "solutionLink": "#",
+    "problemName": "Queue Operations"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/remaining-string3515/1",
+    "solutionLink": "#",
+    "problemName": "Remaining String"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-diagonally4331/1",
+    "solutionLink": "#",
+    "problemName": "Print Diagonally"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/two-mirror-trees/1",
+    "solutionLink": "#",
+    "problemName": "Two Mirror Trees"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/closest-strings0611/1",
+    "solutionLink": "#",
+    "problemName": "Closest Strings"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/step-by-step-condition/1",
+    "solutionLink": "#",
+    "problemName": "Step by Step Condition"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/positive-negative-pair5209/1",
+    "solutionLink": "#",
+    "problemName": "Positive Negative Pair"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/learning-to-be-precise/1",
+    "solutionLink": "#",
+    "problemName": "Learning to be precise"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-leaf-nodes/1",
+    "solutionLink": "#",
+    "problemName": "Sum of Leaf Nodes"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-odd-even-java/1",
+    "solutionLink": "#",
+    "problemName": "Count Odd Even - Java"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/move-last-element-to-front-of-a-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Move Last Element to Front of a Linked List"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/while-loop-printtable-java/1",
+    "solutionLink": "#",
+    "problemName": "While loop- printTable - Java"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-duplicates-in-small-prime-array/1",
+    "solutionLink": "#",
+    "problemName": "Remove duplicates in small prime array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/max-level-sum-in-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Max Level Sum in Binary Tree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/vertical-width-of-a-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Vertical Width of a Binary Tree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-n-to-1-without-loop/1",
+    "solutionLink": "#",
+    "problemName": "Print N to 1 without loop"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/make-array-elements-equal--170647/1",
+    "solutionLink": "#",
+    "problemName": "Make Array Elements Equal"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/dominant-pairs/1",
+    "solutionLink": "#",
+    "problemName": "Dominant Pairs"
+  }
+]
+
+<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