diff --git a/dsa-problems/leetcode-problems/2200-2299.md b/dsa-problems/leetcode-problems/2200-2299.md
index e69de29bb..930bac922 100644
--- a/dsa-problems/leetcode-problems/2200-2299.md
+++ b/dsa-problems/leetcode-problems/2200-2299.md
@@ -0,0 +1,622 @@
+---
+id: 2200-2299
+title: LeetCode Problems 2200 - 2299
+sidebar_label: 2200 - 2299
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 2200 - 2299
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "2200. Find All K-Distant Indices in an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-all-k-distant-indices-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2201. Count Artifacts That Can Be Extracted",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-artifacts-that-can-be-extracted",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2202. Maximize the Topmost Element After K Moves",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximize-the-topmost-element-after-k-moves",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2203. Minimum Weighted Subgraph With the Required Paths",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2204. Distance to a Cycle in Undirected Graph",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/distance-to-a-cycle-in-undirected-graph",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2205. The Number of Users That Are Eligible for Discount",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2206. Divide Array Into Equal Pairs",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/divide-array-into-equal-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2207. Maximize Number of Subsequences in a String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximize-number-of-subsequences-in-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2208. Minimum Operations to Halve Array Sum",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-halve-array-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2209. Minimum White Tiles After Covering With Carpets",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-white-tiles-after-covering-with-carpets",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2210. Count Hills and Valleys in an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-hills-and-valleys-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2211. Count Collisions on a Road",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-collisions-on-a-road",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2212. Maximum Points in an Archery Competition",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-points-in-an-archery-competition",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2213. Longest Substring of One Repeating Character",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/longest-substring-of-one-repeating-character",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2214. Minimum Health to Beat Game",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-health-to-beat-game",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2215. Find the Difference of Two Arrays",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-difference-of-two-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2216. Minimum Deletions to Make Array Beautiful",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-deletions-to-make-array-beautiful",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2217. Find Palindrome With Fixed Length",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-palindrome-with-fixed-length",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2218. Maximum Value of K Coins From Piles",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-value-of-k-coins-from-piles",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2219. Maximum Sum Score of Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-sum-score-of-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2220. Minimum Bit Flips to Convert Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-bit-flips-to-convert-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2221. Find Triangular Sum of an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-triangular-sum-of-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2222. Number of Ways to Select Buildings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-select-buildings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2223. Sum of Scores of Built Strings",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-scores-of-built-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2224. Minimum Number of Operations to Convert Time",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-convert-time",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2225. Find Players With Zero or One Losses",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-players-with-zero-or-one-losses",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2226. Maximum Candies Allocated to K Children",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-candies-allocated-to-k-children",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2227. Encrypt and Decrypt Strings",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/encrypt-and-decrypt-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2228. Users With Two Purchases Within Seven Days",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/users-with-two-purchases-within-seven-days",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2229. Check if an Array Is Consecutive",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-an-array-is-consecutive",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2230. The Users That Are Eligible for Discount",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/the-users-that-are-eligible-for-discount",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2231. Largest Number After Digit Swaps by Parity",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2232. Minimize Result by Adding Parentheses to Expression",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2233. Maximum Product After K Increments",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-product-after-k-increments",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2234. Maximum Total Beauty of the Gardens",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-total-beauty-of-the-gardens",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2235. Add Two Integers",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/add-two-integers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2236. Root Equals Sum of Children",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/root-equals-sum-of-children",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2237. Count Positions on Street With Required Brightness",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-positions-on-street-with-required-brightness",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2238. Number of Times a Driver Was a Passenger",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-times-a-driver-was-a-passenger",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2239. Find Closest Number to Zero",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-closest-number-to-zero",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2240. Number of Ways to Buy Pens and Pencils",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-buy-pens-and-pencils",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2241. Design an ATM Machine",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/design-an-atm-machine",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2242. Maximum Score of a Node Sequence",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-score-of-a-node-sequence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2243. Calculate Digit Sum of a String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/calculate-digit-sum-of-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2244. Minimum Rounds to Complete All Tasks",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2245. Maximum Trailing Zeros in a Cornered Path",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-trailing-zeros-in-a-cornered-path",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2246. Longest Path With Different Adjacent Characters",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/longest-path-with-different-adjacent-characters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2247. Maximum Cost of Trip With K Highways",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-cost-of-trip-with-k-highways",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2248. Intersection of Multiple Arrays",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/intersection-of-multiple-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2249. Count Lattice Points Inside a Circle",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-lattice-points-inside-a-circle",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2250. Count Number of Rectangles Containing Each Point",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-number-of-rectangles-containing-each-point",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2251. Number of Flowers in Full Bloom",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-flowers-in-full-bloom",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2252. Dynamic Pivoting of a Table",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/dynamic-pivoting-of-a-table",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2253. Dynamic Unpivoting of a Table",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/dynamic-unpivoting-of-a-table",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2254. Design Video Sharing Platform",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/design-video-sharing-platform",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2255. Count Prefixes of a Given String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-prefixes-of-a-given-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2256. Minimum Average Difference",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-average-difference",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2257. Count Unguarded Cells in the Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-unguarded-cells-in-the-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2258. Escape the Spreading Fire",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/escape-the-spreading-fire",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2259. Remove Digit From Number to Maximize Result",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/remove-digit-from-number-to-maximize-result",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2260. Minimum Consecutive Cards to Pick Up",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2261. K Divisible Elements Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/k-divisible-elements-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2262. Total Appeal of A String",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/total-appeal-of-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2263. Make Array Non-decreasing or Non-increasing",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/make-array-non-decreasing-or-non-increasing",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2264. Largest 3-Same-Digit Number in String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/largest-3-same-digit-number-in-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2265. Count Nodes Equal to Average of Subtree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2266. Count Number of Texts",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-number-of-texts",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2267. Check if There Is a Valid Parentheses String Path",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2268. Minimum Number of Keypresses",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-keypresses",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2269. Find the K-Beauty of a Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-k-beauty-of-a-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2270. Number of Ways to Split Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-split-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2271. Maximum White Tiles Covered by a Carpet",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-white-tiles-covered-by-a-carpet",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2272. Substring With Largest Variance",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/substring-with-largest-variance",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2273. Find Resultant Array After Removing Anagrams",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-resultant-array-after-removing-anagrams",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2274. Maximum Consecutive Floors Without Special Floors",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-consecutive-floors-without-special-floors",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2275. Largest Combination With Bitwise AND Greater Than Zero",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2276. Count Integers in Intervals",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-integers-in-intervals",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2277. Closest Node to Path in Tree",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/closest-node-to-path-in-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2278. Percentage of Letter in String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/percentage-of-letter-in-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2279. Maximum Bags With Full Capacity of Rocks",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2280. Minimum Lines to Represent a Line Chart",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-lines-to-represent-a-line-chart",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2281. Sum of Total Strength of Wizards",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-total-strength-of-wizards",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2282. Number of People That Can Be Seen in a Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-people-that-can-be-seen-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2283. Check if Number Has Equal Digit Count and Digit Value",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2284. Sender With Largest Word Count",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sender-with-largest-word-count",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2285. Maximum Total Importance of Roads",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-total-importance-of-roads",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2286. Booking Concert Tickets in Groups",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/booking-concert-tickets-in-groups",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2287. Rearrange Characters to Make Target String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/rearrange-characters-to-make-target-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2288. Apply Discount to Prices",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/apply-discount-to-prices",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2289. Steps to Make Array Non-decreasing",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/steps-to-make-array-non-decreasing",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2290. Minimum Obstacle Removal to Reach Corner",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2291. Maximum Profit From Trading Stocks",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-profit-from-trading-stocks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2292. Products With Three or More Orders in Two Consecutive Years",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/products-with-three-or-more-orders-in-two-consecutive-years",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2293. Min Max Game",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/min-max-game",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2294. Partition Array Such That Maximum Difference Is K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2295. Replace Elements in an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/replace-elements-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2296. Design a Text Editor",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/design-a-text-editor",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2297. Jump Game VIII",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/jump-game-viii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2298. Tasks Count in the Weekend",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/tasks-count-in-the-weekend",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2299. Strong Password Checker II",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/strong-password-checker-ii",
+    "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