diff --git a/dsa-problems/leetcode-problems/2300-2399.md b/dsa-problems/leetcode-problems/2300-2399.md
index e69de29bb..c23a1dbb5 100644
--- a/dsa-problems/leetcode-problems/2300-2399.md
+++ b/dsa-problems/leetcode-problems/2300-2399.md
@@ -0,0 +1,622 @@
+---
+id: 2300-2399
+title: LeetCode Problems 2300 - 2399
+sidebar_label: 2300 - 2399
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 2300 - 2399
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "2300. Successful Pairs of Spells and Potions",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/successful-pairs-of-spells-and-potions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2301. Match Substring After Replacement",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/match-substring-after-replacement",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2302. Count Subarrays With Score Less Than K",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-subarrays-with-score-less-than-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2303. Calculate Amount Paid in Taxes",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/calculate-amount-paid-in-taxes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2304. Minimum Path Cost in a Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-path-cost-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2305. Fair Distribution of Cookies",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/fair-distribution-of-cookies",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2306. Naming a Company",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/naming-a-company",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2307. Check for Contradictions in Equations",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/check-for-contradictions-in-equations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2308. Arrange Table by Gender",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/arrange-table-by-gender",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2309. Greatest English Letter in Upper and Lower Case",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2310. Sum of Numbers With Units Digit K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-numbers-with-units-digit-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2311. Longest Binary Subsequence Less Than or Equal to K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2312. Selling Pieces of Wood",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/selling-pieces-of-wood",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2313. Minimum Flips in Binary Tree to Get Result",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-flips-in-binary-tree-to-get-result",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2314. The First Day of the Maximum Recorded Degree in Each City",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2315. Count Asterisks",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-asterisks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2316. Count Unreachable Pairs of Nodes in an Undirected Graph",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2317. Maximum XOR After Operations",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-xor-after-operations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2318. Number of Distinct Roll Sequences",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-distinct-roll-sequences",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2319. Check if Matrix Is X-Matrix",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-matrix-is-x-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2320. Count Number of Ways to Place Houses",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-number-of-ways-to-place-houses",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2321. Maximum Score Of Spliced Array",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-score-of-spliced-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2322. Minimum Score After Removals on a Tree",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-score-after-removals-on-a-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2323. Find Minimum Time to Finish All Jobs II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2324. Product Sales Analysis IV",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/product-sales-analysis-iv",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2325. Decode the Message",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/decode-the-message",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2326. Spiral Matrix IV",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/spiral-matrix-iv",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2327. Number of People Aware of a Secret",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-people-aware-of-a-secret",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2328. Number of Increasing Paths in a Grid",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-increasing-paths-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2329. Product Sales Analysis V",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/product-sales-analysis-v",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2330. Valid Palindrome IV",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/valid-palindrome-iv",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2331. Evaluate Boolean Binary Tree",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/evaluate-boolean-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2332. The Latest Time to Catch a Bus",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-latest-time-to-catch-a-bus",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2333. Minimum Sum of Squared Difference",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-sum-of-squared-difference",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2334. Subarray With Elements Greater Than Varying Threshold",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/subarray-with-elements-greater-than-varying-threshold",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2335. Minimum Amount of Time to Fill Cups",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2336. Smallest Number in Infinite Set",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/smallest-number-in-infinite-set",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2337. Move Pieces to Obtain a String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/move-pieces-to-obtain-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2338. Count the Number of Ideal Arrays",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-ideal-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2339. All the Matches of the League",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/all-the-matches-of-the-league",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2340. Minimum Adjacent Swaps to Make a Valid Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2341. Maximum Number of Pairs in Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-pairs-in-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2342. Max Sum of a Pair With Equal Sum of Digits",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2343. Query Kth Smallest Trimmed Number",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/query-kth-smallest-trimmed-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2344. Minimum Deletions to Make Array Divisible",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-deletions-to-make-array-divisible",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2345. Finding the Number of Visible Mountains",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/finding-the-number-of-visible-mountains",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2346. Compute the Rank as a Percentage",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/compute-the-rank-as-a-percentage",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2347. Best Poker Hand",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/best-poker-hand",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2348. Number of Zero-Filled Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-zero-filled-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2349. Design a Number Container System",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/design-a-number-container-system",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2350. Shortest Impossible Sequence of Rolls",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-impossible-sequence-of-rolls",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2351. First Letter to Appear Twice",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/first-letter-to-appear-twice",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2352. Equal Row and Column Pairs",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/equal-row-and-column-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2353. Design a Food Rating System",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/design-a-food-rating-system",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2354. Number of Excellent Pairs",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-excellent-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2355. Maximum Number of Books You Can Take",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-books-you-can-take",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2356. Number of Unique Subjects Taught by Each Teacher",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-unique-subjects-taught-by-each-teacher",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2357. Make Array Zero by Subtracting Equal Amounts",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2358. Maximum Number of Groups Entering a Competition",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-groups-entering-a-competition",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2359. Find Closest Node to Given Two Nodes",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-closest-node-to-given-two-nodes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2360. Longest Cycle in a Graph",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/longest-cycle-in-a-graph",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2361. Minimum Costs Using the Train Line",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-costs-using-the-train-line",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2362. Generate the Invoice",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/generate-the-invoice",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2363. Merge Similar Items",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/merge-similar-items",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2364. Count Number of Bad Pairs",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-number-of-bad-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2365. Task Scheduler II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/task-scheduler-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2366. Minimum Replacements to Sort the Array",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-replacements-to-sort-the-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2367. Number of Arithmetic Triplets",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-arithmetic-triplets",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2368. Reachable Nodes With Restrictions",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/reachable-nodes-with-restrictions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2369. Check if There is a Valid Partition For The Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-there-is-a-valid-partition-for-the-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2370. Longest Ideal Subsequence",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-ideal-subsequence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2371. Minimize Maximum Value in a Grid",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-maximum-value-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2372. Calculate the Influence of Each Salesperson",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/calculate-the-influence-of-each-salesperson",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2373. Largest Local Values in a Matrix",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/largest-local-values-in-a-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2374. Node With Highest Edge Score",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/node-with-highest-edge-score",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2375. Construct Smallest Number From DI String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/construct-smallest-number-from-di-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2376. Count Special Integers",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-special-integers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2377. Sort the Olympic Table",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sort-the-olympic-table",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2378. Choose Edges to Maximize Score in a Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/choose-edges-to-maximize-score-in-a-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2379. Minimum Recolors to Get K Consecutive Black Blocks",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2380. Time Needed to Rearrange a Binary String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2381. Shifting Letters II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/shifting-letters-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2382. Maximum Segment Sum After Removals",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-segment-sum-after-removals",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2383. Minimum Hours of Training to Win a Competition",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-hours-of-training-to-win-a-competition",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2384. Largest Palindromic Number",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/largest-palindromic-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2385. Amount of Time for Binary Tree to Be Infected",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2386. Find the K-Sum of an Array",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-k-sum-of-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2387. Median of a Row Wise Sorted Matrix",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/median-of-a-row-wise-sorted-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2388. Change Null Values in a Table to the Previous Value",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/change-null-values-in-a-table-to-the-previous-value",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2389. Longest Subsequence With Limited Sum",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/longest-subsequence-with-limited-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2390. Removing Stars From a String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/removing-stars-from-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2391. Minimum Amount of Time to Collect Garbage",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-amount-of-time-to-collect-garbage",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2392. Build a Matrix With Conditions",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/build-a-matrix-with-conditions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2393. Count Strictly Increasing Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-strictly-increasing-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2394. Employees With Deductions",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/employees-with-deductions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2395. Find Subarrays With Equal Sum",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-subarrays-with-equal-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2396. Strictly Palindromic Number",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/strictly-palindromic-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2397. Maximum Rows Covered by Columns",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-rows-covered-by-columns",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2398. Maximum Number of Robots Within Budget",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-robots-within-budget",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2399. Check Distances Between Same Letters",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-distances-between-same-letters",
+    "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