diff --git a/dsa-problems/leetcode-problems/2900-2999.md b/dsa-problems/leetcode-problems/2900-2999.md
index e69de29bb..8c031cf0a 100644
--- a/dsa-problems/leetcode-problems/2900-2999.md
+++ b/dsa-problems/leetcode-problems/2900-2999.md
@@ -0,0 +1,622 @@
+---
+id: 2900-2999
+title: LeetCode Problems 2900 - 2999
+sidebar_label: 2900 - 2999
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 2900 - 2999
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "2900. Longest Unequal Adjacent Groups Subsequence I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2901. Longest Unequal Adjacent Groups Subsequence II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2902. Count of Sub-Multisets With Bounded Sum",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-of-sub-multisets-with-bounded-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2903. Find Indices With Index and Value Difference I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-indices-with-index-and-value-difference-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2904. Shortest and Lexicographically Smallest Beautiful String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-and-lexicographically-smallest-beautiful-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2905. Find Indices With Index and Value Difference II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-indices-with-index-and-value-difference-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2906. Construct Product Matrix",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/construct-product-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2907. Maximum Profitable Triplets With Increasing Prices I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2908. Minimum Sum of Mountain Triplets I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-sum-of-mountain-triplets-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2909. Minimum Sum of Mountain Triplets II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-sum-of-mountain-triplets-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2910. Minimum Number of Groups to Create a Valid Assignment",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-groups-to-create-a-valid-assignment",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2911. Minimum Changes to Make K Semi-palindromes",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-changes-to-make-k-semi-palindromes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2912. Number of Ways to Reach Destination in the Grid",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-reach-destination-in-the-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2913. Subarrays Distinct Element Sum of Squares I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2914. Minimum Number of Changes to Make Binary String Beautiful",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-changes-to-make-binary-string-beautiful",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2915. Length of the Longest Subsequence That Sums to Target",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/length-of-the-longest-subsequence-that-sums-to-target",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2916. Subarrays Distinct Element Sum of Squares II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2917. Find the K-or of an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-k-or-of-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2918. Minimum Equal Sum of Two Arrays After Replacing Zeros",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2919. Minimum Increment Operations to Make Array Beautiful",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-increment-operations-to-make-array-beautiful",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2920. Maximum Points After Collecting Coins From All Nodes",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-points-after-collecting-coins-from-all-nodes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2921. Maximum Profitable Triplets With Increasing Prices II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2922. Market Analysis III",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/market-analysis-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2923. Find Champion I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-champion-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2924. Find Champion II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-champion-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2925. Maximum Score After Applying Operations on a Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-score-after-applying-operations-on-a-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2926. Maximum Balanced Subsequence Sum",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-balanced-subsequence-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2927. Distribute Candies Among Children III",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/distribute-candies-among-children-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2928. Distribute Candies Among Children I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/distribute-candies-among-children-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2929. Distribute Candies Among Children II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/distribute-candies-among-children-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2930. Number of Strings Which Can Be Rearranged to Contain Substring",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-strings-which-can-be-rearranged-to-contain-substring",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2931. Maximum Spending After Buying Items",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-spending-after-buying-items",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2932. Maximum Strong Pair XOR I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-strong-pair-xor-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2933. High-Access Employees",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/high-access-employees",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2934. Minimum Operations to Maximize Last Elements in Arrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-maximize-last-elements-in-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2935. Maximum Strong Pair XOR II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-strong-pair-xor-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2936. Number of Equal Numbers Blocks",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-equal-numbers-blocks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2937. Make Three Strings Equal",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/make-three-strings-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2938. Separate Black and White Balls",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/separate-black-and-white-balls",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2939. Maximum Xor Product",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-xor-product",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2940. Find Building Where Alice and Bob Can Meet",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2941. Maximum GCD-Sum of a Subarray",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-gcd-sum-of-a-subarray",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2942. Find Words Containing Character",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-words-containing-character",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2943. Maximize Area of Square Hole in Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximize-area-of-square-hole-in-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2944. Minimum Number of Coins for Fruits",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-coins-for-fruits",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2945. Find Maximum Non-decreasing Array Length",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-maximum-non-decreasing-array-length",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2946. Matrix Similarity After Cyclic Shifts",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/matrix-similarity-after-cyclic-shifts",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2947. Count Beautiful Substrings I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-beautiful-substrings-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2948. Make Lexicographically Smallest Array by Swapping Elements",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2949. Count Beautiful Substrings II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-beautiful-substrings-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2950. Number of Divisible Substrings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-divisible-substrings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2951. Find the Peaks",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-peaks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2952. Minimum Number of Coins to be Added",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-coins-to-be-added",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2953. Count Complete Substrings",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-complete-substrings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2954. Count the Number of Infection Sequences",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-infection-sequences",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2955. Number of Same-End Substrings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-same-end-substrings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2956. Find Common Elements Between Two Arrays",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-common-elements-between-two-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2957. Remove Adjacent Almost-Equal Characters",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/remove-adjacent-almost-equal-characters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2958. Length of Longest Subarray With at Most K Frequency",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2959. Number of Possible Sets of Closing Branches",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-possible-sets-of-closing-branches",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2960. Count Tested Devices After Test Operations",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-tested-devices-after-test-operations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2961. Double Modular Exponentiation",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/double-modular-exponentiation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2962. Count Subarrays Where Max Element Appears at Least K Times",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-subarrays-where-max-element-appears-at-least-k-times",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2963. Count the Number of Good Partitions",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-good-partitions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2964. Number of Divisible Triplet Sums",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-divisible-triplet-sums",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2965. Find Missing and Repeated Values",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-missing-and-repeated-values",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2966. Divide Array Into Arrays With Max Difference",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/divide-array-into-arrays-with-max-difference",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2967. Minimum Cost to Make Array Equalindromic",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-make-array-equalindromic",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2968. Apply Operations to Maximize Frequency Score",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/apply-operations-to-maximize-frequency-score",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2969. Minimum Number of Coins for Fruits II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-coins-for-fruits-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2970. Count the Number of Incremovable Subarrays I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2971. Find Polygon With the Largest Perimeter",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-polygon-with-the-largest-perimeter",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2972. Count the Number of Incremovable Subarrays II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2973. Find Number of Coins to Place in Tree Nodes",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-number-of-coins-to-place-in-tree-nodes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2974. Minimum Number Game",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-game",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2975. Maximum Square Area by Removing Fences From a Field",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-square-area-by-removing-fences-from-a-field",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2976. Minimum Cost to Convert String I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-convert-string-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2977. Minimum Cost to Convert String II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-convert-string-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2978. Symmetric Coordinates",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/symmetric-coordinates",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2979. Most Expensive Item That Can Not Be Bought",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/most-expensive-item-that-can-not-be-bought",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2980. Check if Bitwise OR Has Trailing Zeros",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-bitwise-or-has-trailing-zeros",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2981. Find Longest Special Substring That Occurs Thrice I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2982. Find Longest Special Substring That Occurs Thrice II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2983. Palindrome Rearrangement Queries",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/palindrome-rearrangement-queries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2984. Find Peak Calling Hours for Each City",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-peak-calling-hours-for-each-city",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2985. Calculate Compressed Mean",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/calculate-compressed-mean",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2986. Find Third Transaction",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-third-transaction",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2987. Find Expensive Cities",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-expensive-cities",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2988. Manager of the Largest Department",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/manager-of-the-largest-department",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2989. Class Performance",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/class-performance",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2990. Loan Types",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/loan-types",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2991. Top Three Wineries",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/top-three-wineries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2992. Number of Self-Divisible Permutations",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-self-divisible-permutations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2993. Friday Purchases I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/friday-purchases-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2994. Friday Purchases II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/friday-purchases-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2995. Viewers Turned Streamers",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/viewers-turned-streamers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2996. Smallest Missing Integer Greater Than Sequential Prefix Sum",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2997. Minimum Number of Operations to Make Array XOR Equal to K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2998. Minimum Number of Operations to Make X and Y Equal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-make-x-and-y-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2999. Count the Number of Powerful Integers",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-powerful-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