From a7032c240ae3ed100b02458d1b8f28336add90af Mon Sep 17 00:00:00 2001
From: Tirth chokshi <chokshitirth4@gmail.com>
Date: Thu, 23 May 2024 22:44:18 +0530
Subject: [PATCH] Added: LeetCode Problems 1100 - 1199

---
 dsa-problems/leetcode-problems/1100-1199.md | 562 ++++++++++++++++++++
 1 file changed, 562 insertions(+)

diff --git a/dsa-problems/leetcode-problems/1100-1199.md b/dsa-problems/leetcode-problems/1100-1199.md
index e69de29bb..d68e6facd 100644
--- a/dsa-problems/leetcode-problems/1100-1199.md
+++ b/dsa-problems/leetcode-problems/1100-1199.md
@@ -0,0 +1,562 @@
+---
+id: 1100-1199
+title: LeetCode Problems 1100 - 1199
+sidebar_label: 1100 - 1199
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 1100 - 1199
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "1100. Find K-Length Substrings With No Repeated Characters",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1111. Maximum Nesting Depth of Two Valid Parentheses Strings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1112. Highest Grade For Each Student",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/highest-grade-for-each-student",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1113. Reported Posts",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/reported-posts",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1114. Print in Order",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/print-in-order",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1115. Print FooBar Alternately",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/print-foobar-alternately",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1116. Print Zero Even Odd",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/print-zero-even-odd",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1117. Building H2O",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/building-h2o",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1118. Number of Days in a Month",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-days-in-a-month",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1119. Remove Vowels from a String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/remove-vowels-from-a-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1120. Maximum Average Subtree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-average-subtree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1121. Divide Array Into Increasing Sequences",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/divide-array-into-increasing-sequences",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1122. Relative Sort Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/relative-sort-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1123. Lowest Common Ancestor of Deepest Leaves",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1124. Longest Well-Performing Interval",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-well-performing-interval",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1125. Smallest Sufficient Team",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/smallest-sufficient-team",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1126. Active Businesses",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/active-businesses",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1127. User Purchase Platform",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/user-purchase-platform",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1128. Number of Equivalent Domino Pairs",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-equivalent-domino-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1129. Shortest Path with Alternating Colors",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-path-with-alternating-colors",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1130. Minimum Cost Tree From Leaf Values",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-tree-from-leaf-values",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1131. Maximum of Absolute Value Expression",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-of-absolute-value-expression",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1132. Reported Posts",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/reported-posts",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1133. Largest Unique Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/largest-unique-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1134. Armstrong Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/armstrong-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1135. Connecting Cities With Minimum Cost",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/connecting-cities-with-minimum-cost",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1136. Parallel Courses",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/parallel-courses",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1137. N-th Tribonacci Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/n-th-tribonacci-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1138. Alphabet Board Path",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/alphabet-board-path",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1139. Largest 1-Bordered Square",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/largest-1-bordered-square",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1140. Stone Game II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/stone-game-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1141. User Activity for the Past 30 Days I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/user-activity-for-the-past-30-days-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1142. User Activity for the Past 30 Days II",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/user-activity-for-the-past-30-days-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1143. Longest Common Subsequence",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-common-subsequence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1144. Decrease Elements To Make Array Zigzag",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/decrease-elements-to-make-array-zigzag",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1145. Binary Tree Coloring Game",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/binary-tree-coloring-game",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1146. Snapshot Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/snapshot-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1147. Longest Chunked Palindrome Decomposition",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/longest-chunked-palindrome-decomposition",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1148. Article Views I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/article-views-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1149. Article Views II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/article-views-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1150. Check If a Number Is Majority Element in a Sorted Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1151. Minimum Swaps to Group All 1's Together",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1152. Analyze User Website Visit Pattern",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/analyze-user-website-visit-pattern",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1153. String Transforms Into Another String",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/string-transforms-into-another-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1154. Day of the Year",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/day-of-the-year",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1155. Number of Dice Rolls With Target Sum",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-dice-rolls-with-target-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1156. Swap For Longest Repeated Character Substring",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/swap-for-longest-repeated-character-substring",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1157. Online Majority Element In Subarray",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/online-majority-element-in-subarray",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1158. Market Analysis I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/market-analysis-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1159. Market Analysis II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/market-analysis-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1160. Find Words That Can Be Formed by Characters",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-words-that-can-be-formed-by-characters",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1161. Maximum Level Sum of a Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1162. As Far from Land as Possible",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/as-far-from-land-as-possible",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1163. Last Substring in Lexicographical Order",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/last-substring-in-lexicographical-order",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1164. Product Price at a Given Date",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/product-price-at-a-given-date",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1165. Single-Row Keyboard",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/single-row-keyboard",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1166. Design File System",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/design-file-system",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1167. Minimum Cost to Connect Sticks",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-connect-sticks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1168. Optimize Water Distribution in a Village",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/optimize-water-distribution-in-a-village",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1169. Invalid Transactions",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/invalid-transactions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1170. Compare Strings by Frequency of the Smallest Character",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1171. Remove Zero Sum Consecutive Nodes from Linked List",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1172. Dinner Plate Stacks",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/dinner-plate-stacks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1173. Immediate Food Delivery I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/immediate-food-delivery-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1174. Immediate Food Delivery II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/immediate-food-delivery-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1175. Prime Arrangements",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/prime-arrangements",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1176. Diet Plan Performance",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/diet-plan-performance",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1177. Can Make Palindrome from Substring",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/can-make-palindrome-from-substring",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1178. Number of Valid Words for Each Puzzle",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-valid-words-for-each-puzzle",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1179. Reformat Department Table",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/reformat-department-table",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1180. Count Substrings with Only One Distinct Letter",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1181. Before and After Puzzle",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/before-and-after-puzzle",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1182. Shortest Distance to Target Color",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-distance-to-target-color",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1183. Maximum Number of Ones",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-ones",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1184. Distance Between Bus Stops",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/distance-between-bus-stops",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1185. Day of the Week",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/day-of-the-week",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1186. Maximum Subarray Sum with One Deletion",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1187. Make Array Strictly Increasing",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/make-array-strictly-increasing",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1188. Design Bounded Blocking Queue",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/design-bounded-blocking-queue",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1189. Maximum Number of Balloons",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-balloons",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1190. Reverse Substrings Between Each Pair of Parentheses",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1191. K-Concatenation Maximum Sum",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/k-concatenation-maximum-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1192. Critical Connections in a Network",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/critical-connections-in-a-network",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1193. Monthly Transactions I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/monthly-transactions-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1194. Tournament Winners",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/tournament-winners",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1195. Fizz Buzz Multithreaded",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/fizz-buzz-multithreaded",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1196. How Many Apples Can You Put into the Basket",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1197. Minimum Knight Moves",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-knight-moves",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1198. Find Smallest Common Element in All Rows",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-smallest-common-element-in-all-rows",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "1199. Minimum Time to Build Blocks",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-build-blocks",
+    "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