diff --git a/dsa-problems/leetcode-problems/2400-2499.md b/dsa-problems/leetcode-problems/2400-2499.md
index e69de29bb..9d18336b9 100644
--- a/dsa-problems/leetcode-problems/2400-2499.md
+++ b/dsa-problems/leetcode-problems/2400-2499.md
@@ -0,0 +1,622 @@
+---
+id: 2400-2499
+title: LeetCode Problems 2400 - 2499
+sidebar_label: 2400 - 2499
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 2400 - 2499
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "2400. Number of Ways to Reach a Position After Exactly k Steps",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2401. Longest Nice Subarray",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-nice-subarray",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2402. Meeting Rooms III",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/meeting-rooms-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2403. Minimum Time to Kill All Monsters",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-kill-all-monsters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2404. Most Frequent Even Element",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/most-frequent-even-element",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2405. Optimal Partition of String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/optimal-partition-of-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2406. Divide Intervals Into Minimum Number of Groups",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2407. Longest Increasing Subsequence II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/longest-increasing-subsequence-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2408. Design SQL",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/design-sql",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2409. Count Days Spent Together",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-days-spent-together",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2410. Maximum Matching of Players With Trainers",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-matching-of-players-with-trainers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2411. Smallest Subarrays With Maximum Bitwise OR",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2412. Minimum Money Required Before Transactions",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-money-required-before-transactions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2413. Smallest Even Multiple",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/smallest-even-multiple",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2414. Length of the Longest Alphabetical Continuous Substring",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/length-of-the-longest-alphabetical-continuous-substring",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2415. Reverse Odd Levels of Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/reverse-odd-levels-of-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2416. Sum of Prefix Scores of Strings",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-prefix-scores-of-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2417. Closest Fair Integer",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/closest-fair-integer",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2418. Sort the People",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sort-the-people",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2419. Longest Subarray With Maximum Bitwise AND",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2420. Find All Good Indices",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-all-good-indices",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2421. Number of Good Paths",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-good-paths",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2422. Merge Operations to Turn Array Into a Palindrome",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/merge-operations-to-turn-array-into-a-palindrome",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2423. Remove Letter To Equalize Frequency",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/remove-letter-to-equalize-frequency",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2424. Longest Uploaded Prefix",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-uploaded-prefix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2425. Bitwise XOR of All Pairings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/bitwise-xor-of-all-pairings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2426. Number of Pairs Satisfying Inequality",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-pairs-satisfying-inequality",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2427. Number of Common Factors",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-common-factors",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2428. Maximum Sum of an Hourglass",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-sum-of-an-hourglass",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2429. Minimize XOR",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-xor",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2430. Maximum Deletions on a String",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-deletions-on-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2431. Maximize Total Tastiness of Purchased Fruits",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximize-total-tastiness-of-purchased-fruits",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2432. The Employee That Worked on the Longest Task",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2433. Find The Original Array of Prefix Xor",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-original-array-of-prefix-xor",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2434. Using a Robot to Print the Lexicographically Smallest String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/using-a-robot-to-print-the-lexicographically-smallest-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2435. Paths in Matrix Whose Sum Is Divisible by K",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2436. Minimum Split Into Subarrays With GCD Greater Than One",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-split-into-subarrays-with-gcd-greater-than-one",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2437. Number of Valid Clock Times",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-valid-clock-times",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2438. Range Product Queries of Powers",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/range-product-queries-of-powers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2439. Minimize Maximum of Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-maximum-of-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2440. Create Components With Same Value",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/create-components-with-same-value",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2441. Largest Positive Integer That Exists With Its Negative",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2442. Count Number of Distinct Integers After Reverse Operations",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2443. Sum of Number and Its Reverse",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-number-and-its-reverse",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2444. Count Subarrays With Fixed Bounds",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-subarrays-with-fixed-bounds",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2445. Number of Nodes With Value One",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-nodes-with-value-one",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2446. Determine if Two Events Have Conflict",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/determine-if-two-events-have-conflict",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2447. Number of Subarrays With GCD Equal to K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-subarrays-with-gcd-equal-to-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2448. Minimum Cost to Make Array Equal",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-make-array-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2449. Minimum Number of Operations to Make Arrays Similar",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-make-arrays-similar",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2450. Number of Distinct Binary Strings After Applying Operations",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-distinct-binary-strings-after-applying-operations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2451. Odd String Difference",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/odd-string-difference",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2452. Words Within Two Edits of Dictionary",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/words-within-two-edits-of-dictionary",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2453. Destroy Sequential Targets",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/destroy-sequential-targets",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2454. Next Greater Element IV",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/next-greater-element-iv",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2455. Average Value of Even Numbers That Are Divisible by Three",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2456. Most Popular Video Creator",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/most-popular-video-creator",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2457. Minimum Addition to Make Integer Beautiful",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-addition-to-make-integer-beautiful",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2458. Height of Binary Tree After Subtree Removal Queries",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2459. Sort Array by Moving Items to Empty Space",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/sort-array-by-moving-items-to-empty-space",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2460. Apply Operations to an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/apply-operations-to-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2461. Maximum Sum of Distinct Subarrays With Length K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2462. Total Cost to Hire K Workers",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/total-cost-to-hire-k-workers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2463. Minimum Total Distance Traveled",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-total-distance-traveled",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2464. Minimum Subarrays in a Valid Split",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-subarrays-in-a-valid-split",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2465. Number of Distinct Averages",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-distinct-averages",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2466. Count Ways To Build Good Strings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-ways-to-build-good-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2467. Most Profitable Path in a Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/most-profitable-path-in-a-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2468. Split Message Based on Limit",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/split-message-based-on-limit",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2469. Convert the Temperature",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/convert-the-temperature",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2470. Number of Subarrays With LCM Equal to K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-subarrays-with-lcm-equal-to-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2471. Minimum Number of Operations to Sort a Binary Tree by Level",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2472. Maximum Number of Non-overlapping Palindrome Substrings",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-non-overlapping-palindrome-substrings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2473. Minimum Cost to Buy Apples",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-buy-apples",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2474. Customers With Strictly Increasing Purchases",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/customers-with-strictly-increasing-purchases",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2475. Number of Unequal Triplets in Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-unequal-triplets-in-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2476. Closest Nodes Queries in a Binary Search Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/closest-nodes-queries-in-a-binary-search-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2477. Minimum Fuel Cost to Report to the Capital",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-fuel-cost-to-report-to-the-capital",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2478. Number of Beautiful Partitions",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-beautiful-partitions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2479. Maximum XOR of Two Non-Overlapping Subtrees",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-xor-of-two-non-overlapping-subtrees",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2480. Form a Chemical Bond",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/form-a-chemical-bond",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2481. Minimum Cuts to Divide a Circle",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cuts-to-divide-a-circle",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2482. Difference Between Ones and Zeros in Row and Column",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2483. Minimum Penalty for a Shop",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-penalty-for-a-shop",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2484. Count Palindromic Subsequences",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-palindromic-subsequences",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2485. Find the Pivot Integer",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-pivot-integer",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2486. Append Characters to String to Make Subsequence",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/append-characters-to-string-to-make-subsequence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2487. Remove Nodes From Linked List",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/remove-nodes-from-linked-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2488. Count Subarrays With Median K",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-subarrays-with-median-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2489. Number of Substrings With Fixed Ratio",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-substrings-with-fixed-ratio",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2490. Circular Sentence",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/circular-sentence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2491. Divide Players Into Teams of Equal Skill",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/divide-players-into-teams-of-equal-skill",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2492. Minimum Score of a Path Between Two Cities",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2493. Divide Nodes Into the Maximum Number of Groups",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2494. Merge Overlapping Events in the Same Hall",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/merge-overlapping-events-in-the-same-hall",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2495. Number of Subarrays Having Even Product",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-subarrays-having-even-product",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2496. Maximum Value of a String in an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-value-of-a-string-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2497. Maximum Star Sum of a Graph",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-star-sum-of-a-graph",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2498. Frog Jump II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/frog-jump-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2499. Minimum Total Cost to Make Arrays Unequal",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-total-cost-to-make-arrays-unequal",
+    "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