101. | Reveal Cards In Increasing Order | 2 Approaches | Leetcode 950 | codestorywithMIK | 8,515 | |
|
102. | Two Best Non-Overlapping Events | Brute Force | Better | Leetcode 2054 | codestorywithMIK | 8,488 | | Brute Force
|
103. | Minimum Number of Days to Make m Bouquets | Simple Thought Process| Leetcode 1482 | codestorywithMIK | 8,449 | |
|
104. | Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK | 8,448 | |
|
105. | Walking Robot Simulation | Detailed Simulation | Leetcode 874 | codestorywithMIK | 8,447 | |
|
106. | Shortest Subarray to be Removed to Make Array Sorted | Detailed | Leetcode 1574 | codestorywithMIK | 8,422 | |
|
107. | Minimum Number of Removals to Make Mountain Array | Thought Process | Leetcode 1671|codestorywithMIK | 8,418 | |
|
108. | Divide Intervals Into Minimum Number of Groups | Simple Intuition | Leetcode 2406 | codestorywithMIK | 8,395 | |
|
109. | 2 Keys Keyboard | Detailed Explanations | Leetcode 650 | codestorywithMIK | 8,381 | |
|
110. | Push Dominoes | Simplest Intuition | Complete Dry Run | Leetcode 838 | codestorywithMIK | 8,360 | | Dominoes
|
111. | Smallest Range Covering Elements from K Lists | Multiple Ways | Leetcode 632 | codestorywithMIK | 8,342 | |
|
112. | Minimum Number of Operations to Move All Balls to Each Box | Leetcode 1769 | 3 Approaches | MIK | 8,307 | |
|
113. | Find the Winner of the Circular Game | 3 Approaches | Leetcode 1823 | codestorywithMIK | 8,291 | |
|
114. | Prime Subtraction Operation | Straight Forward Approach | Leetcode 2601 | codestorywithMIK | 8,280 | |
|
115. | Move Pieces to Obtain a String | Brute Force | Wrong | Optimal | Leetcode 2337 | codestorywithMIK | 8,274 | |
|
116. | Combination Sum II | Simple Khandani Template | Leetcode 40 | codestorywithMIK | 8,215 | |
|
117. | Check if Grid can be Cut into Sections | Merge Intervals | Leetcode 3394 | Leetcode 56 | Detailed | 8,215 | |
|
118. | Remove K Digits | Intuition | Dry Run | Leetcode 402 | codestorywithMIK | 8,166 | |
|
119. | Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK | 8,132 | |
|
120. | Sliding Puzzle | Detailed for Beginners | Leetcode 773 | codestorywithMIK | 8,130 | |
|
121. | Count the Number of Fair Pairs | Detailed Explanation | Leetcode 2563 | codestorywithMIK | 8,101 | |
|
122. | Most Profit Assigning Work | Multiple Approaches | With Intuition | Leetcode 826 | codestorywithMIK | 8,093 | |
|
123. | Longest Palindrome by Concatenating Two Letter Words | Simple Way | Leetcode 2131 | codestorywithMIK | 8,074 | |
|
124. | Divide Nodes Into the Maximum Number of Groups | Super Detailed | Leetcode 2493 | codestorywithMIK | 8,049 | |
|
125. | Count Subarrays Where Max Element Appears at Least K Times | 2 Approaches | Leetcode 2962 | 8,033 | |
|
126. | Avoid using Global Variables | codestorywithMIK | 8,024 | |
|
127. | Count Number of Nice Subarrays | 2 Approaches | Similar Concept | Leetcode 1248 | codestorywithMIK | 8,014 | |
|
128. | Remove All Occurrences of a Substring | 3 Approaches | Leetcode 1910 | codestorywithMIK | 7,952 | |
|
129. | Second Minimum Time to Reach Destination | 2 Approaches | FULL DRY RUN | Leetcode 2045 | 7,935 | |
|
130. | Maximum Swap | 2 Simple Approaches | Leetcode 670 | codestorywithMIK | 7,923 | |
|
131. | Task Scheduler | Easy Intuition | Using Heap | Leetcode 621 | codestorywithMIK | 7,904 | |
|
132. | Reverse Substrings Between Each Pair of Parentheses | 2 Approaches | Leetcode 1190 |codestorywithMIK | 7,902 | |
|
133. | Minimum Time Difference | Easy Approach | Detailed | Leetcode 539 | codestorywithMIK | 7,869 | |
|
134. | Word Subsets | Simple Thought Process | C++ | Java | Leetcode 916 | codestorywithMIK | 7,845 | |
|
135. | My Calendar I | Detailed Approach | Leetcode 729 | codestorywithMIK | 7,818 | |
|
136. | Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK | 7,806 | |
|
137. | Flip Columns For Maximum Number of Equal Rows | 2 Approaches | Leetcode 1072 | codestorywithMIK | 7,765 | |
|
138. | Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK | 7,748 | |
|
139. | Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | codestorywithMIK | 7,738 | |
|
140. | Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK | 7,734 | |
|
141. | Find All Possible Recipes from Given Supplies | Brute Force | Optimal | Leetcode 2115 | 7,733 | | Brute Force
|
142. | Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | codestorywithMIK | 7,675 | |
|
143. | Magic Squares In Grid | Simple Approach | Clean Code | Leetcode 840 | codestorywithMIK | 7,671 | |
|
144. | Hierholzer's Algorithm | Valid Arrangement of Pairs | Leetcode 2097 | Graph Concepts & Qns - 43 | 7,667 | |
|
145. | Maximum Score From Removing Substrings | 2 Approaches | With Proof | Leetcode 1717 | 7,660 | |
|
146. | Robot Collisions | Made Easy | Dry Run | Leetcode 2751 | codestorywithMIK | 7,645 | |
|
147. | Find Longest Special Substring That Occurs Thrice I & II | Leetcode 2981 & 2982 | codestorywithMIK | 7,637 | |
|
148. | Count Triplets That Can Form Two Arrays of Equal XOR | Leetcode 1442 | codestorywithMIK | 7,636 | |
|
149. | Open the Lock | Why BFS | Similar Pattern Problems | META | Leetcode 752 | codestorywithMIK | 7,617 | |
|
150. | The k-th Lexicographical String of All Happy Strings of Length n | Leetcode 1415 | codestorywithMIK | 7,567 | |
|
151. | Largest Combination With Bitwise AND Greater Than Zero | Detailed | Leetcode 2275 | codestorywithMIK | 7,534 | |
|
152. | Find Common Characters | Simple Dry Run | Leetcode 1002 | codestorywithMIK | 7,527 | |
|
153. | Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK | 7,495 | |
|
154. | Count Number of Maximum Bitwise-OR Subsets | Simplest Approach |Leetcode 2044 | codestorywithMIK | 7,468 | |
|
155. | Maximum Beauty of an Array After Applying Operation | 3 Approaches | Leetcode 2779 |codestorywithMIK | 7,460 | |
|
156. | Count Number of Bad Pairs | 3 Ways | Intuition | Leetcode 2364 | codestorywithMIK | 7,446 | |
|
157. | Count Good Triplets in an Array | Segment Tree Concepts & Qns | Video 12 | Leetcode 2179 | MIK | 7,437 | |
|
158. | Maximum Average Pass Ratio | Detailed | Covered Minute Details | Leetcode 1792 | codestorywithMIK | 7,405 | |
|
159. | Build a Matrix With Conditions | BFS | DFS | Detailed Explanation | Leetcode 2392 | codestorywithMIK | 7,367 | |
|
160. | Find the Length of the Longest Common Prefix | 2 Approaches | Leetcode 3043 | codestorywithMIK | 7,356 | |
|
161. | Construct K Palindrome Strings | Super Detailed Intuition | Leetcode 1400 | codestorywithMIK | 7,322 | |
|
162. | Maximum XOR for Each Query | Simple Explanation | Leetcode 1829 | codestorywithMIK | 7,303 | | XOR
|
163. | Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK | 7,227 | |
|
164. | Maximal Rectangle | Multiple Hidden Problems | Intuition | Leetcode 85 | codestorywithMIK | 7,225 | |
|
165. | Find Valid Matrix Given Row and Column Sums | Simple Approach | Leetcode 1605 | codestorywithMIK | 7,204 | |
|
166. | Maximum Candies Allocated to K Children | Brute Force | Optimal | Leetcode 2226 | codestorywithMIK | 7,202 | | Brute Force
|
167. | Shortest Subarray With OR at Least K II | Made Easy | Detailed | Leetcode 3097 | codestorywithMIK | 7,160 | |
|
168. | Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK | 7,149 | |
|
169. | Most Beautiful Item for Each Query | Simple Explanation | Leetcode 2070 | codestorywithMIK | 7,100 | |
|
170. | Create Binary Tree From Descriptions | Simplest Approach | Leetcode 2196 | codestorywithMIK | 7,073 | |
|
171. | Course Schedule IV | 3 Detailed Approaches | Leetcode 1462 | codestorywithMIK | 7,071 | |
|
172. | How codestorywithMIK was started | Motivation | Rejections | 50K Special | 7,041 | |
|
173. | Maximum Absolute Sum of Any Subarray | Kadane's Algorithm | Leetcode 1749 | codestorywithMIK | 7,040 | |
|
174. | Longest Square Streak in an Array | Detailed Approaches | Dry Run | Leetcode 2501 | codestorywithMIK | 7,030 | |
|
175. | Maximum Candies You Can Get from Boxes | 2 Ways | Simple Intuition | Leetcode 1298 |codestorywithMIK | 7,027 | |
|
176. | Minimum Index of a Valid Split | 2 Approaches | Leetcode 2780 | codestorywithMIK | 7,021 | |
|
177. | Count Sub Islands | Easiest Thought Process | Leetcode 1905 | codestorywithMIK | 7,019 | | Counter-Strike: Source
|
178. | Linked List in Binary Tree | Easy | Dry Run | Leetcode 1367 | codestorywithMIK | 7,018 | |
|
179. | Balance a Binary Search Tree | Simple Explanation | Leetcode 1382 | codestorywithMIK | 6,973 | |
|
180. | Design a Number Container System | 2 Approaches | Leetcode 2349 | codestorywithMIK | 6,970 | |
|
181. | Special Array II | 3 Detailed Approaches | Beginners Alert | Leetcode 3152 | codestorywithMIK | 6,916 | |
|
182. | Minimum Difference Between Largest and Smallest Value in Three Moves | 2 Approaches | Leetcode 1509 | 6,912 | |
|
183. | All Ancestors of a Node in a Directed Acyclic Graph | 3 Approaches | Leetcode 2192 |codestorywithMIK | 6,878 | |
|
184. | Find the City With the Smallest Number of Neighbors at a Threshold Distance | 3 Ways | Leetcode 1334 | 6,845 | | Threshold
|
185. | Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK | 6,828 | |
|
186. | Maximum Distance in Arrays | Leetcode 624 | codestorywithMIK | 6,824 | |
|
187. | Redundant Connection | DSU | DFS | BFS | Leetcode 684 | codestorywithMIK | 6,809 | | The Redundant
|
188. | Why I Will NEVER Promote Paid DSA Courses! 🚫 The Truth You Need to Know | codestorywithMIK | 6,784 | |
|
189. | Subarray Product Less Than K | Khandani Sliding Window template | Leetcode 713 | codestorywithMIK | 6,779 | |
|
190. | Count Unguarded Cells in the Grid | Simple Explanation | Leetcode 2257 | codestorywithMIK | 6,777 | | The Grid
|
191. | Count Servers that Communicate | 3 Detailed Approaches | Dry Runs | Leetcode 1267 | codestorywithMIK | 6,758 | |
|
192. | Best Sightseeing Pair | 3 Approaches | Detailed For Beginners | Leetcode 1014 | codestorywithMIK | 6,755 | |
|
193. | First Completely Painted Row or Column | 3 Approaches | Detailed | Leetcode 2661 | codestorywithMIK | 6,719 | |
|
194. | Count Complete Subarrays in an Array | Khandani Template | Dry Run | Leetcode 2799 |codestorywithMIK | 6,707 | |
|
195. | Minimum Height Trees | Know Every Detail | Why BFS | GOOGLE | Leetcode 310 | codestorywithMIK | 6,693 | |
|
196. | Minimized Maximum of Products Distributed to Any Store | Leetcode 2064 | codestorywithMIK | 6,691 | |
|
197. | Longest Ideal Subsequence | LIS Variant | Bottom Up | Optimal | Leetcode 2370 | codestorywithMIK | 6,686 | |
|
198. | Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK | 6,676 | |
|
199. | Number of Steps to Reduce a Number in Binary Representation to One | 2 Approaches | Leetcode 1404 | 6,656 | |
|
200. | Count Good Triplets | Simple Approach | Slight Improvements | Leetcode 1534 | codestorywithMIK | 6,644 | |
|