diff --git a/dsa-problems/leetcode-problems/1000-1099.md b/dsa-problems/leetcode-problems/1000-1099.md
index 228ff62e9..1cd35d11b 100644
--- a/dsa-problems/leetcode-problems/1000-1099.md
+++ b/dsa-problems/leetcode-problems/1000-1099.md
@@ -4,7 +4,619 @@ title: LeetCode Problems 1000 - 1099
 sidebar_label: 1000 - 1099
 keywords:
   - LeetCode
-  - LeeCode Problems
-  - LeeCode Problems 1000 - 1099
-  - dsa problems
+  - LeetCode Problems
+  - LeetCode Problems 1000 - 1099
+  - DSA problems
 ---
+
+export const problems = [
+    {
+      "problemName": "1000. Minimum Cost to Merge Stones",
+      "difficulty": "Hard",
+      "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-merge-stones",
+      "solutionLink": "#"
+    },
+    {
+        "problemName": "1001. Grid Illumination",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/grid-illumination",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1002. Find Common Characters",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/find-common-characters",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1003. Check If Word Is Valid After Substitutions",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/check-if-word-is-valid-after-substitutions",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1004. Max Consecutive Ones III",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/max-consecutive-ones-iii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1005. Maximize Sum Of Array After K Negations",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/maximize-sum-of-array-after-k-negations",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1006. Clumsy Factorial",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/clumsy-factorial",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1007. Minimum Domino Rotations For Equal Row",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-domino-rotations-for-equal-row",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1008. Construct Binary Search Tree from Preorder Traversal",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1009. Complement of Base 10 Integer",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/complement-of-base-10-integer",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1010. Pairs of Songs With Total Durations Divisible by 60",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1011. Capacity To Ship Packages Within D Days",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/capacity-to-ship-packages-within-d-days",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1012. Numbers With Repeated Digits",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/numbers-with-repeated-digits",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1013. Partition Array Into Three Parts With Equal Sum",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1014. Best Sightseeing Pair",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/best-sightseeing-pair",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1015. Smallest Integer Divisible by K",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/smallest-integer-divisible-by-k",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1016. Binary String With Substrings Representing 1 To N",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1017. Convert to Base -2",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/convert-to-base-2",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1018. Binary Prefix Divisible By 5",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/binary-prefix-divisible-by-5",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1019. Next Greater Node In Linked List",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/next-greater-node-in-linked-list",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1020. Number of Enclaves",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-enclaves",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1021. Remove Outermost Parentheses",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/remove-outermost-parentheses",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1022. Sum of Root To Leaf Binary Numbers",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1023. Camelcase Matching",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/camelcase-matching",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1024. Video Stitching",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/video-stitching",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1025. Divisor Game",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/divisor-game",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1026. Maximum Difference Between Node and Ancestor",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-difference-between-node-and-ancestor",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1027. Longest Arithmetic Subsequence",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/longest-arithmetic-subsequence",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1028. Recover a Tree From Preorder Traversal",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/recover-a-tree-from-preorder-traversal",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1029. Two City Scheduling",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/two-city-scheduling",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1030. Matrix Cells in Distance Order",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/matrix-cells-in-distance-order",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1031. Maximum Sum of Two Non-Overlapping Subarrays",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1032. Stream of Characters",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/stream-of-characters",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1033. Moving Stones Until Consecutive",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/moving-stones-until-consecutive",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1034. Coloring A Border",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/coloring-a-border",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1035. Uncrossed Lines",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/uncrossed-lines",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1036. Escape a Large Maze",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/escape-a-large-maze",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1037. Valid Boomerang",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/valid-boomerang",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1038. Binary Search Tree to Greater Sum Tree",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1039. Minimum Score Triangulation of Polygon",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimum-score-triangulation-of-polygon",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1040. Moving Stones Until Consecutive II",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/moving-stones-until-consecutive-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1041. Robot Bounded In Circle",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/robot-bounded-in-circle",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1042. Flower Planting With No Adjacent",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/flower-planting-with-no-adjacent",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1043. Partition Array for Maximum Sum",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/partition-array-for-maximum-sum",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1044. Longest Duplicate Substring",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/longest-duplicate-substring",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1045. Customers Who Bought All Products",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/customers-who-bought-all-products",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1046. Last Stone Weight",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/last-stone-weight",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1047. Remove All Adjacent Duplicates In String",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1048. Longest String Chain",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/longest-string-chain",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1049. Last Stone Weight II",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/last-stone-weight-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1050. Actors and Directors Who Cooperated At Least Three Times",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1051. Height Checker",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/height-checker",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1052. Grumpy Bookstore Owner",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/grumpy-bookstore-owner",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1053. Previous Permutation With One Swap",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/previous-permutation-with-one-swap",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1054. Distant Barcodes",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/distant-barcodes",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1055. Shortest Way to Form String",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/shortest-way-to-form-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1056. Confusing Number",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/confusing-number",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1057. Campus Bikes",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/campus-bikes",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1058. Minimize Rounding Error to Meet Target",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/minimize-rounding-error-to-meet-target",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1059. All Paths from Source Lead to Destination",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/all-paths-from-source-lead-to-destination",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1060. Missing Element in Sorted Array",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/missing-element-in-sorted-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1061. Lexicographically Smallest Equivalent String",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/lexicographically-smallest-equivalent-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1062. Longest Repeating Substring",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/longest-repeating-substring",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1063. Number of Valid Subarrays",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-valid-subarrays",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1064. Fixed Point",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/fixed-point",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1065. Index Pairs of a String",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/index-pairs-of-a-string",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1066. Campus Bikes II",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/campus-bikes-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1067. Digit Count in Range",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/digit-count-in-range",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1068. Product Sales Analysis I",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/product-sales-analysis-i",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1069. Product Sales Analysis II",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/product-sales-analysis-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1070. Product Sales Analysis III",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/product-sales-analysis-iii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1071. Greatest Common Divisor of Strings",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/greatest-common-divisor-of-strings",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1072. Flip Columns For Maximum Number of Equal Rows",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1073. Adding Two Negabinary Numbers",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/adding-two-negabinary-numbers",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1074. Number of Submatrices That Sum to Target",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/number-of-submatrices-that-sum-to-target",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1075. Project Employees I",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/project-employees-i",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1076. Project Employees II",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/project-employees-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1077. Project Employees III",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/project-employees-iii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1078. Occurrences After Bigram",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/occurrences-after-bigram",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1079. Letter Tile Possibilities",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/letter-tile-possibilities",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1080. Insufficient Nodes in Root to Leaf Paths",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1081. Smallest Subsequence of Distinct Characters",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/smallest-subsequence-of-distinct-characters",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1082. Sales Analysis I",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/sales-analysis-i",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1083. Sales Analysis II",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/sales-analysis-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1084. Sales Analysis III",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/sales-analysis-iii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1085. Sum of Digits in the Minimum Number",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/sum-of-digits-in-the-minimum-number",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1086. High Five",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/high-five",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1087. Brace Expansion",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/brace-expansion",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1088. Confusing Number II",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/confusing-number-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1089. Duplicate Zeros",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/duplicate-zeros",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1090. Largest Values From Labels",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/largest-values-from-labels",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1091. Shortest Path in Binary Matrix",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/shortest-path-in-binary-matrix",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1092. Shortest Common Supersequence",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/shortest-common-supersequence",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1093. Statistics from a Large Sample",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/statistics-from-a-large-sample",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1094. Car Pooling",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/car-pooling",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1095. Find in Mountain Array",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/find-in-mountain-array",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1096. Brace Expansion II",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/brace-expansion-ii",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1097. Game Play Analysis V",
+        "difficulty": "Hard",
+        "leetCodeLink": "https://leetcode.com/problems/game-play-analysis-v",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1098. Unpopular Books",
+        "difficulty": "Medium",
+        "leetCodeLink": "https://leetcode.com/problems/unpopular-books",
+        "solutionLink": "#"
+    },
+    {
+        "problemName": "1099. Two Sum Less Than K",
+        "difficulty": "Easy",
+        "leetCodeLink": "https://leetcode.com/problems/two-sum-less-than-k",
+        "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