From 87d238e6c6dca76d3b172b239eb17205cdaf5668 Mon Sep 17 00:00:00 2001
From: Agastya Kumar Yadav <124435030+agastya3636@users.noreply.github.com>
Date: Tue, 4 Jun 2024 00:43:03 +0530
Subject: [PATCH] Create 0101-0200.md

Added 100 medium question of gfg
---
 dsa-problems/gfg-problems/medium/0101-0200.md | 622 ++++++++++++++++++
 1 file changed, 622 insertions(+)
 create mode 100644 dsa-problems/gfg-problems/medium/0101-0200.md

diff --git a/dsa-problems/gfg-problems/medium/0101-0200.md b/dsa-problems/gfg-problems/medium/0101-0200.md
new file mode 100644
index 000000000..832c3ff42
--- /dev/null
+++ b/dsa-problems/gfg-problems/medium/0101-0200.md
@@ -0,0 +1,622 @@
+---
+id: 0101-0200
+title: GFG medium problems 0101-0200
+sidebar_label: 0101-0200
+keywords:
+  - gfg problems
+  - gfg problems medium
+  - gfg problems problems
+---
+
+
+export const problems = [
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/egg-dropping-puzzle-1587115620/1",
+        "solutionLink": "#",
+        "problemName": "Egg Dropping Puzzle"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-subtree/1",
+        "solutionLink": "#",
+        "problemName": "Check if subtree"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-palindromic-subsequences/1",
+        "solutionLink": "#",
+        "problemName": "Count Palindromic Subsequences"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/children-sum-parent/1",
+        "solutionLink": "#",
+        "problemName": "Check for Children Sum Property in a Binary Tree"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/total-decoding-messages1235/1",
+        "solutionLink": "#",
+        "problemName": "Total Decoding Messages"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/knapsack-with-duplicate-items4201/1",
+        "solutionLink": "#",
+        "problemName": "Knapsack with Duplicate Items"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/next-permutation5226/1",
+        "solutionLink": "#",
+        "problemName": "Next Permutation"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-swaps-required-to-bring-all-elements-less-than-or-equal-to-k-together4847/1",
+        "solutionLink": "#",
+        "problemName": "Minimum swaps and K together"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/array-pair-sum-divisibility-problem3257/1",
+        "solutionLink": "#",
+        "problemName": "Array Pair Sum Divisibility Problem"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-repeating-subsequence2004/1",
+        "solutionLink": "#",
+        "problemName": "Longest Repeating Subsequence"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/activity-selection-1587115620/1",
+        "solutionLink": "#",
+        "problemName": "Activity Selection"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/nth-catalan-number0817/1",
+        "solutionLink": "#",
+        "problemName": "Nth catalan number"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/zero-sum-subarrays1825/1",
+        "solutionLink": "#",
+        "problemName": "Zero Sum Subarrays"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/word-break1352/1",
+        "solutionLink": "#",
+        "problemName": "Word Break"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/implementing-floyd-warshall2042/1",
+        "solutionLink": "#",
+        "problemName": "Floyd Warshall"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/valid-substring0624/1",
+        "solutionLink": "#",
+        "problemName": "Valid Substring"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/friends-pairing-problem5425/1",
+        "solutionLink": "#",
+        "problemName": "Friends Pairing Problem"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1",
+        "solutionLink": "#",
+        "problemName": "Min distance between two given nodes of a Binary Tree"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/gold-mine-problem2608/1",
+        "solutionLink": "#",
+        "problemName": "Gold Mine Problem"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/two-repeated-elements-1587115621/1",
+        "solutionLink": "#",
+        "problemName": "Two Repeated Elements"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-common-supersequence0322/1",
+        "solutionLink": "#",
+        "problemName": "Shortest Common Supersequence"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-bst/1",
+        "solutionLink": "#",
+        "problemName": "Largest BST"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/max-length-chain/1",
+        "solutionLink": "#",
+        "problemName": "Max length chain"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/sorted-insert-for-circular-linked-list/1",
+        "solutionLink": "#",
+        "problemName": "Sorted insert for circular linked list"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-spanning-tree/1",
+        "solutionLink": "#",
+        "problemName": "Minimum Spanning Tree"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/delete-a-node-from-bst/1",
+        "solutionLink": "#",
+        "problemName": "Delete a node from BST"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/m-coloring-problem-1587115620/1",
+        "solutionLink": "#",
+        "problemName": "M-Coloring Problem"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/boolean-matrix-problem-1587115620/1",
+        "solutionLink": "#",
+        "problemName": "Boolean Matrix"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-frequencies4211/1",
+        "solutionLink": "#",
+        "problemName": "Check if frequencies can be equal"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/lucky-numbers2911/1",
+        "solutionLink": "#",
+        "problemName": "Lucky Numbers"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/rod-cutting0840/1",
+        "solutionLink": "#",
+        "problemName": "Rod Cutting"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-k-th-smallest-element-in-bst/1",
+        "solutionLink": "#",
+        "problemName": "k-th smallest element in BST"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/heap-sort/1",
+        "solutionLink": "#",
+        "problemName": "Heap Sort"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/rearrange-an-array-with-o1-extra-space3142/1",
+        "solutionLink": "#",
+        "problemName": "Rearrange an array with O(1) extra space"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-paths0926/1",
+        "solutionLink": "#",
+        "problemName": "Number of paths"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/length-of-the-longest-substring3036/1",
+        "solutionLink": "#",
+        "problemName": "Length of the longest substring"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/flood-fill-algorithm1856/1",
+        "solutionLink": "#",
+        "problemName": "Flood fill Algorithm"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/stock-buy-and-sell2615/1",
+        "solutionLink": "#",
+        "problemName": "Stock buy and sell II"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-source-to-destination-path3544/1",
+        "solutionLink": "#",
+        "problemName": "Shortest Source to Destination Path"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/sort-a-stack/1",
+        "solutionLink": "#",
+        "problemName": "Sort a stack"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/predecessor-and-successor/1",
+        "solutionLink": "#",
+        "problemName": "Predecessor and Successor"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/consecutive-1s-not-allowed1912/1",
+        "solutionLink": "#",
+        "problemName": "Consecutive 1's not allowed"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/steps-by-knight5927/1",
+        "solutionLink": "#",
+        "problemName": "Steps by Knight"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/pascal-triangle0652/1",
+        "solutionLink": "#",
+        "problemName": "Pascal Triangle"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/max-sum-without-adjacents2430/1",
+        "solutionLink": "#",
+        "problemName": "Max Sum without Adjacents"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/combination-sum-1587115620/1",
+        "solutionLink": "#",
+        "problemName": "Combination Sum"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-tree-is-isomorphic/1",
+        "solutionLink": "#",
+        "problemName": "Check if Tree is Isomorphic"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/kth-ancestor-in-a-tree/1",
+        "solutionLink": "#",
+        "problemName": "Kth Ancestor in a Tree"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/subset-sums2234/1",
+        "solutionLink": "#",
+        "problemName": "Subset Sums"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/painting-the-fence3727/1",
+        "solutionLink": "#",
+        "problemName": "Painting the Fence"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-prime-factor2601/1",
+        "solutionLink": "#",
+        "problemName": "Largest prime factor"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/path-in-matrix3805/1",
+        "solutionLink": "#",
+        "problemName": "Maximum path sum in matrix"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/relative-sorting4323/1",
+        "solutionLink": "#",
+        "problemName": "Sort an array according to the other"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-numbers-or-number1219/1",
+        "solutionLink": "#",
+        "problemName": "Sum of two large numbers"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-the-longest-bloodline-of-a-tree/1",
+        "solutionLink": "#",
+        "problemName": "Sum of nodes on the longest path from root to leaf node"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/replace-os-with-xs0052/1",
+        "solutionLink": "#",
+        "problemName": "Replace O's with X's"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-possible-triangles-1587115620/1",
+        "solutionLink": "#",
+        "problemName": "Count the number of possible triangles"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-the-subarrays-having-product-less-than-k1708/1",
+        "solutionLink": "#",
+        "problemName": "Count the subarrays having product less than k"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/shortest-path-in-undirected-graph/1",
+        "solutionLink": "#",
+        "problemName": "Shortest path in Directed Acyclic Graph"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/k-sum-paths/1",
+        "solutionLink": "#",
+        "problemName": "K Sum Paths"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/distance-from-the-source-bellman-ford-algorithm/1",
+        "solutionLink": "#",
+        "problemName": "Distance from the Source (Bellman-Ford Algorithm)"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/is-binary-tree-heap/1",
+        "solutionLink": "#",
+        "problemName": "Is Binary Tree Heap"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/duplicate-subtree-in-binary-tree/1",
+        "solutionLink": "#",
+        "problemName": "Duplicate subtree in Binary Tree"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/connect-nodes-at-same-level/1",
+        "solutionLink": "#",
+        "problemName": "Connect Nodes at Same Level"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/power-set4302/1",
+        "solutionLink": "#",
+        "problemName": "Power Set"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/swapping-pairs-make-sum-equal4142/1",
+        "solutionLink": "#",
+        "problemName": "Swapping pairs make sum equal"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-provinces/1",
+        "solutionLink": "#",
+        "problemName": "Number of Provinces"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/interleaved-strings/1",
+        "solutionLink": "#",
+        "problemName": "Interleaved Strings"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-sum4058/1",
+        "solutionLink": "#",
+        "problemName": "Minimum sum"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/smallest-distant-window3132/1",
+        "solutionLink": "#",
+        "problemName": "Smallest distinct window"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-number-of-substrings4528/1",
+        "solutionLink": "#",
+        "problemName": "Count number of substrings"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-number-in-k-swaps-1587115620/1",
+        "solutionLink": "#",
+        "problemName": "Largest number in K swaps"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/search-in-a-matrix-1587115621/1",
+        "solutionLink": "#",
+        "problemName": "Search in a row-column sorted Matrix"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-multiplications-to-reach-end/1",
+        "solutionLink": "#",
+        "problemName": "Minimum Multiplications to reach End"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-subarray-with-sum-divisible-by-k1259/1",
+        "solutionLink": "#",
+        "problemName": "Longest subarray with sum divisible by K"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/partitions-with-given-difference/1",
+        "solutionLink": "#",
+        "problemName": "Partitions with Given Difference"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/top-k-frequent-elements-in-array/1",
+        "solutionLink": "#",
+        "problemName": "Top K Frequent Elements in Array - I"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-triplets-with-sum-smaller-than-x5549/1",
+        "solutionLink": "#",
+        "problemName": "Count triplets with sum smaller than X"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-k-sorted-arrays/1",
+        "solutionLink": "#",
+        "problemName": "Merge k Sorted Arrays"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-palindromic-subsequence-1612327878/1",
+        "solutionLink": "#",
+        "problemName": "Longest Palindromic Subsequence"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/segregate-even-and-odd-nodes-in-a-linked-list5035/1",
+        "solutionLink": "#",
+        "problemName": "Segregate even and odd nodes in a Linked List"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-sub-array5443/1",
+        "solutionLink": "#",
+        "problemName": "Maximum Sub Array"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/element-appearing-once2552/1",
+        "solutionLink": "#",
+        "problemName": "Find the element that appears once"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-square-formed-in-a-matrix0806/1",
+        "solutionLink": "#",
+        "problemName": "Largest square formed in a matrix"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-whether-path-exist5238/1",
+        "solutionLink": "#",
+        "problemName": "Find whether path exist"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/optimal-strategy-for-a-game-1587115620/1",
+        "solutionLink": "#",
+        "problemName": "Optimal Strategy For A Game"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/word-boggle4143/1",
+        "solutionLink": "#",
+        "problemName": "Word Boggle"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1",
+        "solutionLink": "#",
+        "problemName": "Strongly Connected Components (Kosaraju's Algo)"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/distance-of-nearest-cell-having-1-1587115620/1",
+        "solutionLink": "#",
+        "problemName": "Distance of nearest cell having 1"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/root-to-leaf-paths/1",
+        "solutionLink": "#",
+        "problemName": "Root to Leaf Paths"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/operations-on-binary-min-heap/1",
+        "solutionLink": "#",
+        "problemName": "Binary Heap Operations"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/diagonal-traversal-of-binary-tree/1",
+        "solutionLink": "#",
+        "problemName": "Diagonal Traversal of Binary Tree"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/serialize-and-deserialize-a-binary-tree/1",
+        "solutionLink": "#",
+        "problemName": "Serialize and deserialize a binary tree"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1",
+        "solutionLink": "#",
+        "problemName": "Merge K sorted linked lists"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-closest-element-in-bst/1",
+        "solutionLink": "#",
+        "problemName": "Find the Closest Element in BST"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/column-name-from-a-given-column-number4244/1",
+        "solutionLink": "#",
+        "problemName": "Column name from a given column number"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/kth-largest-element-in-a-stream2220/1",
+        "solutionLink": "#",
+        "problemName": "Kth largest element in a stream"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/unique-bsts-1587115621/1",
+        "solutionLink": "#",
+        "problemName": "Unique BST's"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/mother-vertex/1",
+        "solutionLink": "#",
+        "problemName": "Mother Vertex"
+    },
+    {
+        "difficulty": "Medium",
+        "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-string-in-grid0111/1",
+        "solutionLink": "#",
+        "problemName": "Find the string in grid"
+    }
+]
+
+<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