diff --git a/dsa-problems/leetcode-problems/1500-1599.md b/dsa-problems/leetcode-problems/1500-1599.md
index e69de29bb..cc614bcea 100644
--- a/dsa-problems/leetcode-problems/1500-1599.md
+++ b/dsa-problems/leetcode-problems/1500-1599.md
@@ -0,0 +1,622 @@
+---
+id: 1500-1599
+title: LeetCode Problems 1500 - 1599
+sidebar_label: 1500 - 1599
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 1500 - 1599
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "1500. Design a File Sharing System",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/design-a-file-sharing-system",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1501. Countries You Can Safely Invest In",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/countries-you-can-safely-invest-in",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1502. Can Make Arithmetic Progression From Sequence",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1503. Last Moment Before All Ants Fall Out of a Plank",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1504. Count Submatrices With All Ones",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-submatrices-with-all-ones",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1506. Find Root of N-Ary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-root-of-n-ary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1507. Reformat Date",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/reformat-date",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1508. Range Sum of Sorted Subarray Sums",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/range-sum-of-sorted-subarray-sums",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1509. Minimum Difference Between Largest and Smallest Value in Three Moves",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1510. Stone Game IV",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/stone-game-iv",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1511. Customer Order Frequency",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/customer-order-frequency",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1512. Number of Good Pairs",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-good-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1513. Number of Substrings With Only 1s",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-substrings-with-only-1s",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1514. Path with Maximum Probability",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/path-with-maximum-probability",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1515. Best Position for a Service Centre",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/best-position-for-a-service-centre",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1516. Move Sub-Tree of N-Ary Tree",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/move-sub-tree-of-n-ary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1517. Find Users With Valid E-Mails",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-users-with-valid-e-mails",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1518. Water Bottles",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/water-bottles",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1519. Number of Nodes in the Sub-Tree With the Same Label",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1520. Maximum Number of Non-Overlapping Substrings",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-non-overlapping-substrings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1521. Find a Value of a Mysterious Function Closest to Target",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-a-value-of-a-mysterious-function-closest-to-target",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1522. Diameter of N-Ary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/diameter-of-n-ary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1523. Count Odd Numbers in an Interval Range",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-odd-numbers-in-an-interval-range",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1524. Number of Sub-arrays With Odd Sum",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1525. Number of Good Ways to Split a String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-good-ways-to-split-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1526. Minimum Number of Increments on Subarrays to Form a Target Array",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1527. Patients With a Condition",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/patients-with-a-condition",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1528. Shuffle String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/shuffle-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1529. Bulb Switcher IV",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/bulb-switcher-iv",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1530. Number of Good Leaf Nodes Pairs",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-good-leaf-nodes-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1531. String Compression II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/string-compression-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1532. The Most Recent Three Orders",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-most-recent-three-orders",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1533. Find the Index of the Large Integer",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-index-of-the-large-integer",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1534. Count Good Triplets",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-good-triplets",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1535. Find the Winner of an Array Game",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-winner-of-an-array-game",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1536. Minimum Swaps to Arrange a Binary Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-swaps-to-arrange-a-binary-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1537. Get the Maximum Score",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/get-the-maximum-score",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1538. Guess the Majority in a Hidden Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/guess-the-majority-in-a-hidden-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1539. Kth Missing Positive Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/kth-missing-positive-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1540. Can Convert String in K Moves",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/can-convert-string-in-k-moves",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1541. Minimum Insertions to Balance a Parentheses String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1542. Find Longest Awesome Substring",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-longest-awesome-substring",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1543. Fix Product Name Format",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/fix-product-name-format",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1544. Make The String Great",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/make-the-string-great",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1545. Find Kth Bit in Nth Binary String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-kth-bit-in-nth-binary-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1547. Minimum Cost to Cut a Stick",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-cut-a-stick",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1548. The Most Similar Path in a Graph",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/the-most-similar-path-in-a-graph",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1549. The Most Recent Orders for Each Product",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-most-recent-orders-for-each-product",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1550. Three Consecutive Odds",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/three-consecutive-odds",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1551. Minimum Operations to Make Array Equal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-make-array-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1552. Magnetic Force Between Two Balls",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/magnetic-force-between-two-balls",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1553. Minimum Number of Days to Eat N Oranges",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-days-to-eat-n-oranges",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1554. Strings Differ by One Character",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/strings-differ-by-one-character",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1555. Bank Account Summary II",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/bank-account-summary-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1556. Thousand Separator",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/thousand-separator",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1557. Minimum Number of Vertices to Reach All Nodes",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1558. Minimum Numbers of Function Calls to Make Target Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1559. Detect Cycles in 2D Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/detect-cycles-in-2d-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1560. Most Visited Sector in a Circular Track",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/most-visited-sector-in-a-circular-track",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1561. Maximum Number of Coins You Can Get",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-coins-you-can-get",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1562. Find Latest Group of Size M",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-latest-group-of-size-m",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1563. Stone Game V",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/stone-game-v",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1564. Put Boxes Into the Warehouse I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/put-boxes-into-the-warehouse-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1565. Unique Orders and Customers Per Month",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/unique-orders-and-customers-per-month",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1566. Detect Pattern of Length M Repeated K or More Times",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1567. Maximum Length of Subarray With Positive Product",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1568. Minimum Number of Days to Disconnect Island",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1569. Number of Ways to Reorder Array to Get Same BST",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1570. Dot Product of Two Sparse Vectors",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/dot-product-of-two-sparse-vectors",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1571. Warehouse Manager",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/warehouse-manager",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1572. Matrix Diagonal Sum",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/matrix-diagonal-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1573. Number of Ways to Split a String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-split-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1574. Shortest Subarray to be Removed to Make Array Sorted",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1575. Count All Possible Routes",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-all-possible-routes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1576. Replace All ?'s to Avoid Consecutive Repeating Characters",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1578. Minimum Deletion Cost to Avoid Repeating Letters",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-deletion-cost-to-avoid-repeating-letters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1579. Remove Max Number of Edges to Keep Graph Fully Traversable",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1580. Put Boxes Into the Warehouse II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/put-boxes-into-the-warehouse-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1581. Customer Who Visited but Did Not Make Any Transactions",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/customer-who-visited-but-did-not-make-any-transactions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1582. Special Positions in a Binary Matrix",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/special-positions-in-a-binary-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1583. Count Unhappy Friends",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-unhappy-friends",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1584. Min Cost to Connect All Points",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/min-cost-to-connect-all-points",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1585. Check If String Is Transformable With Substring Sort Operations",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-string-is-transformable-with-substring-sort-operations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1586. Binary Search Tree Iterator II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/binary-search-tree-iterator-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1587. Bank Account Summary III",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/bank-account-summary-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1588. Sum of All Odd Length Subarrays",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-all-odd-length-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1589. Maximum Sum Obtained of Any Permutation",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1590. Make Sum Divisible by P",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/make-sum-divisible-by-p",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1591. Strange Printer II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/strange-printer-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1592. Rearrange Spaces Between Words",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/rearrange-spaces-between-words",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1593. Split a String Into the Max Number of Unique Substrings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1594. Maximum Non Negative Product in a Matrix",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-non-negative-product-in-a-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1595. Minimum Cost to Connect Two Groups of Points",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-connect-two-groups-of-points",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1596. The Most Frequently Ordered Products for Each Customer",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1597. Build Binary Expression Tree From Infix Expression",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/build-binary-expression-tree-from-infix-expression",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1598. Crawler Log Folder",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/crawler-log-folder",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1599. Maximum Profit of Operating a Centennial Wheel",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-profit-of-operating-a-centennial-wheel",
+    "solutionLink": "#"
+  }
+];
+
+<Table 
+    title=""
+    data={problems}
+    isSorted={false}
+    collectionLink="https://leetcode.com/study-plan/programming-skills"
+/>
+
+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 LeetCode website. You can also click on the solution link to view the solution of the problem.
\ No newline at end of file