diff --git a/dsa-problems/gfg-problems/hard/0001-0100.md b/dsa-problems/gfg-problems/hard/0001-0100.md
new file mode 100644
index 000000000..71110e4db
--- /dev/null
+++ b/dsa-problems/gfg-problems/hard/0001-0100.md
@@ -0,0 +1,622 @@
+---
+id: 0001-0100
+title: GFG hard problems 0001-0100
+sidebar_label: 0001-0100
+keywords:
+  - gfg problems
+  - gfg problems hard
+  - gfg problems problems
+---
+
+
+export const problems = [
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-two-sorted-arrays-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Merge Without Extra Space"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1",
+    "solutionLink": "#",
+    "problemName": "Reverse a Linked List in groups of given size"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/edit-distance3702/1",
+    "solutionLink": "#",
+    "problemName": "Edit Distance"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-path-sum/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Path Sum between 2 Special Nodes"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-rectangular-area-in-a-histogram-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Rectangular Area in a Histogram"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-sum-partition3317/1",
+    "solutionLink": "#",
+    "problemName": "Minimum sum partition"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/lru-cache/1",
+    "solutionLink": "#",
+    "problemName": "LRU Cache"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/palindromic-patitioning4845/1",
+    "solutionLink": "#",
+    "problemName": "Palindromic Partitioning"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Smallest window in a string containing all the characters of another string"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/binary-tree-to-dll/1",
+    "solutionLink": "#",
+    "problemName": "Binary Tree  to DLL"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-median-in-a-stream-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Find median in a stream"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/boolean-parenthesization5610/1",
+    "solutionLink": "#",
+    "problemName": "Boolean Parenthesization"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/median-of-2-sorted-arrays-of-different-sizes/1",
+    "solutionLink": "#",
+    "problemName": "Median of 2 Sorted Arrays of Different Sizes"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/matrix-chain-multiplication0303/1",
+    "solutionLink": "#",
+    "problemName": "Matrix Chain Multiplication"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-prefix-suffix2527/1",
+    "solutionLink": "#",
+    "problemName": "Longest Prefix Suffix"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-painters-partition-problem1535/1",
+    "solutionLink": "#",
+    "problemName": "The Painter's Partition Problem-II"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/max-rectangle/1",
+    "solutionLink": "#",
+    "problemName": "Max  rectangle"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/max-circular-subarray-sum-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "Max Circular Subarray Sum"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/alien-dictionary/1",
+    "solutionLink": "#",
+    "problemName": "Alien Dictionary"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/median-in-a-row-wise-sorted-matrix1527/1",
+    "solutionLink": "#",
+    "problemName": "Median in a row-wise sorted Matrix"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/solve-the-sudoku-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Solve the Sudoku"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-valid-parentheses5657/1",
+    "solutionLink": "#",
+    "problemName": "Longest valid Parentheses"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/form-a-palindrome1455/1",
+    "solutionLink": "#",
+    "problemName": "Form a palindrome"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-cost-path3833/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Cost Path"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/nodes-at-given-distance-in-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Nodes at given distance in binary tree"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/subtraction-in-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Subtraction in Linked List"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/n-queen-problem0315/1",
+    "solutionLink": "#",
+    "problemName": "N-Queen Problem"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1",
+    "solutionLink": "#",
+    "problemName": "Clone a linked list with next and random pointer"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/distinct-occurrences/1",
+    "solutionLink": "#",
+    "problemName": "Distinct occurrences"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-distinct-subsequences0909/1",
+    "solutionLink": "#",
+    "problemName": "Number of distinct subsequences"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/next-smallest-palindrome4740/1",
+    "solutionLink": "#",
+    "problemName": "Next Smallest Palindrome"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/permutations-of-a-given-string-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "String Permutations"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/wildcard-string-matching1126/1",
+    "solutionLink": "#",
+    "problemName": "Wildcard string matching"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/reorder-list/1",
+    "solutionLink": "#",
+    "problemName": "Reorder List"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-two-bst-s/1",
+    "solutionLink": "#",
+    "problemName": "Merge two BST 's"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/aggressive-cows/1",
+    "solutionLink": "#",
+    "problemName": "Aggressive Cows"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/circle-of-strings4530/1",
+    "solutionLink": "#",
+    "problemName": "Circle of strings"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/burning-tree/1",
+    "solutionLink": "#",
+    "problemName": "Burning Tree"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/wildcard-pattern-matching/1",
+    "solutionLink": "#",
+    "problemName": "Wildcard Pattern Matching"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/nth-natural-number/1",
+    "solutionLink": "#",
+    "problemName": "Nth Natural Number"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-pairs-in-an-array4145/1",
+    "solutionLink": "#",
+    "problemName": "Count Pairs in an Array"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/articulation-point-1/1",
+    "solutionLink": "#",
+    "problemName": "Articulation Point - I"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-smaller-elements2214/1",
+    "solutionLink": "#",
+    "problemName": "Count Smaller elements"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimize-max-distance-to-gas-station/1",
+    "solutionLink": "#",
+    "problemName": "Minimize Max Distance to Gas Station"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/generalised-fibonacci-numbers1820/1",
+    "solutionLink": "#",
+    "problemName": "Generalised Fibonacci numbers"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/split-array-largest-sum--141634/1",
+    "solutionLink": "#",
+    "problemName": "Split Array Largest Sum"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/better-string/1",
+    "solutionLink": "#",
+    "problemName": "Better String"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/fixed-two-nodes-of-a-bst/1",
+    "solutionLink": "#",
+    "problemName": "Fixing Two nodes of a BST"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/convert-to-strictly-increasing-array3351/1",
+    "solutionLink": "#",
+    "problemName": "Strictly Increasing Array"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/longest-repeating-and-non-overlapping-substring3421/1",
+    "solutionLink": "#",
+    "problemName": "Longest repeating and non-overlapping substring"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-sum-of-different-corresponding-bits-for-all-pairs4652/1",
+    "solutionLink": "#",
+    "problemName": "Bit Difference"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/closest-palindrome4519/1",
+    "solutionLink": "#",
+    "problemName": "Closest Palindrome"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-points-to-reach-destination0540/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Points To Reach Destination"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/avl-tree-insertion/1",
+    "solutionLink": "#",
+    "problemName": "AVL Tree Insertion"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/word-wrap1646/1",
+    "solutionLink": "#",
+    "problemName": "Word Wrap"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-sort-on-doubly-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Merge Sort on Doubly Linked List"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/word-ladder/1",
+    "solutionLink": "#",
+    "problemName": "Word Ladder I"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/phone-directory4628/1",
+    "solutionLink": "#",
+    "problemName": "Phone directory"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/smallest-positive-integer-that-can-not-be-represented-as-sum--141631/1",
+    "solutionLink": "#",
+    "problemName": "Smallest Positive Integer that can not be represented as Sum"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-of-minimum-for-every-window-size3453/1",
+    "solutionLink": "#",
+    "problemName": "Maximum of minimum for every window size"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/partition-array-to-k-subsets/1",
+    "solutionLink": "#",
+    "problemName": "Partition array to K subsets"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/making-a-large-island/1",
+    "solutionLink": "#",
+    "problemName": "Making A Large Island"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-characters-to-be-added-at-front-to-make-string-palindrome/1",
+    "solutionLink": "#",
+    "problemName": "Minimum characters to be added at front to make string palindrome"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/avl-tree-deletion/1",
+    "solutionLink": "#",
+    "problemName": "AVL Tree Deletion"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/candy/1",
+    "solutionLink": "#",
+    "problemName": "Candy"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-rectangular-sub-matrix-whose-sum-is-0/1",
+    "solutionLink": "#",
+    "problemName": "Largest rectangular sub-matrix whose sum is 0"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/account-merge/1",
+    "solutionLink": "#",
+    "problemName": "Account Merge"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/next-happy-number4538/1",
+    "solutionLink": "#",
+    "problemName": "Next Happy Number"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-profit4657/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Profit"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/critical-connections/1",
+    "solutionLink": "#",
+    "problemName": "Find all Critical Connections in the Graph"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/brackets-in-matrix-chain-multiplication1024/1",
+    "solutionLink": "#",
+    "problemName": "Brackets in Matrix Chain Multiplication"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/return-two-prime-numbers2509/1",
+    "solutionLink": "#",
+    "problemName": "Return two prime numbers"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-string3151/1",
+    "solutionLink": "#",
+    "problemName": "Sum-string"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/word-break-part-23249/1",
+    "solutionLink": "#",
+    "problemName": "Word Break - Part 2"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-xor-subarray--141631/1",
+    "solutionLink": "#",
+    "problemName": "Maximum XOR subarray"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/box-stacking/1",
+    "solutionLink": "#",
+    "problemName": "Box Stacking"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-subset-xor/1",
+    "solutionLink": "#",
+    "problemName": "Maximum subset XOR"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-last-digit-of-ab-for-large-numbers1936/1",
+    "solutionLink": "#",
+    "problemName": "Find Last Digit Of a^b for Large Numbers"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/distribute-candies-in-a-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Distribute candies in a binary tree"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/geek-collects-the-balls5515/1",
+    "solutionLink": "#",
+    "problemName": "Geek collects the balls"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/special-digits--170647/1",
+    "solutionLink": "#",
+    "problemName": "Special Digits"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/word-ladder-ii/1",
+    "solutionLink": "#",
+    "problemName": "Word Ladder II"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-smallest-range-containing-elements-from-k-lists/1",
+    "solutionLink": "#",
+    "problemName": "Smallest range in K lists"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/possible-paths--141628/1",
+    "solutionLink": "#",
+    "problemName": "Possible Paths in a Tree"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/vertex-cover/1",
+    "solutionLink": "#",
+    "problemName": "Vertex Cover"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/geekina-hate-1s/1",
+    "solutionLink": "#",
+    "problemName": "Geekina Hate 1s"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-string/1",
+    "solutionLink": "#",
+    "problemName": "Find the String"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-sum-cycle--170645/1",
+    "solutionLink": "#",
+    "problemName": "Largest Sum Cycle"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-number-of-closed-islands/1",
+    "solutionLink": "#",
+    "problemName": "Find number of closed islands"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/redundant-parenthesis--170647/1",
+    "solutionLink": "#",
+    "problemName": "Redundant Parenthesis"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/walls-coloring-ii--170647/1",
+    "solutionLink": "#",
+    "problemName": "Walls Coloring II"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/strongly-connected-component-tarjanss-algo-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "Strongly connected component (Tarjans's Algo)"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/distinct-palindromic-substrings5141/1",
+    "solutionLink": "#",
+    "problemName": "Distinct palindromic substrings"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-binary-strings-with-no-consecutive-1s/1",
+    "solutionLink": "#",
+    "problemName": "Count Binary Strings With No Consecutive 1s"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/min-time--170648/1",
+    "solutionLink": "#",
+    "problemName": "Min Time"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-all-lcs-sequences3413/1",
+    "solutionLink": "#",
+    "problemName": "Print all LCS sequences"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sorted-list-to-bst/1",
+    "solutionLink": "#",
+    "problemName": "Sorted Link List to BST"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/cake-distribution-problem--170647/1",
+    "solutionLink": "#",
+    "problemName": "Cake Distribution Problem"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-number-of-toys/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Number of Toys"
+  },
+  {
+    "difficulty": "Hard",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/expression-add-operators/1",
+    "solutionLink": "#",
+    "problemName": "Expression Add Operators"
+  }
+]
+
+<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