diff --git a/dsa-problems/leetcode-problems/1600-1699.md b/dsa-problems/leetcode-problems/1600-1699.md
index e69de29bb..fd9521dab 100644
--- a/dsa-problems/leetcode-problems/1600-1699.md
+++ b/dsa-problems/leetcode-problems/1600-1699.md
@@ -0,0 +1,622 @@
+---
+id: 1600-1699
+title: LeetCode Problems 1600 - 1699
+sidebar_label: 1600 - 1699
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 1600 - 1699
+  - DSA problems
+---
+
+export const problems = [
+    {
+        "problemName": "1600. Throne Inheritance",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/throne-inheritance",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1601. Maximum Number of Achievable Transfer Requests",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1602. Find Nearest Right Node in Binary Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-nearest-right-node-in-binary-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1603. Design Parking System",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/design-parking-system",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1604. Alert Using Same Key-Card Three or More Times in a One Hour Period",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1605. Find Valid Matrix Given Row and Column Sums",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1606. Find Servers That Handled Most Number of Requests",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1607. Sellers With No Sales",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/sellers-with-no-sales",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1608. Special Array With X Elements Greater Than or Equal X",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1609. Even Odd Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/even-odd-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1610. Maximum Number of Visible Points",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-visible-points",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1611. Minimum One Bit Operations to Make Integers Zero",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1612. Check If Two Expression Trees are Equivalent",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/check-if-two-expression-trees-are-equivalent",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1613. Find the Missing IDs",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-the-missing-ids",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1614. Maximum Nesting Depth of the Parentheses",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1615. Maximal Network Rank",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximal-network-rank",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1616. Split Two Strings to Make Palindrome",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/split-two-strings-to-make-palindrome",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1617. Count Subtrees With Max Distance Between Cities",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/count-subtrees-with-max-distance-between-cities",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1618. Maximum Font to Fit a Sentence in a Screen",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-font-to-fit-a-sentence-in-a-screen",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1619. Mean of Array After Removing Some Elements",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/mean-of-array-after-removing-some-elements",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1620. Coordinate With Maximum Network Quality",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/coordinate-with-maximum-network-quality",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1621. Number of Sets of K Non-Overlapping Line Segments",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-sets-of-k-non-overlapping-line-segments",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1622. Fancy Sequence",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/fancy-sequence",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1623. All Valid Triplets That Can Represent a Country",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1624. Largest Substring Between Two Equal Characters",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/largest-substring-between-two-equal-characters",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1625. Lexicographically Smallest String After Applying Operations",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1626. Best Team With No Conflicts",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/best-team-with-no-conflicts",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1627. Graph Connectivity With Threshold",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/graph-connectivity-with-threshold",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1628. Design an Expression Tree With Evaluate Function",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1629. Slowest Key",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/slowest-key",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1630. Arithmetic Subarrays",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/arithmetic-subarrays",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1631. Path With Minimum Effort",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/path-with-minimum-effort",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1632. Rank Transform of a Matrix",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/rank-transform-of-a-matrix",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1633. Percentage of Users Attended a Contest",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/percentage-of-users-attended-a-contest",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1634. Add Two Polynomials Represented as Linked Lists",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1635. Hopper Company Queries I",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/hopper-company-queries-i",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1636. Sort Array by Increasing Frequency",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/sort-array-by-increasing-frequency",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1637. Widest Vertical Area Between Two Points Containing No Points",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1638. Count Substrings That Differ by One Character",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/count-substrings-that-differ-by-one-character",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1639. Number of Ways to Form a Target String Given a Dictionary",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1640. Check Array Formation Through Concatenation",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/check-array-formation-through-concatenation",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1641. Count Sorted Vowel Strings",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/count-sorted-vowel-strings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1642. Furthest Building You Can Reach",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/furthest-building-you-can-reach",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1643. Kth Smallest Instructions",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/kth-smallest-instructions",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1644. Lowest Common Ancestor of a Binary Tree II",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1645. Hopper Company Queries II",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/hopper-company-queries-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1646. Get Maximum in Generated Array",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/get-maximum-in-generated-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1647. Minimum Deletions to Make Character Frequencies Unique",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1648. Sell Diminishing-Valued Colored Balls",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/sell-diminishing-valued-colored-balls",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1649. Create Sorted Array through Instructions",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/create-sorted-array-through-instructions",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1650. Lowest Common Ancestor of a Binary Tree III",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1651. Hopper Company Queries III",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/hopper-company-queries-iii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1652. Defuse the Bomb",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/defuse-the-bomb",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1653. Minimum Deletions to Make String Balanced",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-deletions-to-make-string-balanced",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1654. Minimum Jumps to Reach Home",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-jumps-to-reach-home",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1655. Distribute Repeating Integers",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/distribute-repeating-integers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1656. Design an Ordered Stream",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/design-an-ordered-stream",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1657. Determine if Two Strings Are Close",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/determine-if-two-strings-are-close",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1658. Minimum Operations to Reduce X to Zero",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1659. Maximize Grid Happiness",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximize-grid-happiness",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1660. Correct a Binary Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/correct-a-binary-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1661. Average Time of Process per Machine",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/average-time-of-process-per-machine",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1662. Check If Two String Arrays are Equivalent",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1663. Smallest String With A Given Numeric Value",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/smallest-string-with-a-given-numeric-value",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1664. Ways to Make a Fair Array",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/ways-to-make-a-fair-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1665. Minimum Initial Energy to Finish Tasks",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1666. Change the Root of a Binary Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/change-the-root-of-a-binary-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1667. Fix Names in a Table",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/fix-names-in-a-table",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1668. Maximum Repeating Substring",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-repeating-substring",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1669. Merge In Between Linked Lists",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/merge-in-between-linked-lists",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1670. Design Front Middle Back Queue",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/design-front-middle-back-queue",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1671. Minimum Number of Removals to Make Mountain Array",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1672. Richest Customer Wealth",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/richest-customer-wealth",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1673. Find the Most Competitive Subsequence",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-the-most-competitive-subsequence",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1674. Minimum Moves to Make Array Complementary",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-moves-to-make-array-complementary",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1675. Minimize Deviation in Array",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/minimize-deviation-in-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1676. Lowest Common Ancestor of a Binary Tree IV",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1677. Product's Worth Over Invoices",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/products-worth-over-invoices",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1678. Goal Parser Interpretation",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/goal-parser-interpretation",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1679. Max Number of K-Sum Pairs",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/max-number-of-k-sum-pairs",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1680. Concatenation of Consecutive Binary Numbers",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1681. Minimum Incompatibility",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-incompatibility",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1682. Longest Palindromic Subsequence II",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/longest-palindromic-subsequence-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1683. Invalid Tweets",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/invalid-tweets",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1684. Count the Number of Consistent Strings",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-consistent-strings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1685. Sum of Absolute Differences in a Sorted Array",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1686. Stone Game VI",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/stone-game-vi",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1687. Delivering Boxes from Storage to Ports",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/delivering-boxes-from-storage-to-ports",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1688. Count of Matches in Tournament",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/count-of-matches-in-tournament",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1689. Partitioning Into Minimum Number Of Deci-Binary Numbers",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1690. Stone Game VII",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/stone-game-vii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1691. Maximum Height by Stacking Cuboids",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-height-by-stacking-cuboids",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1692. Count Ways to Distribute Candies",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/count-ways-to-distribute-candies",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1693. Daily Leads and Partners",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/daily-leads-and-partners",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1694. Reformat Phone Number",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/reformat-phone-number",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1695. Maximum Erasure Value",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-erasure-value",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1696. Jump Game VI",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/jump-game-vi",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1697. Checking Existence of Edge Length Limited Paths",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1698. Number of Distinct Substrings in a String",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-distinct-substrings-in-a-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1699. Number of Calls Between Two Persons",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-calls-between-two-persons",
+        "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