diff --git a/dsa-problems/leetcode-problems/0600-0699.md b/dsa-problems/leetcode-problems/0600-0699.md
index fdfba98a1..fd7ca7675 100644
--- a/dsa-problems/leetcode-problems/0600-0699.md
+++ b/dsa-problems/leetcode-problems/0600-0699.md
@@ -4,7 +4,620 @@ title: LeetCode Problems 600 - 699
 sidebar_label: 0600 - 0699
 keywords:
   - LeetCode
-  - LeeCode Problems
-  - LeeCode Problems 600 - 699
-  - dsa problems
----
\ No newline at end of file
+  - LeetCode Problems
+  - LeetCode Problems 600 - 699
+  - DSA problems
+---
+
+export const problems = [
+{
+    "problemName": "600. Non-negative Integers without Consecutive Ones",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/non-negative-integers-without-consecutive-ones",
+    "solutionLink": "#"
+},
+{
+    "problemName": "601. Human Traffic of Stadium",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/human-traffic-of-stadium",
+    "solutionLink": "#"
+},
+{
+    "problemName": "602. Friend Requests II: Whow has the Most Friends",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends",
+    "solutionLink": "#"
+},
+{
+    "problemName": "603. Consecutive Available Seats",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/consecutive-available-seats",
+    "solutionLink": "#"
+},
+{
+    "problemName": "604. Design Compressed String Iterator",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/design-compressed-string-iterator",
+    "solutionLink": "#"
+},
+{
+    "problemName": "605. Can Place Flowers",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/can-place-flowers",
+    "solutionLink": "#"
+},
+{
+    "problemName": "606. Construct String from Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/construct-string-from-binary-tree",
+    "solutionLink": "#"
+},
+{
+    "problemName": "607. Sales Person",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sales-person",
+    "solutionLink": "#"
+},
+{
+    "problemName": "608. Tree Node",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/tree-node",
+    "solutionLink": "#"
+},
+{
+    "problemName": "609. Find Duplicate File in System",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-duplicate-file-in-system",
+    "solutionLink": "#"
+},
+{
+    "problemName": "610. Triangle Judgement",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/triangle-judgement",
+    "solutionLink": "#"
+},
+{
+    "problemName": "611. Valid Triangle Number",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/valid-triangle-number",
+    "solutionLink": "#"
+},
+{
+    "problemName": "612. Shortest Distance in a Plane",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-distance-in-a-plane",
+    "solutionLink": "#"
+},
+{
+    "problemName": "613. Shortest Distance in a Line",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-distance-in-a-line",
+    "solutionLink": "#"
+},
+{
+    "problemName": "614. Second Degree Follower",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/second-degree-follower",
+    "solutionLink": "#"
+},
+{
+    "problemName": "615. Average Salary: Departments VS Company"
+,
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/average-salary-departments-vs-company",
+    "solutionLink": "#"
+},
+{
+    "problemName": "616. Add Bold Tag in String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/add-bold-tag-in-string",
+    "solutionLink": "#"
+},
+    {
+        "problemName": "617. Merge Two Binary Trees",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/merge-two-binary-trees",
+        "solutionLink": "#"
+    },
+{
+        "problemName": "618. Students Report By Geography",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/students-report-by-geography",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "619. Biggest Single Number",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/biggest-single-number",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "620. Not Boring Movies",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/not-boring-movies",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "621. Task Scheduler",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/task-scheduler",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "622. Design Circular Queue",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/design-circular-queue",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "623. Add One Row to Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/add-one-row-to-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "624. Maximum Distance in Arrays",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-distance-in-arrays",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "625. Minimum Factorization",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-factorization",
+        "solutionLink": "#"
+    },
+        {
+        "problemName": "626. Exchange Seats",
+        "difficulty": "Meidum",
+        "leetCodeLink": "https://leetcode.com/problems/exchange-seats",
+        "solutionLink": "#"
+    },
+       {
+        "problemName": "627. Swap Salary",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/swap-salary",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "628. Maximum Product of Three Numbers",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-product-of-three-numbers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "629. K Inverse Pairs Array",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/k-inverse-pairs-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "630. Course Schedule III",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/course-schedule-iii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "631. Design Excel Sum Formula",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/design-excel-sum-formula",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "632. Smallest Range Covering Elements from K Lists",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "633. Sum of Square Numbers",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/sum-of-square-numbers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "634. Find the Derangement of An Array",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-the-derangement-of-an-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "635. Design Log Storage System",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/design-log-storage-system",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "636. Exclusive Time of Functions",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/exclusive-time-of-functions",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "637. Average of Levels in Binary Tree",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/average-of-levels-in-binary-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "638. Shopping Offers",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/shopping-offers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "639. Decode Ways II",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/decode-ways-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "640. Solve the Equation",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/solve-the-equation",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "641. Design Circular Deque",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/design-circular-deque",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "642. Design Search Autocomplete System",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/design-search-autocomplete-system",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "643. Maximum Average Subarray I",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-average-subarray-i",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "644. Maximum Average Subarray II",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-average-subarray-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "645. Set Mismatch",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/set-mismatch",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "646. Maximum Length of Pair Chain",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-length-of-pair-chain",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "647. Palindromic Substrings",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/palindromic-substrings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "648. Replace Words",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/replace-words",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "649. Dota2 Senate",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/dota2-senate",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "650. 2 Keys Keyboard",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/2-keys-keyboard",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "651. 4 Keys Keyboard",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/4-keys-keyboard",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "652. Find Duplicate Subtrees",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-duplicate-subtrees",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "653. Two Sum IV - Input is a BST",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/two-sum-iv-input-is-a-bst",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "654. Maximum Binary Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-binary-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "655. Print Binary Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/print-binary-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "656. Coin Path",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/coin-path",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "657. Robot Return to Origin",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/robot-return-to-origin",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "658. Find K Closest Elements",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-k-closest-elements",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "659. Split Array into Consecutive Subsequences",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/split-array-into-consecutive-subsequences",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "660. Remove 9",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/remove-9",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "661. Image Smoother",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/image-smoother",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "662. Maximum Width of Binary Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-width-of-binary-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "663. Equal Tree Partition",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/equal-tree-partition",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "664. Strange Printer",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/strange-printer",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "665. Non-decreasing Array",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/non-decreasing-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "666. Path Sum IV",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/path-sum-iv",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "667. Beautiful Arrangement II",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/beautiful-arrangement-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "668. Kth Smallest Number in Multiplication Table",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/kth-smallest-number-in-multiplication-table",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "669. Trim a Binary Search Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/trim-a-binary-search-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "670. Maximum Swap",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-swap",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "671. Second Minimum Node In a Binary Tree",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/second-minimum-node-in-a-binary-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "672. Bulb Switcher II",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/bulb-switcher-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "673. Number of Longest Increasing Subsequence",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-longest-increasing-subsequence",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "674. Longest Continuous Increasing Subsequence",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/longest-continuous-increasing-subsequence",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "675. Cut Off Trees for Golf Event",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/cut-off-trees-for-golf-event",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "676. Implement Magic Dictionary",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/implement-magic-dictionary",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "677. Map Sum Pairs",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/map-sum-pairs",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "678. Valid Parenthesis String",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/valid-parenthesis-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "679. 24 Game",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/24-game",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "680. Valid Palindrome II",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/valid-palindrome-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "681. Next Closest Time",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/next-closest-time",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "682. Baseball Game",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/baseball-game",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "683. K Empty Slots",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/k-empty-slots",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "684. Redundant Connection",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/redundant-connection",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "685. Redundant Connection II",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/redundant-connection-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "686. Repeated String Match",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/repeated-string-match",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "687. Longest Univalue Path",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/longest-univalue-path",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "688. Knight Probability in Chessboard",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/knight-probability-in-chessboard",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "689. Maximum Sum of 3 Non-Overlapping Subarrays",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "690. Employee Importance",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/employee-importance",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "691. Stickers to Spell Word",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/stickers-to-spell-word",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "692. Top K Frequent Words",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/top-k-frequent-words",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "693. Binary Number with Alternating Bits",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/binary-number-with-alternating-bits",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "694. Number of Distinct Islands",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-distinct-islands",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "695. Max Area of Island",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/max-area-of-island",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "696. Count Binary Substrings",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/count-binary-substrings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "697. Degree of an Array",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/degree-of-an-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "698. Partition to K Equal Sum Subsets",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/partition-to-k-equal-sum-subsets",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "699. Falling Squares",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/falling-squares",
+        "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