diff --git a/dsa-problems/leetcode-problems/1400-1499.md b/dsa-problems/leetcode-problems/1400-1499.md
index e69de29bb..c6cec67f4 100644
--- a/dsa-problems/leetcode-problems/1400-1499.md
+++ b/dsa-problems/leetcode-problems/1400-1499.md
@@ -0,0 +1,622 @@
+---
+id: 1400-1499
+title: LeetCode Problems 1400 - 1499
+sidebar_label: 1400 - 1499
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 1400 - 1499
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "1400. Construct K Palindrome Strings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/construct-k-palindrome-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1401. Circle and Rectangle Overlapping",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/circle-and-rectangle-overlapping",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1402. Reducing Dishes",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/reducing-dishes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1403. Minimum Subsequence in Non-Increasing Order",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1404. Number of Steps to Reduce a Number in binary representation to one",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1405. Longest Happy String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-happy-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1406. Stone Game III",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/stone-game-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1407. Top Travellers",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/top-travellers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1408. String Matching in an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/string-matching-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1409. Queries on a Permutation With Key",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/queries-on-a-permutation-with-key",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1410. HTML Entity Parser",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/html-entity-parser",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1411. Number of Ways to Paint N × 3 Grid",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1412. Find the Quiet Students in All Exams",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-quiet-students-in-all-exams",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1413. Minimum Value to Get Positive Step by Step Sum",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1415. The k-th Lexicographical String of All Happy Strings of Length n",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1416.  Restore The Array",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/restore-the-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1417. Reformat The String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/reformat-the-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1418. Display Table of Food Orders in a Restaurants",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1419. Minimum Number of Frogs Croaking",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-frogs-croaking",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1420. Build Array Where You Can Find The maximum exactly k comparisons",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1421. NPV Queries",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/npv-queries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1422. Maximum Score After Splitting a String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-score-after-splitting-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1423. Maximum Points You Can Obtain from",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1424. Diagonal Traverse II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/diagonal-traverse-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1425. Constrained Subsequence Sum",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/constrained-subsequence-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1426. Counting Elements",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/counting-elements",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1427. Perform String Shifts",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/perform-string-shifts",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1428. Leftmost Column with at least a one",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/leftmost-column-with-at-least-a-one",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1429. First Unique Number",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/first-unique-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1431. Kids With the Greatest Number of Candies",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/kids-with-the-greatest-number-of-candies",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1432. Max Difference You Can Get From Changing an Integer",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1433. Check If a String Can Break Another String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-a-string-can-break-another-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1434. Number of Ways to Wear Different Hats to each other",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1435. Create a Session Bar Chart",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/create-a-session-bar-chart",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1436. Destination City",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/destination-city",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1437. Check If All 1's Are at Least Length K places away",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1440. Evaluate Boolean Expression",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/evaluate-boolean-expression",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1441. Build an Array With Stack Operations",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/build-an-array-with-stack-operations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1442. Count Triplets That Can Form Two Arrays of Equal XOR",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1443. Minimum Time to Collect All Apples in a tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1444. Number of Ways of Cutting a Pizza",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1445. Apples & Oranges",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/apples-oranges",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1446. Consecutive Characters",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/consecutive-characters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1447. Simplified Fractions",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/simplified-fractions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1448. Count Good Nodes in Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-good-nodes-in-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1449. Form Largest Integer With Digits That Add up to Target",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1450. Number of Students Doing Homework at a Given Time",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1451. Rearrange Words in a Sentence",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/rearrange-words-in-a-sentence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1452. People Whose List of Favorite Companies Is Not a Subset of Another List",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1453. Maximum Number of Darts Inside of a Circular Dartboard",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1454. Active Users",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/active-users",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1456. Maximum Number of Vowels in a Substring of given length",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1457. Pseudo-Palindromic Paths in a Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1458. Max Dot Product of Two Subsequences",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/max-dot-product-of-two-subsequences",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1459. Rectangles Area",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/rectangles-area",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1460. Make Two Arrays Equal by Reversing Subarrays",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1461. Check If a String Contains All Binary codes of size k",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1462. Course Schedule IV",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/course-schedule-iv",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1463. Cherry Pickup II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/cherry-pickup-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1464. Maximum Product of Two Elements in an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1465. Maximum Area of a Piece of Cake After horizontal and vertical cuts",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1466. Reorder Routes to Make All Paths Lead to the city zero",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1467. Probability of a Two Boxes Having The Same Number of Distinct Balls",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1468. Calculate Salaries",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/calculate-salaries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1469. Find All The Lonely Nodes",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-all-the-lonely-nodes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1470. Shuffle the Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/shuffle-the-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1471. The k Strongest Values in an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-k-strongest-values-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1472. Design Browser History",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/design-browser-history",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1473. Paint House III",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/paint-house-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1474. Delete N Nodes After M Nodes after m node of a linked list",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1475. Final Prices With a Special Discount in a Shop",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1476. Subrectangle Queries",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/subrectangle-queries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1477. Find Two Non-overlapping Sub-arrays Each With Target Sum",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1478. Allocate Mailboxes",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/allocate-mailboxes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1479. Sales by Day of the Week",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/sales-by-day-of-the-week",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1480. Running Sum of 1d Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/running-sum-of-1d-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1481. Least Number of Unique Integers after k removals",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1482. Minimum Number of Days to Make m Bouquets",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1483. Kth Ancestor of a Tree Node",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/kth-ancestor-of-a-tree-node",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1484. Group Sold Products By The Date",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/group-sold-products-by-the-date",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1485. Clone Binary Tree With Random Pointer",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/clone-binary-tree-with-random-pointer",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1486. XOR Operation in an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/making-file-names-unique",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1487. Making File Names Unique",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/making-file-names-unique",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1488. Avoid Flood in The City",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/avoid-flood-in-the-city",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1490. Clone N-ary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/clone-n-ary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1491. Average Salary Excluding the Minimum and maximum salary",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1492. The kth Factor of n",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-kth-factor-of-n",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1493. Longest Subarray of 1's After Deleting one element",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1494. Parallel Courses II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/parallel-courses-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1495. Friendly Movies Streamed Last Month",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/friendly-movies-streamed-last-month",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1496. Path Crossing",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/path-crossing",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1497. Check If Array Pairs Are Divisible by k",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1498. Number of Subsequences That Satisfy the given sum condition",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1499. Max Value of Equation",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/max-value-of-equation",
+    "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