diff --git a/dsa-problems/leetcode-problems/1800-1899.md b/dsa-problems/leetcode-problems/1800-1899.md
index e69de29bb..6fbb45b63 100644
--- a/dsa-problems/leetcode-problems/1800-1899.md
+++ b/dsa-problems/leetcode-problems/1800-1899.md
@@ -0,0 +1,622 @@
+---
+id: 1800-1899
+title: LeetCode Problems 1800 - 1899
+sidebar_label: 1800 - 1899
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 1800 - 1899
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "1800. Maximum Ascending Subarray Sum",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-ascending-subarray-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1801. Number of Orders in the Backlog",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-orders-in-the-backlog",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1802. Maximum Value at a Given Index in a Bounded Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1803. Count Pairs With XOR in a Range",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/count-pairs-with-xor-in-a-range",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1804. Implement Trie II (Prefix Tree)",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/implement-trie-ii-prefix-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1805. Number of Different Integers in a String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-different-integers-in-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1806. Minimum Number of Operations to Reinitialize a Permutation",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1807. Evaluate the Bracket Pairs of a String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1808. Maximize Number of Nice Divisors",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximize-number-of-nice-divisors",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1809. Ad-Free Sessions",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/ad-free-sessions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1810. Minimum Path Cost in a Hidden Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-path-cost-in-a-hidden-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1811. Find Interview Candidates",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-interview-candidates",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1812. Determine Color of a Chessboard Square",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/determine-color-of-a-chessboard-square",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1813. Sentence Similarity III",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sentence-similarity-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1814. Count Nice Pairs in an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-nice-pairs-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1815. Maximum Number of Groups Getting Fresh Donuts",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-groups-getting-fresh-donuts",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1816. Truncate Sentence",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/truncate-sentence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1817. Finding the Users Active Minutes",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/finding-the-users-active-minutes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1818. Minimum Absolute Sum Difference",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-absolute-sum-difference",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1819. Number of Different Subsequences GCDs",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-different-subsequences-gcds",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1820. Maximum Number of Accepted Invitations",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-accepted-invitations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1821. Find Customers With Positive Revenue this Year",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-customers-with-positive-revenue-this-year",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1822. Sign of the Product of an Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sign-of-the-product-of-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1823. Find the Winner of the Circular Game",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-winner-of-the-circular-game",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1824. Minimum Sideway Jumps",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-sideway-jumps",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1825. Finding MK Average",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/finding-mk-average",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1826. Faulty Sensor",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/faulty-sensor",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1827. Minimum Operations to Make the Array Increasing",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1828. Queries on Number of Points Inside a Circle",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1829. Maximum XOR for Each Query",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-xor-for-each-query",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1830. Minimum Number of Operations to Make String Sorted",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-make-string-sorted",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1831. Maximum Transaction Each Day",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-transaction-each-day",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1832. Check if the Sentence Is Pangram",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-the-sentence-is-pangram",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1833. Maximum Ice Cream Bars",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-ice-cream-bars",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1834. Single-Threaded CPU",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/single-threaded-cpu",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1835. Find XOR Sum of All Pairs Bitwise AND",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1836. Remove Duplicates From an Unsorted Linked List",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1837. Sum of Digits in Base K",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-digits-in-base-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1838. Frequency of the Most Frequent Element",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/frequency-of-the-most-frequent-element",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1839. Longest Substring Of All Vowels in Order",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-substring-of-all-vowels-in-order",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1840. Maximum Building Height",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-building-height",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1841. League Statistics",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/league-statistics",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1842. Next Palindrome Using Same Digits",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/next-palindrome-using-same-digits",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1843. Suspicious Bank Accounts",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/suspicious-bank-accounts",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1844. Replace All Digits with Characters",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/replace-all-digits-with-characters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1845. Seat Reservation Manager",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/seat-reservation-manager",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1846. Maximum Element After Decreasing and Rearranging",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1847. Closest Room",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/closest-room",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1848. Minimum Distance to the Target Element",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-distance-to-the-target-element",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1849. Splitting a String Into Descending Consecutive Values",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1851. Minimum Interval to Include Each Query",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-interval-to-include-each-query",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1852. Distinct Numbers in Each Subarray",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/distinct-numbers-in-each-subarray",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1853. Convert Date Format",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/convert-date-format",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1854. Maximum Population Year",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-population-year",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1855. Maximum Distance Between a Pair of Values",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-distance-between-a-pair-of-values",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1856. Maximum Subarray Min-Product",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-subarray-min-product",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1857. Largest Color Value in a Directed Graph",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/largest-color-value-in-a-directed-graph",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1858. Longest Word With All Prefixes",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-word-with-all-prefixes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1859. Sorting the Sentence",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sorting-the-sentence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1860. Incremental Memory Leak",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/incremental-memory-leak",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1861. Rotating the Box",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/rotating-the-box",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1862. Sum of Floored Pairs",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-floored-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1863. Sum of All Subset XOR Totals",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-all-subset-xor-totals",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1864. Minimum Number of Swaps to Make the Binary String Alternating",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1865. Finding Pairs With a Certain Sum",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/finding-pairs-with-a-certain-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1866. Number of Ways to Rearrange Sticks With K Sticks Visible",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1867. Orders With Maximum Quantity Above Average",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/orders-with-maximum-quantity-above-average",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1868. Product of Two Run-Length Encoded Arrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/product-of-two-run-length-encoded-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1869. Longer Contiguous Segments of Ones than Zeros",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1870. Minimum Speed to Arrive on Time",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-speed-to-arrive-on-time",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1871. Jump Game VII",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/jump-game-vii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1872. Stone Game VIII",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/stone-game-viii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1873. Calculate Special Bonus",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/calculate-special-bonus",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1874. Minimize Product Sum of Two Arrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-product-sum-of-two-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1875. Group Employees of the Same Salary",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/group-employees-of-the-same-salary",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1876. Substrings of Size Three with Distinct Characters",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1877. Minimize Maximum Pair Sum in Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-maximum-pair-sum-in-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1878. Get Biggest Three Rhombus Sums in a Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/get-biggest-three-rhombus-sums-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1879. Minimum XOR Sum of Two Arrays",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-xor-sum-of-two-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1880. Check if Word Equals Summation of Two Words",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-word-equals-summation-of-two-words",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1881. Maximum Value after Insertion",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-value-after-insertion",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1882. Process Tasks Using Servers",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/process-tasks-using-servers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1883. Minimum Skips to Arrive at Meeting On Time",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-skips-to-arrive-at-meeting-on-time",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1884. Egg Drop With 2 Eggs and N Floors",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/egg-drop-with-2-eggs-and-n-floors",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1885. Count Pairs in Two Arrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-pairs-in-two-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1886. Determine Whether Matrix Can Be Obtained By Rotation",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1887. Reduction Operations to Make the Array Elements Equal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/reduction-operations-to-make-the-array-elements-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1888. Minimum Number of Flips to Make the Binary String Alternating",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1889. Minimum Space Wasted From Packaging",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-space-wasted-from-packaging",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1890. The Latest Login in 2020",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/the-latest-login-in-2020",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1891. Cutting Ribbons",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/cutting-ribbons",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1892. Page Recommendations II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/page-recommendations-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1893. Check if All the Integers in a Range Are Covered",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1894. Find the Student that Will Replace the Chalk",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1895. Largest Magic Square",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/largest-magic-square",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1896. Minimum Cost to Change the Final Value of Expression",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-change-the-final-value-of-expression",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1897. Redistribute Characters to Make All Strings Equal",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1898. Maximum Number of Removable Characters",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-removable-characters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1899. Merge Triplets to Form Target Triplet",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/merge-triplets-to-form-target-triplet",
+    "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