From 500d51a1880004a08dea10a9efdbe2011daa9d98 Mon Sep 17 00:00:00 2001
From: anoushka <theolivequeen.xyz@gmail.com>
Date: Thu, 30 May 2024 22:09:23 +0300
Subject: [PATCH] leetcode 2500 - 2599

---
 dsa-problems/leetcode-problems/2500-2599.md | 622 ++++++++++++++++++++
 1 file changed, 622 insertions(+)

diff --git a/dsa-problems/leetcode-problems/2500-2599.md b/dsa-problems/leetcode-problems/2500-2599.md
index e69de29bb..99b386e19 100644
--- a/dsa-problems/leetcode-problems/2500-2599.md
+++ b/dsa-problems/leetcode-problems/2500-2599.md
@@ -0,0 +1,622 @@
+---
+id: 2500-2599
+title: LeetCode Problems 2500 - 2599
+sidebar_label: 2500 - 2599
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 2500 - 2599
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "2500. Delete Greatest Value in Each Row",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/delete-greatest-value-in-each-row",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2501. Longest Square Streak in an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-square-streak-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2502. Design Memory Allocator",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/design-memory-allocator",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2503. Maximum Number of Points From Grid Queries",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-points-from-grid-queries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2504. Concatenate the Name and the Profession",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/concatenate-the-name-and-the-profession",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2505. Bitwise OR of All Subsequence Sums",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/bitwise-or-of-all-subsequence-sums",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2506. Count Pairs Of Similar Strings",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-pairs-of-similar-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2507. Smallest Value After Replacing With Sum of Prime Factors",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/smallest-value-after-replacing-with-sum-of-prime-factors",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2508. Add Edges to Make Degrees of All Nodes Even",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/add-edges-to-make-degrees-of-all-nodes-even",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2509. Cycle Length Queries in a Tree",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/cycle-length-queries-in-a-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2510. Check if There is a Path With Equal Number of 0's And 1's",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2511. Maximum Enemy Forts That Can Be Captured",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2512. Reward Top K Students",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/reward-top-k-students",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2513. Minimize the Maximum of Two Arrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-the-maximum-of-two-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2514. Count Anagrams",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-anagrams",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2515. Shortest Distance to Target String in a Circular Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2516. Take K of Each Character From Left and Right",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/take-k-of-each-character-from-left-and-right",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2517. Maximum Tastiness of Candy Basket",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-tastiness-of-candy-basket",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2518. Number of Great Partitions",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-great-partitions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2519. Count the Number of K-Big Indices",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-k-big-indices",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2520. Count the Digits That Divide a Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-digits-that-divide-a-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2521. Distinct Prime Factors of Product of Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/distinct-prime-factors-of-product-of-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2522. Partition String Into Substrings With Values at Most K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/partition-string-into-substrings-with-values-at-most-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2523. Closest Prime Numbers in Range",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/closest-prime-numbers-in-range",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2524. Maximum Frequency Score of a Subarray",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-frequency-score-of-a-subarray",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2525. Categorize Box According to Criteria",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/categorize-box-according-to-criteria",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2526. Find Consecutive Integers from a Data Stream",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-consecutive-integers-from-a-data-stream",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2527. Find Xor-Beauty of Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-xor-beauty-of-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2528. Maximize the Minimum Powered City",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximize-the-minimum-powered-city",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2529. Maximum Count of Positive Integer and Negative Integer",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2530. Maximal Score After Applying K Operations",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximal-score-after-applying-k-operations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2531. Make Number of Distinct Characters Equal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/make-number-of-distinct-characters-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2532. Time to Cross a Bridge",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/time-to-cross-a-bridge",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2533. Number of Good Binary Strings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-good-binary-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2534. Time Taken to Cross the Door",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/time-taken-to-cross-the-door",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2535. Difference Between Element Sum and Digit Sum of an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2536. Increment Submatrices by One",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/increment-submatrices-by-one",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2537. Count the Number of Good Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-good-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2538. Difference Between Maximum and Minimum Price Sum",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/difference-between-maximum-and-minimum-price-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2539. Count the Number of Good Subsequences",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-good-subsequences",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2540. Minimum Common Value",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-common-value",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2541. Minimum Operations to Make Array Equal II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-make-array-equal-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2542. Maximum Subsequence Score",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-subsequence-score",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2543. Check if Point Is Reachable",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-point-is-reachable",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2544. Alternating Digit Sum",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/alternating-digit-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2545. Sort the Students by Their Kth Score",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sort-the-students-by-their-kth-score",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2546. Apply Bitwise Operations to Make Strings Equal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/apply-bitwise-operations-to-make-strings-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2547. Minimum Cost to Split an Array",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-split-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2548. Maximum Price to Fill a Bag",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-price-to-fill-a-bag",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2549. Count Distinct Numbers on Board",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-distinct-numbers-on-board",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2550. Count Collisions of Monkeys on a Polygon",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-collisions-of-monkeys-on-a-polygon",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2551. Put Marbles in Bags",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/put-marbles-in-bags",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2552. Count Increasing Quadruplets",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-increasing-quadruplets",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2553. Separate the Digits in an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/separate-the-digits-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2554. Maximum Number of Integers to Choose From a Range I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2555. Maximize Win From Two Segments",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximize-win-from-two-segments",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2556. Disconnect Path in a Binary Matrix by at Most One Flip",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2557. Maximum Number of Integers to Choose From a Range II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2558. Take Gifts From the Richest Pile",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/take-gifts-from-the-richest-pile",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2559. Count Vowel Strings in Ranges",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-vowel-strings-in-ranges",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2560. House Robber IV",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/house-robber-iv",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2561. Rearranging Fruits",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/rearranging-fruits",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2562. Find the Array Concatenation Value",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-array-concatenation-value",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2563. Count the Number of Fair Pairs",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-fair-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2564. Substring XOR Queries",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/substring-xor-queries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2565. Subsequence With the Minimum Score",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/subsequence-with-the-minimum-score",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2566. Maximum Difference by Remapping a Digit",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-difference-by-remapping-a-digit",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2567. Minimum Score by Changing Two Elements",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-score-by-changing-two-elements",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2568. Minimum Impossible OR",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-impossible-or",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2569. Handling Sum Queries After Update",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/handling-sum-queries-after-update",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2570. Merge Two 2D Arrays by Summing Values",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2571. Minimum Operations to Reduce an Integer to 0",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-reduce-an-integer-to-0",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2572. Count the Number of Square-Free Subsets",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-square-free-subsets",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2573. Find the String with LCP",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-string-with-lcp",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2574. Left and Right Sum Differences",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/left-and-right-sum-differences",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2575. Find the Divisibility Array of a String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-divisibility-array-of-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2576. Find the Maximum Number of Marked Indices",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-maximum-number-of-marked-indices",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2577. Minimum Time to Visit a Cell In a Grid",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-visit-a-cell-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2578. Split With Minimum Sum",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/split-with-minimum-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2579. Count Total Number of Colored Cells",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-total-number-of-colored-cells",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2580. Count Ways to Group Overlapping Ranges",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-ways-to-group-overlapping-ranges",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2581. Count Number of Possible Root Nodes",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-number-of-possible-root-nodes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2582. Pass the Pillow",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/pass-the-pillow",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2583. Kth Largest Sum in a Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2584. Split the Array to Make Coprime Products",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/split-the-array-to-make-coprime-products",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2585. Number of Ways to Earn Points",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-earn-points",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2586. Count the Number of Vowel Strings in Range",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2587. Rearrange Array to Maximize Prefix Score",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/rearrange-array-to-maximize-prefix-score",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2588. Count the Number of Beautiful Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-beautiful-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2589. Minimum Time to Complete All Tasks",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-complete-all-tasks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2590. Design a Todo List",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/design-a-todo-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2591. Distribute Money to Maximum Children",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/distribute-money-to-maximum-children",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2592. Maximize Greatness of an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximize-greatness-of-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2593. Find Score of an Array After Marking All Elements",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2594. Minimum Time to Repair Cars",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-repair-cars",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2595. Number of Even and Odd Bits",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-even-and-odd-bits",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2596. Check Knight Tour Configuration",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/check-knight-tour-configuration",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2597. The Number of Beautiful Subsets",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-number-of-beautiful-subsets",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2598. Smallest Missing Non-negative Integer After Operations",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2599. Make the Prefix Sum Non-negative",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/make-the-prefix-sum-non-negative",
+    "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