From 2dd585d52aba3b2227a2e3f0965f4bf07d9547b9 Mon Sep 17 00:00:00 2001
From: Agastya Kumar Yadav <124435030+agastya3636@users.noreply.github.com>
Date: Fri, 14 Jun 2024 11:51:53 +0530
Subject: [PATCH] Create 0601-0700.md

Added 100 easy questions of gfg
---
 dsa-problems/gfg-problems/easy/0601-0700.md | 623 ++++++++++++++++++++
 1 file changed, 623 insertions(+)
 create mode 100644 dsa-problems/gfg-problems/easy/0601-0700.md

diff --git a/dsa-problems/gfg-problems/easy/0601-0700.md b/dsa-problems/gfg-problems/easy/0601-0700.md
new file mode 100644
index 000000000..38f8aee61
--- /dev/null
+++ b/dsa-problems/gfg-problems/easy/0601-0700.md
@@ -0,0 +1,623 @@
+---
+id: 0601-0700
+title: GFG easy problems 0601-0700
+sidebar_label: 0601-0700
+keywords:
+  - gfg problems
+  - gfg problems easy
+  - gfg problems problems
+---
+
+
+export const problems = [
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-possible-sum-of-products3637/1",
+    "solutionLink": "#",
+    "problemName": "Maximum Possible Sum of Products"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/exchange-the-leaf-nodes/1",
+    "solutionLink": "#",
+    "problemName": "Exchange the Leaf Nodes"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-exception-handling3103/1",
+    "solutionLink": "#",
+    "problemName": "C++ Exception Handling"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-the-pattern1025/1",
+    "solutionLink": "#",
+    "problemName": "Print the pattern"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/twisted-prime-number0500/1",
+    "solutionLink": "#",
+    "problemName": "Twisted Prime Number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/unique-binary-tree-requirements/1",
+    "solutionLink": "#",
+    "problemName": "Unique Binary Tree Requirements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/student-of-the-year/1",
+    "solutionLink": "#",
+    "problemName": "Student of the Year"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/multiply-by-111820/1",
+    "solutionLink": "#",
+    "problemName": "Multiply by 11"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-a-integer-is-power-of-8-or-not2537/1",
+    "solutionLink": "#",
+    "problemName": "Check if a Integer is power of 8 or not"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/crack-the-series0304/1",
+    "solutionLink": "#",
+    "problemName": "Crack the series"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/prime-number-of-set-bits4632/1",
+    "solutionLink": "#",
+    "problemName": "Prime number of set bits"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/hungry-pizza-lovers3148/1",
+    "solutionLink": "#",
+    "problemName": "Hungry Pizza Lovers"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rearrange-an-array-such-that-arri-i3618/1",
+    "solutionLink": "#",
+    "problemName": "Rearrange an array such that arr[i] = i"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-matrix-rotation-by-180-degree0745/1",
+    "solutionLink": "#",
+    "problemName": "C++ Matrix Rotation by 180 degree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-template/1",
+    "solutionLink": "#",
+    "problemName": "C++ Template"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-swaps-required-to-group-all-1s-together2451/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Swaps required to group all 1s together"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/xor-of-a-given-range/1",
+    "solutionLink": "#",
+    "problemName": "XOR of a given range"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/good-pairs4519/1",
+    "solutionLink": "#",
+    "problemName": "Good Pairs"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/numbers-with-same-first-and-last-digit4228/1",
+    "solutionLink": "#",
+    "problemName": "Numbers with same first and last digit"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/java-collection-set-1-arraylist/1",
+    "solutionLink": "#",
+    "problemName": "Java Collection | Set 1 (ArrayList) Part-2"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/left-out-candies5652/1",
+    "solutionLink": "#",
+    "problemName": "Left out candies"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/pair-sum-existence/1",
+    "solutionLink": "#",
+    "problemName": "Pair Sum Existence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/min-manipulations-to-make-strings-anagram1421/1",
+    "solutionLink": "#",
+    "problemName": "Min Manipulations to make Strings Anagram"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/generate-grey-code-sequences/1",
+    "solutionLink": "#",
+    "problemName": "Generate Grey Code Sequences"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/increasing-sub-sequence1712/1",
+    "solutionLink": "#",
+    "problemName": "Increasing Sub Sequence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/dictionary-in-python-ii/1",
+    "solutionLink": "#",
+    "problemName": "Dictionary in Python - II"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/carry-counter0937/1",
+    "solutionLink": "#",
+    "problemName": "Carry counter"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rearrange-linked-list-in-place/1",
+    "solutionLink": "#",
+    "problemName": "Rearrange linked list in-place"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-function-overloading-1587115620/1",
+    "solutionLink": "#",
+    "problemName": "C++ Function overloading"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/geek-and-his-tricky-series2207/1",
+    "solutionLink": "#",
+    "problemName": "Geek and his Tricky Series"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/huffman-decoding-1/1",
+    "solutionLink": "#",
+    "problemName": "Huffman Decoding-1"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/inverted-triangle-of-stars0110/1",
+    "solutionLink": "#",
+    "problemName": "Inverted triangle of stars"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/gadgets-of-doraland--141631/1",
+    "solutionLink": "#",
+    "problemName": "Gadgets of Doraland"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/mean-of-range-in-array2123/1",
+    "solutionLink": "#",
+    "problemName": "Mean of range in array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/multiset-operations/1",
+    "solutionLink": "#",
+    "problemName": "Multiset Operations"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/postorder-traversal-from-given-inorder-and-preorder-traversals/1",
+    "solutionLink": "#",
+    "problemName": "Postorder traversal from given Inorder and Preorder traversals"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/bitonic-generator-sort3343/1",
+    "solutionLink": "#",
+    "problemName": "Bitonic Generator Sort"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/depth-of-node/1",
+    "solutionLink": "#",
+    "problemName": "Depth of node"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/outermost-parentheses/1",
+    "solutionLink": "#",
+    "problemName": "Outermost Parentheses"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/boundary-elements-of-matrix1102/1",
+    "solutionLink": "#",
+    "problemName": "Boundary Elements of Matrix"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-corresponding-position-in-the-two-strings-that-hold-exactly-the-same-characters5013/1",
+    "solutionLink": "#",
+    "problemName": "Same characters in two strings"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rope-cutting3334/1",
+    "solutionLink": "#",
+    "problemName": "Rope Cutting"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/geek-and-his-binary-strings1951/1",
+    "solutionLink": "#",
+    "problemName": "Geek and his Binary Strings"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/faithful-numbers0014/1",
+    "solutionLink": "#",
+    "problemName": "Faithful Numbers"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/dictionary-in-python-iii/1",
+    "solutionLink": "#",
+    "problemName": "Dictionary in Python - III"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/amicable-pair0804/1",
+    "solutionLink": "#",
+    "problemName": "Amicable Pair"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-odd-factors0844/1",
+    "solutionLink": "#",
+    "problemName": "Count Odd Factors"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-a-given-string-is-a-rotation-of-a-palindrome0317/1",
+    "solutionLink": "#",
+    "problemName": "Check if a given string is a rotation of a palindrome"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/rotate-matrix-elements-clockwise2336/1",
+    "solutionLink": "#",
+    "problemName": "Rotate matrix elements clockwise"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/kth-distance3757/1",
+    "solutionLink": "#",
+    "problemName": "Kth distance"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/multimap-operations/1",
+    "solutionLink": "#",
+    "problemName": "Multimap Operations"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/consecutive-array-elements2711/1",
+    "solutionLink": "#",
+    "problemName": "Consecutive Array Elements"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/next-greater-even-number0828/1",
+    "solutionLink": "#",
+    "problemName": "Next Greater Even Number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/missing-ranges-of-numbers1019/1",
+    "solutionLink": "#",
+    "problemName": "Missing ranges of numbers"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/assign-mice-holes3053/1",
+    "solutionLink": "#",
+    "problemName": "Assign Mice Holes"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-sum-of-divisors5636/1",
+    "solutionLink": "#",
+    "problemName": "Find sum of divisors "
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/ordering-of-strings5527/1",
+    "solutionLink": "#",
+    "problemName": "Ordering of strings"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/lucky-number0707/1",
+    "solutionLink": "#",
+    "problemName": "Lucky Number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/cross-character2630/1",
+    "solutionLink": "#",
+    "problemName": "Cross character"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/string-modification-1587115621/1",
+    "solutionLink": "#",
+    "problemName": "String Modification"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/check-if-actual-binary-representation-of-a-number-is-palindrome0624/1",
+    "solutionLink": "#",
+    "problemName": "Check if actual binary representation of a number is palindrome"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-zigzag-sequence5416/1",
+    "solutionLink": "#",
+    "problemName": "Largest zigzag sequence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimal-moves-to-form-a-string4331/1",
+    "solutionLink": "#",
+    "problemName": "Minimal moves to form a string"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/happy-number1408/1",
+    "solutionLink": "#",
+    "problemName": "Happy Number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/subtraction-and-two-numbers0816/1",
+    "solutionLink": "#",
+    "problemName": "Subtraction and two numbers"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/structs-and-objects/1",
+    "solutionLink": "#",
+    "problemName": "Structs and Objects"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/even-subsets/1",
+    "solutionLink": "#",
+    "problemName": "Even Subsets"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/magic-number4431/1",
+    "solutionLink": "#",
+    "problemName": "Magic Number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-stl-priority-queue/1",
+    "solutionLink": "#",
+    "problemName": "C++ STL Priority Queue"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-most-frequent-digit4432/1",
+    "solutionLink": "#",
+    "problemName": "Find the most frequent digit"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-maximum-value/1",
+    "solutionLink": "#",
+    "problemName": "Find Maximum value"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/swap-bits5726/1",
+    "solutionLink": "#",
+    "problemName": "Swap bits"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/product-of-prime-factors5121/1",
+    "solutionLink": "#",
+    "problemName": "Product of Prime Factors"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/kth-prime-factor-of-a-number0132/1",
+    "solutionLink": "#",
+    "problemName": "Kth Prime Factor"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/xor-linked-list/1",
+    "solutionLink": "#",
+    "problemName": "XOR Linked List"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/triangle-and-square--170637/1",
+    "solutionLink": "#",
+    "problemName": "Triangle and Square"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-number-of-characters-between-any-two-same-character4552/1",
+    "solutionLink": "#",
+    "problemName": "Maximum number of characters between any two same character"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/print-this-pattern0709/1",
+    "solutionLink": "#",
+    "problemName": "Print this pattern!"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/distinct-substrings2516/1",
+    "solutionLink": "#",
+    "problemName": "Distinct Substrings"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-multi-level-inheritance/1",
+    "solutionLink": "#",
+    "problemName": "C++ Multi-level inheritance"
+  },
+  {
+    "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"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/does-robot-moves-circular0414/1",
+    "solutionLink": "#",
+    "problemName": "Does robot moves circular"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-number-of-deletions-to-make-a-sorted-sequence3248/1",
+    "solutionLink": "#",
+    "problemName": "Minimum number of deletions to make a sorted sequence"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/maximum-sum-of-increasing-order-elements-from-n-arrays4848/1",
+    "solutionLink": "#",
+    "problemName": "Maximum sum of increasing order elements from n arrays"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/number-that-are-not-divisible4541/1",
+    "solutionLink": "#",
+    "problemName": "Number that are not divisible"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/deficient-number1612/1",
+    "solutionLink": "#",
+    "problemName": "Deficient Number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/minimum-distinct-ids3251/1",
+    "solutionLink": "#",
+    "problemName": "Minimum Distinct Ids"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/k-ary-tree1235/1",
+    "solutionLink": "#",
+    "problemName": "K-Ary Tree"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-the-highest-occurring-digit-in-prime-numbers-in-a-range3634/1",
+    "solutionLink": "#",
+    "problemName": "Find the highest occurring digit in prime numbers in a range"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/c-stl-set-2-pair/1",
+    "solutionLink": "#",
+    "problemName": "C++ STL | Set 2 (pair)"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/largest-even-number3821/1",
+    "solutionLink": "#",
+    "problemName": "Largest Even Number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/pair-with-greatest-product-in-array3342/1",
+    "solutionLink": "#",
+    "problemName": "Pair with greatest product in array"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/chocolate-station2951/1",
+    "solutionLink": "#",
+    "problemName": "Chocolate Station"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/regular-expressions-2-python/1",
+    "solutionLink": "#",
+    "problemName": "Regular Expressions 2 - Python"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-all-possible-paths-from-top-to-bottom/1",
+    "solutionLink": "#",
+    "problemName": "Find all possible paths from top to bottom"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/find-maximum-number2152/1",
+    "solutionLink": "#",
+    "problemName": "Find maximum number"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/binary-tree-representation/1",
+    "solutionLink": "#",
+    "problemName": "Binary Tree Representation"
+  },
+  {
+    "difficulty": "Easy",
+    "leetCodeLink": "https://www.geeksforgeeks.org/problems/count-digits-in-a-factorial3957/1",
+    "solutionLink": "#",
+    "problemName": "Count digits in a factorial"
+  }
+]
+
+
+<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