| 101. | Minimum Number of Operations to Make Array Empty | Explained with Reasons | Greedy | Leetcode 2870 | 232 | |
|
| 102. | Minimum Number of Operations to Make Array XOR Equal to K | Easy | Leetcode 2997 | codestorywithMIK | 230 | |
|
| 103. | Reorder List | 3 Approaches | Leetcode 143 | codestorywithMIK | 226 | |
|
| 104. | Intersection of Two Arrays II | 2 Approaches | Easy Explanations | Leetcode 350 | codestorywithMIK | 233 | |
|
| 105. | Minimum Difference Between Largest and Smallest Value in Three Moves | 2 Approaches | Leetcode 1509 | 380 | |
|
| 106. | Average Waiting Time | Simple Simulation | Leetcode 1701 | codestorywithMIK | 229 | |
|
| 107. | Predict the Winner | Two Recursive Approaches | Memoization | Game Strategy | AMAZON | Leetcode-486 | 211 | |
|
| 108. | Decode Ways | Recursion | Memo | Bottom Up | Leetcode 91 | 225 | |
|
| 109. | Word Break | Tree Diagram | Recursion | Memoization | Similar Problems | Leetcode-139 | 207 | |
|
| 110. | K-th Symbol in Grammar | Recursion | Recurrence Relation Explained | GOOGLE | Leetcode - 779 | 209 | |
|
| 111. | Relatable ? 🥹 #codestorywithmik | 248 | |
|
| 112. | Restore the Array From Adjacent Pairs | Easy Explanation | Dry Run | Intuition | Leetcode-1743 | 209 | |
|
| 113. | Longest Palindromic Substring | Recursion | Memoization | Microsoft | Leetcode - 5 | 224 | |
|
| 114. | Remove Nodes From Linked List | 3 Detailed Approaches | Story | Leetcode 2487 | codestorywithMIK | 219 | |
|
| 115. | Minimum Replacements to Sort the Array | Cleanest Code | Full Dry Run | GOOGLE | Leetcode - 2366 | 200 | |
|
| 116. | Minimum Length of String After Deleting Similar Ends | Simple Two Pointers | Leetcode 1750 | 207 | |
|
| 117. | Poor Pigs | Maths | With Intuition | Clear Explanation | Leetcode - 458 | 231 | |
|
| 118. | Balance a Binary Search Tree | Simple Explanation | Leetcode 1382 | codestorywithMIK | 343 | |
|
| 119. | Painting the Walls | Why Greedy Fails | Recursion | Memoization | GOOGLE | Leetcode - 2742 | 197 | |
|
| 120. | Find the Winner of an Array Game | Simulation | Easy Explanation | GOOGLE | Leetcode - 1535 | 211 | |
|
| 121. | Subarrays with K Different Integers | Approach-2 | One Pass | Leetcode 992 | codestorywithMIK | 213 | |
|
| 122. | Reconstruct Itinerary | Clean | Simple | Intuitive | GOOGLE | Leetcode-332 | Live Code | 194 | |
|
| 123. | Maximum Score of a Good Subarray | GREEDY | INTUITION | AMAZON | Leetcode - 1793 | 193 | |
|
| 124. | Find Mode in Binary Search Tree | 2 Approaches | Follow Up | Leetcode-501 | GOOGLE | 198 | |
|
| 125. | Largest Submatrix With Rearrangements | Build Intuition | 3 Approaches | Leetcode 1727 | 209 | |
|
| 126. | Minimum One Bit Operations to Make Integers Zero | Detailed Explanation | LinkedIn | Leetcode 1611 | 191 | |
|
| 127. | Minimum Falling Path Sum II | 4 Approaches | Detailed Dry Run | Leetcode 1289 | codestorywithMIK | 200 | |
|
| 128. | Find Bottom Left Tree Value | 3 Approaches | Simple Story | Microsoft | Leetcode 513 | 191 | |
|
| 129. | Integer Break | Tree Diagram | Recursion | Memoization | AMAZON | Leetcode - 343 | 186 | |
|
| 130. | Sum of Absolute Differences in a Sorted Array | Build Intuition | 2 Approaches | Leetcode - 1685 | 190 | |
|
| 131. | Validate Binary Tree Nodes | Using Binary Tree Properties | BFS | META | Leetcode - 1361 | 185 | |
|
| 132. | Diagonal Traverse II | 2 Approaches | Map | BFS | GOOGLE | Leetcode-1424 | 195 | |
|
| 133. | Minimize the Maximum Difference of Pairs | Binary Search Pattern | INTUITION | META | Leetcode-2616 | 184 | |
|
| 134. | Convert an Array Into a 2D Array With Conditions | With Dry Run | Leetcode 2610 | 195 | |
|
| 135. | Find Polygon With the Largest Perimeter | Thought Process | Greedy | Leetcode 2971 | 189 | |
|
| 136. | Strange Printer | INTUITIVE | Recursion | Memoization | NetEase | Leetcode-664 | 183 | |
|
| 137. | Fair Distribution of Cookies | Khandani Backtracking Template | Leetcode-2305 | Explanation + Coding | 183 | |
|
| 138. | Copy List with Random Pointer | 2 Approaches | Clear Intuition | Dry Run | Microsoft| Leetcode - 138 | 181 | |
|
| 139. | Count Nice Pairs in an Array | Simple Clean | Important suggestion | AMAZON | Leetcode-1814 | 184 | |
|
| 140. | Find the Duplicate Number | With Proof | Follow Up Qns | Hare And Tortoise | AMAZON | Leetcode - 287 | 179 | |
|
| 141. | Minimum Number of Moves to Seat Everyone | Counting Sort | Sort | Leetcode 2037 | codestorywithMIK | 194 | |
|
| 142. | Split Linked List in Parts | Clean | Simple Code | Dry Run | Amazon | Leetcode - 725 | 178 | |
|
| 143. | Buddy Strings | GOOGLE | META | Leetcode-859 | Explanation ➕ Live Coding | 178 | |
|
| 144. | Determine if a Cell Is Reachable at a Given Time | Intuition | Math | Leetcode - 2849 | 185 | |
|
| 145. | Eliminate Maximum Number of Monsters | Intuition | GOOGLE | META | AMAZON | Leetcode - 1921 | 179 | |
|
| 146. | Pass the Pillow | 2 Approaches | Easy Explanations | Leetcode 2582 | codestorywithMIK | 217 | |
|
| 147. | Minimum Time to Collect All Apples in a Tree - (Microsoft) : Explanation ➕ Live Coding | 173 | |
|
| 148. | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Broken in Steps | Leetcode-1489 | 173 | |
|
| 149. | Relative Ranks | 3 Approaches | Leetcode 506 | codestorywithMIK | 179 | |
|
| 150. | Find The Original Array of Prefix Xor | XOR Properties | Microsoft | Leetcode - 2433 | 173 | |
|
| 151. | Find All People With Secret | 4 Approaches | Google | Leetcode 2092 | 258 | |
|
| 152. | I Tell Stories ⚡️ #story #code #storytocode #codestorywithMIK #dsa #india #leetcode #datastructures | 172 | |
|
| 153. | Minimum Changes To Make Alternating Binary String | 2 Approaches | MICROSOFT | Leetcode 1758 | 174 | |
|
| 154. | CANDY | 2 Approaches | O(1) Space | O(N) Space | AMAZON | Leetcode - 135 | 172 | |
|
| 155. | Make Two Arrays Equal by Reversing Subarrays | Easy | Leetcode 1460 | codestorywithMIK | 180 | |
|
| 156. | Minimum Operations to Reduce X to Zero | 2 Approaches | Recursion | Hashmap | Leetcode - 1658 | 171 | |
|
| 157. | Maximum Length of a Concatenated String with Unique Characters | Using Bit Magic | Leetcode 1239 | 201 | |
|
| 158. | Sort Items by Groups Respecting Dependencies | Broken into Simple Steps | Intuition | Leetcode-1203 | 168 | |
|
| 159. | Maximal Network Rank | Simple and Straight | 2 Ways | MICROSOFT | Leetcode-239 | Dry Run | Live Code | 168 | |
|
| 160. | Sort Integers by The Number of 1 Bits | 2 Approaches | AMAZON | Leetcode - 1356 | 172 | |
|
| 161. | Knight Dialer | Recursion Memoization | Bottom Up DP | Google | Dropbox | Leetcode 935 | 184 | |
|
| 162. | Text Justification | Broken into Pieces | GOOGLE | Leetcode-68 | Explanation + Live Coding | 166 | |
|
| 163. | Find Unique Binary String | Multiple Approaches | Intuition | AMAZON | META | GOOGLE | Leetcode-1980 | 191 | |
|
| 164. | Sequential Digits | 2 Approaches | Leetcode 1291 | 252 | |
|
| 165. | Number of Flowers in Full Bloom | Brute Force | Optimal Approach | Binary Search | Leetcode - 2251 | 165 | |
|
| 166. | All Possible Full Binary Trees | Recursion Tree | Memoization | GOOGLE | AMAZON | Leetcode-894 | 164 | |
|
| 167. | Reorganize String | 2 Approaches | Time Complexity | Full Dry Run | TESLA | AMAZON | Leetcode-767 | 163 | |
|
| 168. | Interleaving String | Khandaani Tareeka | Memoization | GOOGLE | Leetcode-97 | 163 | |
|
| 169. | Length of Last Word | 2 Ways | Leetcode 58 | Amazon | codestorywithMIK | 166 | |
|
| 170. | Remove Colored Pieces if Both Neighbors are the Same Color | Intuitive | GOOGLE | Leetcode - 2038 | 163 | |
|
| 171. | Number of Islands | DFS | BFS | Same as Island Perimeter | Leetcode 200 | codestorywithMIK | 169 | |
|
| 172. | Count Vowels Permutation | Recursion | Memoization | Bottom Up | GOOGLE | META | Leetcode - 1220 | 165 | |
|
| 173. | Parallel Courses III | Topological Sorting | Intuition | Dry Run | UBER | Leetcode - 2050 | 162 | Vlog |
|
| 174. | Find the Pivot Integer | 5 Approaches | Easy Explanation | Leetcode 2485 | 172 | |
|
| 175. | Image Smoother | 2 Simple Approaches | AMAZON | Leetcode-661 | 175 | |
|
| 176. | Unique Binary Search Trees II | Similar Problem | Recursion | Memoization | Amazon | Leetcode-95 | 161 | |
|
| 177. | Even Odd Tree | DFS | BFS | Leetcode 1609 | 174 | |
|
| 178. | Sliding Window Maximum | Monotonic Deque | INTUITIVE | GOOGLE | Leetcode-239 | Dry Run | 160 | |
|
| 179. | Minimum Operations to Make Array Equal to Target | Minimum Number of Increments|Leetcode 3229 & 1526 | 184 | |
|
| 180. | Bus Routes | Dry Run | Intuition | UBER | Leetcode-815 | 185 | |
|
| 181. | Minimum Deletions to Make Character Frequencies Unique | 2 Approaches | MICROSOFT | Leetcode - 1647 | 158 | |
|
| 182. | Check if There is a Valid Partition For The Array | Recursion | Memoization | GOOGLE | Leetcode-2369 | 158 | |
|
| 183. | How I spent my Birthday 😇❤️🎂 | 283 | |
|
| 184. | Replace Words | Using TRIE | Uber | Leetcode 648 | codestorywithMIK | 178 | |
|
| 185. | Maximum Score After Splitting a String | 3 Approaches | Leetcode 1422 | 157 | |
|
| 186. | Maximum Odd Binary Number | 2 Approaches | Leetcode 2864 | 160 | |
|
| 187. | Flatten Nested List Iterator | 3 Approaches | Full Details | GOOGLE | NETFLIX | Leetcode - 341 | 155 | |
|
| 188. | Minimum Speed to Arrive on Time | Binary Search | INTUITION | Online Assessment | Leetcode-1870 | 155 | |
|
| 189. | Partition List | Made Super Easy | MICROSOFT | Leetcode-86 | Dry Run | Live Code | 155 | |
|
| 190. | Thank you from the bottom of my heart ❤️ #consistency #bonding #friends #friendship #trust | 155 | |
|
| 191. | Arithmetic Subarrays | 2 Approaches | Sorting | Without Sorting | Leetcode-1630 | 159 | |
|
| 192. | Merge In Between Linked Lists | Easy Straight Forward | AMAZON | Leetcode 1669 | codestorywithMIK | 160 | |
|
| 193. | Find in Mountain Array | Binary Search | Using Same Code | AMAZON | Leetcode - 1095 | 153 | |
|
| 194. | Find All Groups of Farmland | DFS | BFS | Brute Force | Leetcode 1992 | codestorywithMIK | 181 | |
|
| 195. | Group the People Given the Group Size They Belong To | Dry Run | LYFT | Leetcode - 1282 | 152 | |
|
| 196. | Path Crossing | Leetcode 1496 | 155 | |
|
| 197. | Minimum Increment to Make Array Unique | Sorting | Counting Sort | Leetcode 945 | codestorywithMIK | 254 | |
|
| 198. | Longest Subarray of 1's After Deleting One Element | Multiple Approaches | GOOGLE | Leetcode-1493 | 151 | |
|
| 199. | Seat Reservation Manager | 3 Ways | Intuition | META | Leetcode - 1845 | 156 | |
|
| 200. | Divide Array Into Arrays With Max Difference| Why Sorting | Google | Leetcode 2966 | 162 | |
|
