diff --git a/dsa-problems/leetcode-problems/2000-2099.md b/dsa-problems/leetcode-problems/2000-2099.md
index e69de29bb..eed52110e 100644
--- a/dsa-problems/leetcode-problems/2000-2099.md
+++ b/dsa-problems/leetcode-problems/2000-2099.md
@@ -0,0 +1,622 @@
+---
+id: 2000-2099
+title: LeetCode Problems 2000 - 2099
+sidebar_label: 2000 - 2099
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 2000 - 2099
+  - DSA problems
+---
+
+export const problems = [
+    {
+        "problemName": "2000. Reverse Prefix of Word",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/reverse-prefix-of-word",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2001. Number of Pairs of Interchangeable Rectangles",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2002. Maximum Product of the Length of Two Palindromic Subsequences",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2003. Smallest Missing Genetic Value in Each Subtree",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/smallest-missing-genetic-value-in-each-subtree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2004. The Number of Seniors and Juniors to Join the Company",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2005. Subtree Removal Game with Fibonacci Tree",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/subtree-removal-game-with-fibonacci-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2006. Count Number of Pairs With Absolute Difference K",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2007. Find Original Array From Doubled Array",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-original-array-from-doubled-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2008. Maximum Earnings From Taxi",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-earnings-from-taxi",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2009. Minimum Number of Operations to Make Array Continuous",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2010. The Number of Seniors and Juniors to Join the Company II",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2011. Final Value of Variable After Performing Operations",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/final-value-of-variable-after-performing-operations",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2012. Sum of Beauty in the Array",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/sum-of-beauty-in-the-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2013. Detect Squares",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/detect-squares",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2014. Longest Subsequence Repeated k Times",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/longest-subsequence-repeated-k-times",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2015. Average Height of Buildings in Each Segment",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/average-height-of-buildings-in-each-segment",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2016. Maximum Difference Between Increasing Elements",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-difference-between-increasing-elements",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2017. Grid Game",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/grid-game",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2018. Check if Word Can Be Placed In Crossword",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2019. The Score of Students Solving Math Expression",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/the-score-of-students-solving-math-expression",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2020. Number of Accounts That Did Not Stream",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-accounts-that-did-not-stream",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2021. Brightest Position on Street",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/brightest-position-on-street",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2022. Convert 1D Array Into 2D Array",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/convert-1d-array-into-2d-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2023. Number of Pairs of Strings With Concatenation Equal to Target",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2024. Maximize the Confusion of an Exam",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximize-the-confusion-of-an-exam",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2025. Maximum Number of Ways to Partition an Array",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-ways-to-partition-an-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2026. Low-Quality Problems",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/low-quality-problems",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2027. Minimum Moves to Convert String",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-moves-to-convert-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2028. Find Missing Observations",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-missing-observations",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2029. Stone Game IX",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/stone-game-ix",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2030. Smallest K-Length Subsequence With Occurrences of a Letter",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2031. Count Subarrays With More Ones Than Zeros",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/count-subarrays-with-more-ones-than-zeros",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2032. Two Out of Three",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/two-out-of-three",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2033. Minimum Operations to Make a Uni-Value Grid",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2034. Stock Price Fluctuation",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/stock-price-fluctuation",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2035. Partition Array Into Two Arrays to Minimize Sum Difference",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2036. Maximum Alternating Subarray Sum",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-alternating-subarray-sum",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2037. Minimum Number of Moves to Seat Everyone",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2038. Remove Colored Pieces if Both Neighbors are the Same Color",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2039. The Time When the Network Becomes Idle",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/the-time-when-the-network-becomes-idle",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2040. Kth Smallest Product of Two Sorted Arrays",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/kth-smallest-product-of-two-sorted-arrays",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2041. Accepted Candidates From the Interviews",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/accepted-candidates-from-the-interviews",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2042. Check if Numbers Are Ascending in a Sentence",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2043. Simple Bank System",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/simple-bank-system",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2044. Count Number of Maximum Bitwise-OR Subsets",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2045. Second Minimum Time to Reach Destination",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/second-minimum-time-to-reach-destination",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2046. Sort Linked List Already Sorted Using Absolute Values",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/sort-linked-list-already-sorted-using-absolute-values",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2047. Number of Valid Words in a Sentence",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-valid-words-in-a-sentence",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2048. Next Greater Numerically Balanced Number",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/next-greater-numerically-balanced-number",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2049. Count Nodes With the Highest Score",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/count-nodes-with-the-highest-score",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2050. Parallel Courses III",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/parallel-courses-iii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2051. The Category of Each Member in the Store",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/the-category-of-each-member-in-the-store",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2052. Minimum Cost to Separate Sentence Into Rows",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-separate-sentence-into-rows",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2053. Kth Distinct String in an Array",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/kth-distinct-string-in-an-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2054. Two Best Non-Overlapping Events",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/two-best-non-overlapping-events",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2055. Plates Between Candles",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/plates-between-candles",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2056. Number of Valid Move Combinations On Chessboard",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-valid-move-combinations-on-chessboard",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2057. Smallest Index With Equal Value",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/smallest-index-with-equal-value",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2058. Find the Minimum and Maximum Number of Nodes Between Critical Points",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2059. Minimum Operations to Convert Number",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-convert-number",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2060. Check if an Original String Exists Given Two Encoded Strings",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/check-if-an-original-string-exists-given-two-encoded-strings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2061. Number of Spaces Cleaning Robot Cleaned",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-spaces-cleaning-robot-cleaned",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2062. Count Vowel Substrings of a String",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/count-vowel-substrings-of-a-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2063. Vowels of All Substrings",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/vowels-of-all-substrings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2064. Minimized Maximum of Products Distributed to Any Store",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2065. Maximum Path Quality of a Graph",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-path-quality-of-a-graph",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2066. Account Balance",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/account-balance",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2067. Number of Equal Count Substrings",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-equal-count-substrings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2068. Check Whether Two Strings are Almost Equivalent",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2069. Walking Robot Simulation II",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/walking-robot-simulation-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2070. Most Beautiful Item for Each Query",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/most-beautiful-item-for-each-query",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2071. Maximum Number of Tasks You Can Assign",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2072. The Winner University",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/the-winner-university",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2073. Time Needed to Buy Tickets",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/time-needed-to-buy-tickets",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2074. Reverse Nodes in Even Length Groups",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/reverse-nodes-in-even-length-groups",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2075. Decode the Slanted Ciphertext",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/decode-the-slanted-ciphertext",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2076. Process Restricted Friend Requests",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/process-restricted-friend-requests",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2077. Paths in Maze That Lead to Same Room",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/paths-in-maze-that-lead-to-same-room",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2078. Two Furthest Houses With Different Colors",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/two-furthest-houses-with-different-colors",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2079. Watering Plants",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/watering-plants",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2080. Range Frequency Queries",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/range-frequency-queries",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2081. Sum of k-Mirror Numbers",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/sum-of-k-mirror-numbers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2082. The Number of Rich Customers",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/the-number-of-rich-customers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2083. Substrings That Begin and End With the Same Letter",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2084. Drop Type 1 Orders for Customers With Type 0 Orders",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/drop-type-1-orders-for-customers-with-type-0-orders",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2085. Count Common Words With One Occurrence",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/count-common-words-with-one-occurrence",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2086. Minimum Number of Food Buckets to Feed the Hamsters",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2087. Minimum Cost Homecoming of a Robot in a Grid",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-cost-homecoming-of-a-robot-in-a-grid",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2088. Count Fertile Pyramids in a Land",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/count-fertile-pyramids-in-a-land",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2089. Find Target Indices After Sorting Array",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/find-target-indices-after-sorting-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2090. K Radius Subarray Averages",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/k-radius-subarray-averages",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2091. Removing Minimum and Maximum From Array",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/removing-minimum-and-maximum-from-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2092. Find All People With Secret",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/find-all-people-with-secret",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2093. Minimum Cost to Reach City With Discounts",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-reach-city-with-discounts",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2094. Finding 3-Digit Even Numbers",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/finding-3-digit-even-numbers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2095. Delete the Middle Node of a Linked List",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2096. Step-By-Step Directions From a Binary Tree Node to Another",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2097. Valid Arrangement of Pairs",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/valid-arrangement-of-pairs",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2098. Subsequence of Size K With the Largest Even Sum",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/subsequence-of-size-k-with-the-largest-even-sum",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "2099. Find Subsequence of Length K With the Largest Sum",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum",
+        "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