diff --git a/dsa-problems/leetcode-problems/2700-2799.md b/dsa-problems/leetcode-problems/2700-2799.md
index e69de29bb..291ab282f 100644
--- a/dsa-problems/leetcode-problems/2700-2799.md
+++ b/dsa-problems/leetcode-problems/2700-2799.md
@@ -0,0 +1,622 @@
+---
+id: 2700-2799
+title: LeetCode Problems 2700 - 2799
+sidebar_label: 2700 - 2799
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 2700 - 2799
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "2700. Differences Between Two Objects",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/differences-between-two-objects",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2701. Consecutive Transactions with Increasing Amounts",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/consecutive-transactions-with-increasing-amounts",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2702. Minimum Operations to Make Numbers Non-positive",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-make-numbers-non-positive",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2703. Return Length of Arguments Passed",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/return-length-of-arguments-passed",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2704. To Be Or Not To Be",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/to-be-or-not-to-be",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2705. Compact Object",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/compact-object",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2706. Buy Two Chocolates",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/buy-two-chocolates",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2707. Extra Characters in a String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/extra-characters-in-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2708. Maximum Strength of a Group",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-strength-of-a-group",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2709. Greatest Common Divisor Traversal",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/greatest-common-divisor-traversal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2710. Remove Trailing Zeros From a String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/remove-trailing-zeros-from-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2711. Difference of Number of Distinct Values on Diagonals",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/difference-of-number-of-distinct-values-on-diagonals",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2712. Minimum Cost to Make All Characters Equal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-make-all-characters-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2713. Maximum Strictly Increasing Cells in a Matrix",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-strictly-increasing-cells-in-a-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2714. Find Shortest Path with K Hops",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-shortest-path-with-k-hops",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2715. Timeout Cancellation",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/timeout-cancellation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2716. Minimize String Length",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-string-length",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2717. Semi-Ordered Permutation",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/semi-ordered-permutation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2718. Sum of Matrix After Queries",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-matrix-after-queries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2719. Count of Integers",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-of-integers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2720. Popularity Percentage",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/popularity-percentage",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2721. Execute Asynchronous Functions in Parallel",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/execute-asynchronous-functions-in-parallel",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2722. Join Two Arrays by ID",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/join-two-arrays-by-id",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2723. Add Two Promises",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/add-two-promises",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2724. Sort By",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sort-by",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2725. Interval Cancellation",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/interval-cancellation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2726. Calculator with Method Chaining",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/calculator-with-method-chaining",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2727. Is Object Empty",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/is-object-empty",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2728. Count Houses in a Circular Street",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-houses-in-a-circular-street",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2729. Check if The Number is Fascinating",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-the-number-is-fascinating",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2730. Find the Longest Semi-Repetitive Substring",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-longest-semi-repetitive-substring",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2731. Movement of Robots",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/movement-of-robots",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2732. Find a Good Subset of the Matrix",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-a-good-subset-of-the-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2733. Neither Minimum nor Maximum",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/neither-minimum-nor-maximum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2734. Lexicographically Smallest String After Substring Operation",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/lexicographically-smallest-string-after-substring-operation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2735. Collecting Chocolates",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/collecting-chocolates",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2736. Maximum Sum Queries",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-sum-queries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2737. Find the Closest Marked Node",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-closest-marked-node",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2738. Count Occurrences in Text",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-occurrences-in-text",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2739. Total Distance Traveled",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/total-distance-traveled",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2740. Find the Value of the Partition",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-value-of-the-partition",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2741. Special Permutations",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/special-permutations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2742. Painting the Walls",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/painting-the-walls",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2743. Count Substrings Without Repeating Character",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-substrings-without-repeating-character",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2744. Find Maximum Number of String Pairs",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-maximum-number-of-string-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2745. Construct the Longest New String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/construct-the-longest-new-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2746. Decremental String Concatenation",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/decremental-string-concatenation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2747. Count Zero Request Servers",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-zero-request-servers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2748. Number of Beautiful Pairs",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-beautiful-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2749. Minimum Operations to Make the Integer Zero",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-make-the-integer-zero",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2750. Ways to Split Array Into Good Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/ways-to-split-array-into-good-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2751. Robot Collisions",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/robot-collisions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2752. Customers with Maximum Number of Transactions on Consecutive Days",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/customers-with-maximum-number-of-transactions-on-consecutive-days",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2753. Count Houses in a Circular Street II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-houses-in-a-circular-street-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2754. Bind Function to Context",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/bind-function-to-context",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2755. Deep Merge of Two Objects",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/deep-merge-of-two-objects",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2756. Query Batching",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/query-batching",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2757. Generate Circular Array Values",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/generate-circular-array-values",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2758. Next Day",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/next-day",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2759. Convert JSON String to Object",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/convert-json-string-to-object",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2760. Longest Even Odd Subarray With Threshold",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/longest-even-odd-subarray-with-threshold",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2761. Prime Pairs With Target Sum",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/prime-pairs-with-target-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2762. Continuous Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/continuous-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2763. Sum of Imbalance Numbers of All Subarrays",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-imbalance-numbers-of-all-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2764. Is Array a Preorder of Some ‌Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/is-array-a-preorder-of-some-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2765. Longest Alternating Subarray",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/longest-alternating-subarray/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2766. Relocate Marbles",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/relocate-marbles/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2767. Partition String Into Minimum Beautiful Substrings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/partition-string-into-minimum-beautiful-substrings/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2768. Number of Black Blocks",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-black-blocks/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2769. Find the Maximum Achievable Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-maximum-achievable-number/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2770. Maximum Number of Jumps to Reach the Last Index",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-jumps-to-reach-the-last-index",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2771. Longest Non-decreasing Subarray From Two Arrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-non-decreasing-subarray-from-two-arrays/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2772. Apply Operations to Make All Array Elements Equal to Zero",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/apply-operations-to-make-all-array-elements-equal-to-zero/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2773. Height of Special Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/height-of-special-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2774. Array Upper Bound",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/array-upper-bound",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2775. Undefined to Null",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/undefined-to-null",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2776. Convert Callback Based Function to Promise Based Function",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/convert-callback-based-function-to-promise-based-function",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2777. Date Range Generator",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/date-range-generator",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2778. Sum of Squares of Special Elements",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-squares-of-special-elements",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2779. Maximum Beauty of an Array After Applying Operation",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-beauty-of-an-array-after-applying-operation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2780. Minimum Index of a Valid Split",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-index-of-a-valid-split",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2781. Length of the Longest Valid Substring",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/length-of-the-longest-valid-substring/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2782. Number of Unique Categories",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-unique-categories/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2783. Flight Occupancy and Waitlist Analysis",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/flight-occupancy-and-waitlist-analysis",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2784. Check if Array is Good",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-array-is-good/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2785. Sort Vowels in a String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sort-vowels-in-a-string/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2786. Visit Array Positions to Maximize Score",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/visit-array-positions-to-maximize-score/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2787. Ways to Express an Integer as Sum of Powers",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/ways-to-express-an-integer-as-sum-of-powers/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2788. Split Strings by Separator",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/split-strings-by-separator/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2789. Largest Element in an Array after Merge Operations",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/largest-element-in-an-array-after-merge-operations/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2790. Maximum Number of Groups With Increasing Length",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-groups-with-increasing-length/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2791. Count Paths That Can Form a Palindrome in a Tree",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-paths-that-can-form-a-palindrome-in-a-tree/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2792. Count Nodes That Are Great Enough",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-nodes-that-are-great-enough",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2793. Status of Flight Tickets",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/status-of-flight-tickets",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2794. Create Object from Two Arrays",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/create-object-from-two-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2795. Parallel Execution of Promises for Individual Results Retrieval",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/parallel-execution-of-promises-for-individual-results-retrieval",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2796. Repeat String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/repeat-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2797. Partial Function with Placeholders",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/partial-function-with-placeholders",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2798. Number of Employees Who Met the Target",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-employees-who-met-the-target/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2799. Count Complete Subarrays in an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-complete-subarrays-in-an-array/",
+    "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