diff --git a/dsa-problems/leetcode-problems/2800-2899.md b/dsa-problems/leetcode-problems/2800-2899.md
index e69de29bb..2493bf533 100644
--- a/dsa-problems/leetcode-problems/2800-2899.md
+++ b/dsa-problems/leetcode-problems/2800-2899.md
@@ -0,0 +1,622 @@
+---
+id: 2800-2899
+title: LeetCode Problems 2800 - 2899
+sidebar_label: 2800 - 2899
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 2800 - 2899
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "2800. Shortest String That Contains Three Strings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-string-that-contains-three-strings/",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2801. Count Stepping Numbers in Range",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-stepping-numbers-in-range",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2802. Find The K-th Lucky Number",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-k-th-lucky-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2803. Factorial Generator",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/factorial-generator",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2804. Array Prototype ForEach",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/array-prototype-foreach",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2805. Custom Interval",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/custom-interval",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2806. Account Balance After Rounded Purchase",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/account-balance-after-rounded-purchase",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2807. Insert Greatest Common Divisors in Linked List",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2808. Minimum Seconds to Equalize a Circular Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-seconds-to-equalize-a-circular-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2809. Minimum Time to Make Array Sum At Most x",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-make-array-sum-at-most-x",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2810. Faulty Keyboard",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/faulty-keyboard",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2811. Check if it is Possible to Split Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-it-is-possible-to-split-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2812. Find the Safest Path in a Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-safest-path-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2813. Maximum Elegance of a K-Length Subsequence",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-elegance-of-a-k-length-subsequence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2814. Minimum Time Takes to Reach Destination Without Drowning",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-takes-to-reach-destination-without-drowning",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2815. Max Pair Sum in an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/max-pair-sum-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2816. Double a Number Represented as a Linked List",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/double-a-number-represented-as-a-linked-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2817. Minimum Absolute Difference Between Elements With Constraint",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-absolute-difference-between-elements-with-constraint",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2818. Apply Operations to Maximize Score",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/apply-operations-to-maximize-score",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2819. Minimum Relative Loss After Buying Chocolates",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-relative-loss-after-buying-chocolates",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2820. Election Results",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/election-results",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2821. Delay the Resolution of Each Promise",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/delay-the-resolution-of-each-promise",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2822. Inversion of Object",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/inversion-of-object",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2823. Deep Object Filter",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/deep-object-filter",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2824. Count Pairs Whose Sum is Less than Target",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-pairs-whose-sum-is-less-than-target",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2825. Make String a Subsequence Using Cyclic Increments",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/make-string-a-subsequence-using-cyclic-increments",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2826. Sorting Three Groups",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sorting-three-groups",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2827. Number of Beautiful Integers in the Range",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-beautiful-integers-in-the-range",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2828. Check if a String Is an Acronym of Words",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2829. Determine the Minimum Sum of a k-avoiding Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/determine-the-minimum-sum-of-a-k-avoiding-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2830. Maximize the Profit as the Salesman",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximize-the-profit-as-the-salesman",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2831. Find the Longest Equal Subarray",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-longest-equal-subarray",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2832. Maximal Range That Each Element Is Maximum in It",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximal-range-that-each-element-is-maximum-in-it",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2833. Furthest Point From Origin",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/furthest-point-from-origin",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2834. Find the Minimum Possible Sum of a Beautiful Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-minimum-possible-sum-of-a-beautiful-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2835. Minimum Operations to Form Subsequence With Target Sum",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-form-subsequence-with-target-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2836. Maximize Value of Function in a Ball Passing Game",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximize-value-of-function-in-a-ball-passing-game",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2837. Total Traveled Distance",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/total-traveled-distance",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2838. Maximum Coins Heroes Can Collect",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-coins-heroes-can-collect",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2839. Check if Strings Can be Made Equal With Operations I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2840. Check if Strings Can be Made Equal With Operations II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2841. Maximum Sum of Almost Unique Subarray",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-sum-of-almost-unique-subarray",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2842. Count K-Subsequences of a String With Maximum Beauty",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-k-subsequences-of-a-string-with-maximum-beauty",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2843. Count Symmetric Integers",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-symmetric-integers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2844. Minimum Operations to Make a Special Number",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-make-a-special-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2845. Count of Interesting Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-of-interesting-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2846. Minimum Edge Weight Equilibrium Queries in a Tree",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-edge-weight-equilibrium-queries-in-a-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2847. Smallest Number With Given Digit Product",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/smallest-number-with-given-digit-product",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2848. Points That Intersect With Cars",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/points-that-intersect-with-cars",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2849. Determine if a Cell Is Reachable at a Given Time",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/determine-if-a-cell-is-reachable-at-a-given-time",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2850. Minimum Moves to Spread Stones Over Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-moves-to-spread-stones-over-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2851. String Transformation",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/string-transformation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2852. Sum of Remoteness of All Cells",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-remoteness-of-all-cells",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2853. Highest Salaries Difference",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/highest-salaries-difference",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2854. Rolling Average Steps",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/rolling-average-steps",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2855. Minimum Right Shifts to Sort the Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-right-shifts-to-sort-the-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2856. Minimum Array Length After Pair Removals",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-array-length-after-pair-removals",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2857. Count Pairs of Points With Distance k",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-pairs-of-points-with-distance-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2858. Minimum Edge Reversals So Every Node Is Reachable",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-edge-reversals-so-every-node-is-reachable",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2859. Sum of Values at Indices With K Set Bits",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-values-at-indices-with-k-set-bits",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2860. Happy Students",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/happy-students",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2861. Maximum Number of Alloys",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-alloys",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2862. Maximum Element-Sum of a Complete Subset of Indices",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-element-sum-of-a-complete-subset-of-indices",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2863. Maximum Length of Semi-Decreasing Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-length-of-semi-decreasing-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2864. Maximum Odd Binary Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-odd-binary-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2865. Beautiful Towers I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/beautiful-towers-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2866. Beautiful Towers II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/beautiful-towers-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2867. Count Valid Paths in a Tree",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-valid-paths-in-a-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2868. The Wording Game",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/the-wording-game",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2869. Minimum Operations to Collect Elements",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-collect-elements",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2870. Minimum Number of Operations to Make Array Empty",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-make-array-empty",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2871. Split Array Into Maximum Number of Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/split-array-into-maximum-number-of-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2872. Maximum Number of K-Divisible Components",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-k-divisible-components",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2873. Maximum Value of an Ordered Triplet I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2874. Maximum Value of an Ordered Triplet II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2875. Minimum Size Subarray in Infinite Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-size-subarray-in-infinite-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2876. Count Visited Nodes in a Directed Graph",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-visited-nodes-in-a-directed-graph",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2877. Create a DataFrame from List",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/create-a-dataframe-from-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2878. Get the Size of a DataFrame",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/get-the-size-of-a-dataframe",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2879. Display the First Three Rows",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/display-the-first-three-rows",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2880. Select Data",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/select-data",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2881. Create a New Column",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/create-a-new-column",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2882. Drop Duplicate Rows",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/drop-duplicate-rows",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2883. Drop Missing Data",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/drop-missing-data",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2884. Modify Columns",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/modify-columns",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2885. Rename Columns",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/rename-columns",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2886. Change Data Type",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/change-data-type",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2887. Fill Missing Data",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/fill-missing-data",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2888. Reshape Data: Concatenate",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/reshape-data-concatenate",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2889. Reshape Data: Pivot",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/reshape-data-pivot",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2890. Reshape Data: Melt",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/reshape-data-melt",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2891. Method Chaining",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/method-chaining",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2892. Minimizing Array After Replacing Pairs With Their Product",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimizing-array-after-replacing-pairs-with-their-product",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2893. Calculate Orders Within Each Interval",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/calculate-orders-within-each-interval",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2894. Divisible and Non-divisible Sums Difference",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/divisible-and-non-divisible-sums-difference",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2895. Minimum Processing Time",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-processing-time",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2896. Apply Operations to Make Two Strings Equal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/apply-operations-to-make-two-strings-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2897. Apply Operations on Array to Maximize Sum of Squares",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/apply-operations-on-array-to-maximize-sum-of-squares",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2898. Maximum Linear Stock Score",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-linear-stock-score",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2899. Last Visited Integers",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/last-visited-integers",
+    "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