diff --git a/dsa-problems/gfg-problems/easy/0501-0600.md b/dsa-problems/gfg-problems/easy/0501-0600.md
new file mode 100644
index 000000000..1a9119995
--- /dev/null
+++ b/dsa-problems/gfg-problems/easy/0501-0600.md
@@ -0,0 +1,623 @@
+---
+id: 0501-0600
+title: GFG easy problems 0501-0600
+sidebar_label: 0501-0600
+keywords:
+  - gfg problems
+  - gfg problems easy
+  - gfg problems problems
+---
+
+
+export const problems = [
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/bit-manipulation-1666686020/1",
+    "solutionLink": "#",
+    "problemName": "Bit Manipulation"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/transform-the-array4344/1",
+    "solutionLink": "#",
+    "problemName": "Transform the array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/aryas-long-string5840/1",
+    "solutionLink": "#",
+    "problemName": "Arya's Long String"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/even-and-odd-elements-at-even-and-odd-positions1342/1",
+    "solutionLink": "#",
+    "problemName": "Even and odd elements at even and odd positions"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/modified-numbers-and-queries0904/1",
+    "solutionLink": "#",
+    "problemName": "Modified Numbers and Queries"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/length-of-longest-subarray0440/1",
+    "solutionLink": "#",
+    "problemName": "Length of longest subarray"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/pair-sum-in-vector/1",
+    "solutionLink": "#",
+    "problemName": "Pair Sum in Vector"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/the-pattern-matcher/1",
+    "solutionLink": "#",
+    "problemName": "The Pattern Matcher"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/padovan-sequence2855/1",
+    "solutionLink": "#",
+    "problemName": "Padovan Sequence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/merge-list-alternatingly/1",
+    "solutionLink": "#",
+    "problemName": "Merge Lists Alternatingly"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/merging-two-unsorted-arrays-in-sorted-order1020/1",
+    "solutionLink": "#",
+    "problemName": "Merging two unsorted arrays in sorted order"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-odd-number-in-string/1",
+    "solutionLink": "#",
+    "problemName": "Largest odd number in string"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-average-subarray5859/1",
+    "solutionLink": "#",
+    "problemName": "Maximum average subarray"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/pattern-searching5231/1",
+    "solutionLink": "#",
+    "problemName": "Pattern searching"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/max-value1205/1",
+    "solutionLink": "#",
+    "problemName": "Max value"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/ball-coloring3450/1",
+    "solutionLink": "#",
+    "problemName": "Ball coloring"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/for-loop-2-python/1",
+    "solutionLink": "#",
+    "problemName": "For Loop 2- Python"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-steps-to-minimize-n-as-per-given-condition0618/1",
+    "solutionLink": "#",
+    "problemName": "Minimum steps to minimize n as per given condition"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rearrange-geek-and-his-classmates--141630/1",
+    "solutionLink": "#",
+    "problemName": "Rearrange Geek and his Classmates"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/distributing-question-papers2513/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Exchange"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/encrypt-the-string-21117/1",
+    "solutionLink": "#",
+    "problemName": "Encrypt the string - 2"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/construct-bst-from-post-order/1",
+    "solutionLink": "#",
+    "problemName": "Construct BST from Postorder"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/closing-bracket-index5900/1",
+    "solutionLink": "#",
+    "problemName": "Closing bracket index"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-duplicates-from-a-sorted-doubly-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Remove duplicates from a sorted doubly linked list"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/linked-list-matrix/1",
+    "solutionLink": "#",
+    "problemName": "Linked List Matrix"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/triangular-number2850/1",
+    "solutionLink": "#",
+    "problemName": "Triangular Number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-xor-of-numbers-from-l-to-r/1",
+    "solutionLink": "#",
+    "problemName": "Find XOR of numbers from L to R."
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/slicing-in-string-python/1",
+    "solutionLink": "#",
+    "problemName": "Slicing in String - Python"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/biginteger-multiply/1",
+    "solutionLink": "#",
+    "problemName": "BigInteger Multiply"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-shift-for-longest-common-prefix0759/1",
+    "solutionLink": "#",
+    "problemName": "Longest common prefix"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/string-comparison5858/1",
+    "solutionLink": "#",
+    "problemName": "String comparison"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/introduction-to-doubly-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "Introduction to Doubly Linked List"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/split-singly-linked-list-alternatingly/1",
+    "solutionLink": "#",
+    "problemName": "Split Singly Linked List Alternatingly"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/delete-array-elements-which-are-smaller-than-next-or-become-smaller3115/1",
+    "solutionLink": "#",
+    "problemName": "Delete array elements which are smaller than next or become smaller"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/k-palindrome/1",
+    "solutionLink": "#",
+    "problemName": "K-Palindrome"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/punish-the-students5726/1",
+    "solutionLink": "#",
+    "problemName": "Punish the Students"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/pass-by-reference-and-value/1",
+    "solutionLink": "#",
+    "problemName": "Pass by Reference and Value"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/excel-sheet-part-21138/1",
+    "solutionLink": "#",
+    "problemName": "Excel Sheet | Part - 2"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/string-functions-ii/1",
+    "solutionLink": "#",
+    "problemName": "String Functions - II  - Python"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-big-integers/1",
+    "solutionLink": "#",
+    "problemName": "Sum of Big Integers"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/change-bits1538/1",
+    "solutionLink": "#",
+    "problemName": "Change Bits"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/word-with-maximum-frequency0120/1",
+    "solutionLink": "#",
+    "problemName": "Word with maximum frequency"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/binary-search-trees/1",
+    "solutionLink": "#",
+    "problemName": "Binary Search Trees"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/ishaan-and-sticks0542/1",
+    "solutionLink": "#",
+    "problemName": "Ishaan and Sticks"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/distinct-absolute-array-elements4529/1",
+    "solutionLink": "#",
+    "problemName": "Distinct absolute array elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-changes-to-make-all-substrings-distinct4722/1",
+    "solutionLink": "#",
+    "problemName": "Minimum changes to make all substrings distinct"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-game0303/1",
+    "solutionLink": "#",
+    "problemName": "Number Game"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/square-pattern-1662666141/1",
+    "solutionLink": "#",
+    "problemName": "Pattern 22"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sum-of-lengths-of-non-overlapping-subarrays2237/1",
+    "solutionLink": "#",
+    "problemName": "Sum of Lengths of Non-Overlapping SubArrays"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/string-palindromic-ignoring-spaces4723/1",
+    "solutionLink": "#",
+    "problemName": "Palindrome Sentence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/binary-tree-k-level-sum3857/1",
+    "solutionLink": "#",
+    "problemName": "Binary Tree K level sum"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/drive-the-car2541/1",
+    "solutionLink": "#",
+    "problemName": "Drive the car"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/even-fibonacci-numbers-sum1455/1",
+    "solutionLink": "#",
+    "problemName": "Even Fibonacci Numbers Sum"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/tilt-of-binary-tree/1",
+    "solutionLink": "#",
+    "problemName": "Tilt of Binary Tree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-sum-bitonic-subsequence1857/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Sum Bitonic Subsequence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/height-of-spiral-tree/1",
+    "solutionLink": "#",
+    "problemName": "Height of Spiral Tree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/earthquake-and-the-paint-shop4518/1",
+    "solutionLink": "#",
+    "problemName": "Earthquake and the Paint Shop"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/swap-the-objects/1",
+    "solutionLink": "#",
+    "problemName": "Swap the objects"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/introduction-to-trees/1",
+    "solutionLink": "#",
+    "problemName": "Introduction to Trees"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/palindrome-numbers0942/1",
+    "solutionLink": "#",
+    "problemName": "Palindrome numbers"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/roll-the-characters-of-a-string2127/1",
+    "solutionLink": "#",
+    "problemName": "Roll the characters of a String"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-alphabets3649/1",
+    "solutionLink": "#",
+    "problemName": "Count Alphabets"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/operations-on-arraylist/1",
+    "solutionLink": "#",
+    "problemName": "Operations on ArrayList"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-area-rectangle/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Area Rectangle"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/sort-the-given-array-after-applying-the-given-equation0304/1",
+    "solutionLink": "#",
+    "problemName": "Sort the given array after applying the given equation"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/min-subsets-with-consecutive-numbers0601/1",
+    "solutionLink": "#",
+    "problemName": "Min Subsets with Consecutive Numbers"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/divisible-by-82732/1",
+    "solutionLink": "#",
+    "problemName": "Divisible by 8"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/duplicate-elements/1",
+    "solutionLink": "#",
+    "problemName": "Duplicate Elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-of-factors1435/1",
+    "solutionLink": "#",
+    "problemName": "Number of factors"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/day-of-the-week1637/1",
+    "solutionLink": "#",
+    "problemName": "Day of the week"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/toppers-of-class3826/1",
+    "solutionLink": "#",
+    "problemName": "Toppers Of Class"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/biginteger-mod/1",
+    "solutionLink": "#",
+    "problemName": "BigInteger mod"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/amend-the-sentence3235/1",
+    "solutionLink": "#",
+    "problemName": "Amend The Sentence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/generate-binary-string3642/1",
+    "solutionLink": "#",
+    "problemName": "Generate binary string"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/subarray-with-least-average5031/1",
+    "solutionLink": "#",
+    "problemName": "Subarray with least average"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-primes-in-range1604/1",
+    "solutionLink": "#",
+    "problemName": "Count Primes In Range"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-sum-of-subarray-less-than-or-equal-to-x4033/1",
+    "solutionLink": "#",
+    "problemName": "Maximum sum of subarray less than or equal to x"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/pangram-strings3155/1",
+    "solutionLink": "#",
+    "problemName": "Pangram Strings"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/prime-string3953/1",
+    "solutionLink": "#",
+    "problemName": "Prime String"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/repeat-the-strings/1",
+    "solutionLink": "#",
+    "problemName": "Repeat the Strings - Python"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/common-subsequence4049/1",
+    "solutionLink": "#",
+    "problemName": "Common Subsequence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/min-cost-climbing-stairs/1",
+    "solutionLink": "#",
+    "problemName": "Min Cost Climbing Stairs"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/karatsuba-algorithm0135/1",
+    "solutionLink": "#",
+    "problemName": "Karatsuba Algorithm"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/string-functions-i/1",
+    "solutionLink": "#",
+    "problemName": "String Functions I - Python"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/love-for-the-twins2623/1",
+    "solutionLink": "#",
+    "problemName": "Love For The Twins"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/fill-array-by-1s0920/1",
+    "solutionLink": "#",
+    "problemName": "Fill array with 1's"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/first-come-first-serve1328/1",
+    "solutionLink": "#",
+    "problemName": "First Come First Serve"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/part-sort2851/1",
+    "solutionLink": "#",
+    "problemName": "Part Sort"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/difficulty-of-sentence5856/1",
+    "solutionLink": "#",
+    "problemName": "Difficulty of sentence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/operations-on-priorityqueue/1",
+    "solutionLink": "#",
+    "problemName": "Operations on PriorityQueue"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/adjacents-are-not-allowed3528/1",
+    "solutionLink": "#",
+    "problemName": "Adjacents are not allowed"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/last-two-digit-fibonacci3353/1",
+    "solutionLink": "#",
+    "problemName": "Last two digit Fibonacci"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/magic-numbers3143/1",
+    "solutionLink": "#",
+    "problemName": "Magic numbers"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-energy1107/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Energy"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-distinct-elements-after-removing-k-elements5906/1",
+    "solutionLink": "#",
+    "problemName": "Maximum distinct elements after removing K elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/multiply-two-polynomals0721/1",
+    "solutionLink": "#",
+    "problemName": "Multiply two polynomials"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rearrange-array-such-that-even-positioned-are-greater-than-odd4804/1",
+    "solutionLink": "#",
+    "problemName": "Rearrange array such that even positioned are greater than odd"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/adding-one2529/1",
+    "solutionLink": "#",
+    "problemName": "Adding One"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/remove-minimum-elements4612/1",
+    "solutionLink": "#",
+    "problemName": "Remove minimum elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/partition-a-number-into-two-divisible-parts3605/1",
+    "solutionLink": "#",
+    "problemName": "Partition a number into two divisible parts"
+  }
+]
+
+
+<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 GeeksforGeeks website. You can also click on the solution link to view the solution of the problem.
\ No newline at end of file