diff --git a/dsa-problems/leetcode-problems/3100-3199.md b/dsa-problems/leetcode-problems/3100-3199.md
index e69de29bb..26b5e1fff 100644
--- a/dsa-problems/leetcode-problems/3100-3199.md
+++ b/dsa-problems/leetcode-problems/3100-3199.md
@@ -0,0 +1,430 @@
+---
+id: 3100-3199
+title: LeetCode Problems 3100 - 3199
+sidebar_label: 3100 - 3199
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 3100 - 3199
+  - DSA problems
+---
+
+export const problems = [
+{
+    "problemName": "3100. Water Bottles II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/water-bottles-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3101. Count Alternating Subarrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-alternating-subarrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3102. Minimize Manhattan Distances",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-manhattan-distances",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3103. Find Trending Hashtags II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-trending-hashtags-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3104. Find Longest Self-Contained Substring",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-longest-self-contained-substring",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3105. Longest Strictly Increasing or Strictly Decreasing Subarray",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3106. Lexicographically Smallest String After Operations With Constraint",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/lexicographically-smallest-string-after-operations-with-constraint",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3107. Minimum Operations to Make Median of Array Equal to K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-make-median-of-array-equal-to-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3108. Minimum Cost Walk in Weighted Graph",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3109. Find the Index of Permutation",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-index-of-permutation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3110. Score of a String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/score-of-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3111. Minimum Rectangles to Cover Points",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-rectangles-to-cover-points",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3112. Minimum Time to Visit Disappearing Nodes",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3113. Find the Number of Subarrays Where Boundary Elements Are Maximum",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-number-of-subarrays-where-boundary-elements-are-maximum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3114. Latest Time You Can Obtain After Replacing Characters",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/latest-time-you-can-obtain-after-replacing-characters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3115. Maximum Prime Difference",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-prime-difference",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3116. Kth Smallest Amount With Single Denomination Combination",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/kth-smallest-amount-with-single-denomination-combination",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3117. Minimum Sum of Values by Dividing Array",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-sum-of-values-by-dividing-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3118. Friday Purchase III",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/friday-purchase-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3119. Maximum Number of Potholes That Can Be Fixed",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-potholes-that-can-be-fixed",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3120. Count the Number of Special Characters I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-special-characters-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3121. Count the Number of Special Characters II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-special-characters-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3122. Minimum Number of Operations to Satisfy Conditions",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-satisfy-conditions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3123. Find Edges in Shortest Paths",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-edges-in-shortest-paths",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3124. Find Longest Calls",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-longest-calls",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3125. Maximum Number That Makes Result of Bitwise AND Zero",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-that-makes-result-of-bitwise-and-zero",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3126. Server Utilization Time",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/server-utilization-time",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3127. Make a Square with the Same Color",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/make-a-square-with-the-same-color",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3128. Right Triangles",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/right-triangles",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3129. Find All Possible Stable Binary Arrays I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-all-possible-stable-binary-arrays-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3130. Find All Possible Stable Binary Arrays II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-all-possible-stable-binary-arrays-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3131. Find the Integer Added to Array I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-integer-added-to-array-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3132. Find the Integer Added to Array II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-integer-added-to-array-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3133. Minimum Array End",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-array-end",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3134. Find the Median of the Uniqueness Array",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-median-of-the-uniqueness-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3135. Equalize Strings by Adding or Removing Characters at Ends",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/equalize-strings-by-adding-or-removing-characters-at-ends",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3136. Valid Word",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/valid-word",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3137. Minimum Number of Operations to Make Word K-Periodic",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-make-word-k-periodic",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3138. Minimum Length of Anagram Concatenation",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-length-of-anagram-concatenation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3139. Minimum Cost to Equalize Array",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-equalize-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3140. Consecutive Available Seats II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/consecutive-available-seats-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3141. Maximum Hamming Distances",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-hamming-distances",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3142. Check if Grid Satisfies Conditions",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-grid-satisfies-conditions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3143. Maximum Points Inside the Square",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-points-inside-the-square",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3144. Minimum Substring Partition of Equal Character Frequency",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-substring-partition-of-equal-character-frequency",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3145. Find Products of Elements of Big Array",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-products-of-elements-of-big-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3146. Permutation Difference between Two Strings",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/permutation-difference-between-two-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3147. Taking Maximum Energy From the Mystic Dungeon",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/taking-maximum-energy-from-the-mystic-dungeon",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3148. Maximum Difference Score in a Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-difference-score-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3149. Find the Minimum Cost Array Permutation",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-minimum-cost-array-permutation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3150. Invalid Tweets II",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/invalid-tweets-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3151. Special Array I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/special-array-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3152. Special Array II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/special-array-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3153. Sum of Digit Differences of All Pairs",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-digit-differences-of-all-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3154. Find Number of Ways to Reach the K-th Stair",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-number-of-ways-to-reach-the-k-th-stair",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3155. Maximum Number of Upgradable Servers",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-upgradable-servers",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3156. Employee Task Duration and Concurrent Tasks",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/employee-task-duration-and-concurrent-tasks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3157. Find the Level of Tree with Minimum Sum",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-level-of-tree-with-minimum-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3158. Find the XOR of Numbers Which Appear Twice",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-xor-of-numbers-which-appear-twice",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3159. Find Occurrences of an Element in an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-occurrences-of-an-element-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3160. Find the Number of Distinct Colors Among the Balls",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-number-of-distinct-colors-among-the-balls",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3161. Block Placement Queries",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/block-placement-queries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3162. Find the Number of Good Pairs I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-number-of-good-pairs-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3163. String Compression III",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/string-compression-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3164. Find the Number of Good Pairs II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-number-of-good-pairs-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3165. Maximum Sum of Subsequence With Non-adjacent Elements",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-sum-of-subsequence-with-non-adjacent-elements",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3166. Calculate Parking Fees and Duration",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/calculate-parking-fees-and-duration",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "3167. Better Compression of String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/better-compression-of-string",
+    "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