diff --git a/dsa-problems/leetcode-problems/1900-1999.md b/dsa-problems/leetcode-problems/1900-1999.md
index e69de29bb..b777c582c 100644
--- a/dsa-problems/leetcode-problems/1900-1999.md
+++ b/dsa-problems/leetcode-problems/1900-1999.md
@@ -0,0 +1,622 @@
+---
+id: 1900-1999
+title: LeetCode Problems 1900 - 1999
+sidebar_label: 1900 - 1999
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 1900 - 1999
+  - DSA problems
+---
+
+export const problems = [
+    {
+        "problemName": "1900. The Earliest and Latest Rounds Where Players Compete",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/the-earliest-and-latest-rounds-where-players-compete",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1901. Find a Peak Element II",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-a-peak-element-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1902. Depth of BST Given Insertion Order",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/depth-of-bst-given-insertion-order",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1903. Largest Odd Number in String",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/largest-odd-number-in-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1904. The Number of Full Rounds You Have Played",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/the-number-of-full-rounds-you-have-played",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1905. Count Sub Islands",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/count-sub-islands",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1906. Minimum Absolute Difference Queries",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-absolute-difference-queries",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1907. Count Salary Categories",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/count-salary-categories",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1908. Game of Nim",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/game-of-nim",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1909. Remove One Element to Make the Array Strictly Increasing",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1910. Remove All Occurrences of a Substring",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/remove-all-occurrences-of-a-substring",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1911. Maximum Alternating Subsequence Sum",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-alternating-subsequence-sum",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1912. Design Movie Rental System",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/design-movie-rental-system",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1913. Maximum Product Difference Between Two Pairs",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-product-difference-between-two-pairs",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1914. Cyclically Rotating a Grid",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/cyclically-rotating-a-grid",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1915. Number of Wonderful Substrings",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-wonderful-substrings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1916. Count Ways to Build Rooms in an Ant Colony",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/count-ways-to-build-rooms-in-an-ant-colony",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1917. Leetcodify Friends Recommendations",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/leetcodify-friends-recommendations",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1918. Kth Smallest Subarray Sum",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/kth-smallest-subarray-sum",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1919. Leetcodify Similar Friends",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/leetcodify-similar-friends",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1920. Build Array from Permutation",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/build-array-from-permutation",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1921. Eliminate Maximum Number of Monsters",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/eliminate-maximum-number-of-monsters",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1922. Count Good Numbers",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/count-good-numbers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1923. Longest Common Subpath",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/longest-common-subpath",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1924. Erect the Fence II",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/erect-the-fence-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1925. Count Square Sum Triples",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/count-square-sum-triples",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1926. Nearest Exit from Entrance in Maze",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/nearest-exit-from-entrance-in-maze",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1927. Sum Game",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/sum-game",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1928. Minimum Cost to Reach Destination in Time",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-reach-destination-in-time",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1929. Concatenation of Array",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/concatenation-of-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1930. Unique Length-3 Palindromic Subsequences",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/unique-length-3-palindromic-subsequences",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1931. Painting a Grid With Three Different Colors",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/painting-a-grid-with-three-different-colors",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1932. Merge BSTs to Create Single BST",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/merge-bsts-to-create-single-bst",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1933. Check if String Is Decomposable Into Value-Equal Substrings",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1934. Confirmation Rate",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/confirmation-rate",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1935. Maximum Number of Words You Can Type",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-words-you-can-type",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1936. Add Minimum Number of Rungs",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/add-minimum-number-of-rungs",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1937. Maximum Number of Points with Cost",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-points-with-cost",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1938. Maximum Genetic Difference Query",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-genetic-difference-query",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1939. Users That Actively Request Confirmation Messages",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/users-that-actively-request-confirmation-messages",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1940. Longest Common Subsequence Between Sorted Arrays",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/longest-common-subsequence-between-sorted-arrays",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1941. Check if All Characters Have Equal Number of Occurrences",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1942. The Number of the Smallest Unoccupied Chair",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1943. Describe the Painting",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/describe-the-painting",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1944. Number of Visible People in a Queue",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-visible-people-in-a-queue",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1945. Sum of Digits of String After Convert",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/sum-of-digits-of-string-after-convert",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1946. Largest Number After Mutating Substring",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/largest-number-after-mutating-substring",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1947. Maximum Compatibility Score Sum",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-compatibility-score-sum",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1948. Delete Duplicate Folders in System",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/delete-duplicate-folders-in-system",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1949. Strong Friendship",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/strong-friendship",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1950. Maximum of Minimum Values in All Subarrays",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-of-minimum-values-in-all-subarrays",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1951. All the Pairs With the Maximum Number of Common Followers",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/all-the-pairs-with-the-maximum-number-of-common-followers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1952. Three Divisors",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/three-divisors",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1953. Maximum Number of Weeks for Which You Can Work",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-weeks-for-which-you-can-work",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1954. Minimum Garden Perimeter to Collect Enough Apples",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-garden-perimeter-to-collect-enough-apples",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1955. Count Number of Special Subsequences",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/count-number-of-special-subsequences",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1956. Minimum Time For K Virus Variants to Spread",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-time-for-k-virus-variants-to-spread",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1957. Delete Characters to Make Fancy String",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/delete-characters-to-make-fancy-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1958. Check if Move is Legal",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/check-if-move-is-legal",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1959. Minimum Total Space Wasted With K Resizing Operations",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-total-space-wasted-with-k-resizing-operations",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1960. Maximum Product of the Length of Two Palindromic Substrings",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1961. Check If String Is a Prefix of Array",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/check-if-string-is-a-prefix-of-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1962. Remove Stones to Minimize the Total",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/remove-stones-to-minimize-the-total",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1963. Minimum Number of Swaps to Make the String Balanced",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1964. Find the Longest Valid Obstacle Course at Each Position",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1965. Employees With Missing Information",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/employees-with-missing-information",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1966. Binary Searchable Numbers in an Unsorted Array",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1967. Number of Strings That Appear as Substrings in Word",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1968. Array With Elements Not Equal to Average of Neighbors",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1969. Minimum Non-Zero Product of the Array Elements",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-non-zero-product-of-the-array-elements",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1970. Last Day Where You Can Still Cross",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/last-day-where-you-can-still-cross",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1971. Find if Path Exists in Graph",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/find-if-path-exists-in-graph",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1972. First and Last Call On the Same Day",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/first-and-last-call-on-the-same-day",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1973. Count Nodes Equal to Sum of Descendants",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/count-nodes-equal-to-sum-of-descendants",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1974. Minimum Time to Type Word Using Special Typewriter",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1975. Maximum Matrix Sum",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-matrix-sum",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1976. Number of Ways to Arrive at Destination",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-arrive-at-destination",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1977. Number of Ways to Separate Numbers",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-separate-numbers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1978. Employees Whose Manager Left the Company",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/employees-whose-manager-left-the-company",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1979. Find Greatest Common Divisor of Array",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/find-greatest-common-divisor-of-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1980. Find Unique Binary String",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-unique-binary-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1981. Minimize the Difference Between Target and Chosen Elements",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1982. Find Array Given Subset Sums",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/find-array-given-subset-sums",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1983. Widest Pair of Indices With Equal Range Sum",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/widest-pair-of-indices-with-equal-range-sum",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1984. Minimum Difference Between Highest and Lowest of K Scores",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1985. Find the Kth Largest Integer in the Array",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1986. Minimum Number of Work Sessions to Finish the Tasks",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1987. Number of Unique Good Subsequences",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-unique-good-subsequences",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1988. Find Cutoff Score for Each School",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-cutoff-score-for-each-school",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1989. Maximum Number of People That Can Be Caught in Tag",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-people-that-can-be-caught-in-tag",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1990. Count the Number of Experiments",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-experiments",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1991. Find the Middle Index in Array",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/find-the-middle-index-in-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1992. Find All Groups of Farmland",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/find-all-groups-of-farmland",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1993. Operations on Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/operations-on-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1994. The Number of Good Subsets",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/the-number-of-good-subsets",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1995. Count Special Quadruplets",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/count-special-quadruplets",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1996. The Number of Weak Characters in the Game",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/the-number-of-weak-characters-in-the-game",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1997. First Day Where You Have Been in All the Rooms",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/first-day-where-you-have-been-in-all-the-rooms",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1998. GCD Sort of an Array",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/gcd-sort-of-an-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1999. Smallest Greater Multiple Made of Two Digits",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/smallest-greater-multiple-made-of-two-digits",
+        "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