| 101. | Reorder List | 3 Approaches | Leetcode 143 | codestorywithMIK | 39:54 | |
|
| 102. | Generate Parentheses | 2 Approaches | Magic Of Recursion | Recursion Concepts And Questions | 39:44 | |
|
| 103. | CANDY | 2 Approaches | O(1) Space | O(N) Space | AMAZON | Leetcode - 135 | 39:32 | |
|
| 104. | Minimum Cost for Cutting Cake I & II | Thought Process | Leetcode 3218 | 3219 | codestorywithMIK | 39:26 | |
|
| 105. | Longest Common Subsequence-(Microsoft,Amazon,FactSet,MakeMyTrip,Paytm) : Explanation β Live Coding | 39:18 | |
|
| 106. | Single-Threaded CPU (Google) : Explanation β Live Coding π©π»βπ»π¨π»βπ» | 39:01 | |
|
| 107. | Find the City With the Smallest Number of Neighbors at a Threshold Distance | 3 Ways | Leetcode 1334 | 38:58 | | Threshold
|
| 108. | Strongly Connected Components | Kosaraju's Algorithm | Intuition | AMAZON | Graph Concepts & Qns- 38 | 38:45 | |
|
| 109. | Find Edges in Shortest Paths | Dijkstra's Algo | Full Intuition | Leetcode 3123 | codestorywithMIK | 38:31 | |
|
| 110. | Minimum Cost to Cut a Stick | Recur + Memo | Time Complexity | GOOGLE | Leetcode-1547 | Live Code | 38:27 | |
|
| 111. | Sort Items by Groups Respecting Dependencies | Broken into Simple Steps | Intuition | Leetcode-1203 | 38:24 | |
|
| 112. | Image Smoother | 2 Simple Approaches | AMAZON | Leetcode-661 | 38:20 | |
|
| 113. | Number of Wonderful Substrings | Clear Intuition | Full Dry Run | Leetcode 1915 | codestorywithMIK | 38:20 | |
|
| 114. | Data Stream as Disjoint Intervals - (AMAZON) : Explanation β Live Coding | 38:19 | |
|
| 115. | Minimum Window Substring -(Google, Amazon, MakeMyTrip, Microsoft): Explanation β Live Coding π§π»βπ» | 38:06 | |
|
| 116. | Stone Game II | Game Strategy | EASIEST Explanation | META | Leetcode-1140 | Live Code | 38:02 | |
|
| 117. | Restore IP Addresses - (META) : Explanation β Live Coding | 38:01 | |
|
| 118. | Fibonacci Number | Recur + Memo | Bottom Up | DP Concepts & Qns - 2 | Leetcode-509 | 37:58 | |
|
| 119. | New 21 Game | With Maths Logic | GOOGLE | Leetcode-837 | Explanation β Live Coding | 37:53 | |
|
| 120. | Count possible ways to construct buildings | Recursion | Memoization | Bottom UP | GFG POTD | 37:36 | |
|
| 121. | Time Needed to Buy Tickets | 3 Approaches | Leetcode 2073 | codestorywithMIK | 37:29 | |
|
| 122. | Most Profit Assigning Work | Multiple Approaches | With Intuition | Leetcode 826 | codestorywithMIK | 37:27 | |
|
| 123. | Reveal Cards In Increasing Order | 2 Approaches | Leetcode 950 | codestorywithMIK | 37:16 | |
|
| 124. | Minimum Deletions to Make String K-Special | 2 Simple Approaches | Leetcode 3085 | codestorywithMIK | 37:10 | |
|
| 125. | Maximum Value at a Given Index in a Bounded Array | Detailed Explanation | GOOGLE | Leetcode-1802 | 37:08 | |
|
| 126. | Special Array With X Elements Greater Than or Equal X | 3 Approaches |Leetcode 1608|codestorywithMIK | 37:05 | |
|
| 127. | Non-overlapping Intervals | 2 Approaches | Intuition | Dry Run | Leetcode-435 | GOOGLE | Explanation | 37:03 | |
|
| 128. | Comparators in C++ | sort Example | Function Pointer | Functors | Lambda Expressions | 37:02 | |
|
| 129. | Minimum Flips to Make a OR b Equal to c | 2 Approaches | Microsoft | Leetcode-1318 | Explanation | 36:52 | |
|
| 130. | Binary Subarrays With Sum | 2 Approaches | Detailed Explanation | Leetcode 930 | 36:47 | |
|
| 131. | Find Median from Data Stream (Google, Amazon, Microsoft, Meta...) : Explanation β Live Coding | 36:44 | |
|
| 132. | Max Points on a Line -(Google, Apple, LinkedIn, Amazon) : Explanation β Live Coding | 36:43 | |
|
| 133. | Permutations | INTUITIVE | Backtracking Template | Two Ways | Similar Problems | Leetcode-46 | 36:36 | |
|
| 134. | Jump Game - (Google, Microsoft, Amazon, Ebay, Meta) : Explanation β Live Coding | 36:06 | |
|
| 135. | Open the Lock | Why BFS | Similar Pattern Problems | META | Leetcode 752 | codestorywithMIK | 36:06 | |
|
| 136. | Count Subarrays Where Max Element Appears at Least K Times | 2 Approaches | Leetcode 2962 | 36:06 | |
|
| 137. | Palindrome Partitioning | Using Blue Print | DP On Strings | Leetcode 131 | DP Concepts & Qns-27 | 35:55 | |
|
| 138. | Reverse Substrings Between Each Pair of Parentheses | 2 Approaches | Leetcode 1190 |codestorywithMIK | 35:54 | |
|
| 139. | Subarray Sums Divisible by K - (Microsoft, Amazon, Paytm) : Explanation β Live Coding | 35:53 | |
|
| 140. | 3 SUM - (Amazon, Meta, Google) : Explanation β Live Coding π§π»βπ»π©π»βπ» | 35:43 | |
|
| 141. | Merge Sort | Simple Story | Story To Code | Recursion Concepts And Questions | Video 8 | 35:37 | |
|
| 142. | Range Sum of Sorted Subarray Sums | Learning Something New | Leetcode 1508 | codestorywithMIK | 35:31 | |
|
| 143. | Robot Collisions | Made Easy | Dry Run | Leetcode 2751 | codestorywithMIK | 35:30 | |
|
| 144. | Maximum Difference Between Node and Ancestor-(Google, Microsoft, Amazon) : Explanation β Live Coding | 35:23 | |
|
| 145. | Minimum Number of Operations to Make Array Continuous | Brute Force | Optimal | Leetcode - 2009 | 35:18 | |
|
| 146. | Text Justification | Broken into Pieces | GOOGLE | Leetcode-68 | Explanation + Live Coding | 35:17 | |
|
| 147. | Frog Jump | Khandaani Tareeka | Memoization | GOOGLE | AMAZON | META | Leetcode-403 | 35:12 | |
|
| 148. | Subarrays with K Different Integers | Approach-1 | With Reasons | Leetcode 992 | codestorywithMIK | 35:08 | |
|
| 149. | Remove K Digits | Intuition | Dry Run | Leetcode 402 | codestorywithMIK | 35:07 | |
|
| 150. | Reducing Dishes - (MICROSOFT) | Leetcode-1402 | 2 Approaches | Explanation β Live Coding | 35:06 | |
|
| 151. | Successful Pairs of Spells and Potions - (MICROSOFT) | Leetcode-2003 | Explanation β Live Coding | 35:05 | |
|
| 152. | Snapshot Array | Full Thought Process | Microsoft, Amazon | Leetcode-1146 | Live Code | 35:05 | |
|
| 153. | Number of Subsequences That Satisfy the Given Sum Condition | AMAZON | Leetcode - 1498 | Live Coding | 34:54 | |
|
| 154. | Bitwise AND of Numbers Range | 2 Approaches | Dry Run | Leetcode 201 | 34:43 | |
|
| 155. | Scramble String - (GOOGLE) | Leetcode-87 | Explanation β Live Coding | 34:36 | |
|
| 156. | Find the Winner of the Circular Game | 3 Approaches | Leetcode 1823 | codestorywithMIK | 34:34 | |
|
| 157. | Minimum Path Sum - (Google, Ola, Goldman Sachs) | Leetcode-64 | Explanation β Live Coding | 34:34 | |
|
| 158. | Basic Calculator (Google, Meta, Airbnb) : Explanation β Live Coding π§π»βπ»π©π»βπ» | 34:20 | |
|
| 159. | Step-By-Step Directions From a Binary Tree Node to Another | 2 Approaches | Leetcode 2096 | 34:05 | |
|
| 160. | Minimum Deletions to Make String Balanced | Multiple Approaches | Leetcode 1653 | codestorywithMIK | 34:00 | |
|
| 161. | Earliest Possible Day of Full Bloom(Google, Amazon, Microsoft, Adobe):Explanation β Live Coding | 33:57 | |
|
| 162. | Find Eventual Safe States | 2 Approaches | Intuition | Leetcode-802 | MICROSOFT | Explanation | 33:54 | |
|
| 163. | Number of Longest Increasing Subsequence | Using LIS | Full Dry Run | META | Leetcode-673 | 33:49 | |
|
| 164. | Path With Minimum Effort | Leetcode-1631 | Dijkstra in 2-D Matrix |GOOGLE |Graph Concepts & Qns - 30 | 33:49 | |
|
| 165. | Knight Dialer | Recursion Memoization | Bottom Up DP | Google | Dropbox | Leetcode 935 | 33:47 | |
|
| 166. | Longest Subarray of 1's After Deleting One Element | Multiple Approaches | GOOGLE | Leetcode-1493 | 33:30 | |
|
| 167. | Minimize Maximum of Array - (META) | Leetcode-2439 | Explanation β Live Coding π§π»βπ»π©π»βπ» | 33:24 | |
|
| 168. | Euler Path | Euler Circuit | PART-1 | Graph Concepts & Qns - 40 | Explanation+Code | 33:23 | |
|
| 169. | First Missing Positive | In Depth Intuition | Clean Code | Leetcode 41 | codestorywithMIK | 33:16 | |
|
| 170. | Flip String to Monotone Increasing - (GOOGLE) | Recursion+Memo | Explanation β Live Coding | 33:12 | |
|
| 171. | Longest Subsequence With Limited Sum : Explanation β Live Codingπ©π»βπ»π§π»βπ»π€―π± | 33:11 | |
|
| 172. | Print Longest Common Subsequence | DP On Strings | DP Concepts & Qns-19 | 33:06 | |
|
| 173. | Poor Pigs | Maths | With Intuition | Clear Explanation | Leetcode - 458 | 33:06 | |
|
| 174. | Maximum Value of K Coins From Piles - (META) | Leetcode-2218 | Explanation β Live Coding | 33:00 | |
|
| 175. | Most Stones Removed with Same Row or Column -(Asked by Google) : Explanation β Live Coding | 32:50 | |
|
| 176. | Tallest Billboard | Recur + Memo | Tree Diagram | GOOGLE | Leetcode-956 | Live Code | 32:50 | |
|
| 177. | Count Number of Nice Subarrays | 2 Approaches | Similar Concept | Leetcode 1248 | codestorywithMIK | 32:49 | |
|
| 178. | Find All Groups of Farmland | DFS | BFS | Brute Force | Leetcode 1992 | codestorywithMIK | 32:38 | |
|
| 179. | Binary Trees With Factors | Easy Intuition | Dry Run | GOOGLE | Leetcode - 823 | 32:32 | |
|
| 180. | Water the plants | Intuition Explained | Similar Problem | GfG POTD | 32:30 | |
|
| 181. | Longest Arithmetic Subsequence of Given Difference | Recur + Memo | Optimal | META | Leetcode-1218 | 32:28 | |
|
| 182. | Longest Increasing Subsequence | Recursion & Memo |Tree Diagram |DP Concepts & Qns-11 | Leetcode-300 | 32:27 | |
|
| 183. | Longest Cycle in a Graph | Leetcode - 2360 | DFS | Explanation β Live Coding Trash | 32:26 | |
|
| 184. | Checking Existence of Edge Length Limited Paths | Leetcode - 1697 | DSU | GOOGLE | Explanation | 32:17 | |
|
| 185. | Build Array Where You Can Find The Maximum Exactly K Comparisons |DP Concepts & Qns-14|Leetcode-1420 | 32:12 | |
|
| 186. | Median of Two Sorted Arrays | PART-1 | Brute Force | Better Approach | Google | Apple | Leetcode - 4 | 32:09 | |
|
| 187. | Design Web Crawler (Part-VI) : Google, Amazon, Meta : STEP-3 : Design Deep Dive Complete & WRAP-UP | 32:04 | |
|
| 188. | Patching Array | Thought Process | Dry Runs | GOOGLE | Leetcode 330 | codestorywithMIK | 32:02 | |
|
| 189. | Minimum Operations to Reduce X to Zero | 2 Approaches | Recursion | Hashmap | Leetcode - 1658 | 31:59 | |
|
| 190. | Most Frequent IDs | Complete Intuition | Leetcode 3092 | codestorywithMIK | 31:58 | |
|
| 191. | Number of Steps to Reduce a Number in Binary Representation to One | 2 Approaches | Leetcode 1404 | 31:58 | |
|
| 192. | Sliding Window Maximum | Monotonic Deque | INTUITIVE | GOOGLE | Leetcode-239 | Dry Run | 31:54 | |
|
| 193. | Cheapest Flights Within K Stops | GOOGLE | BFS | Explanation β Live Coding | 31:54 | |
|
| 194. | Count the Number of Houses at a Certain Distance I | Why Graph | Leetcode 3015 | Weekly Contest | 31:52 | |
|
| 195. | String Compression II | Recursion | 2-D Memoization | Leetcode 1531 | 31:49 | |
|
| 196. | Majority Element I | Majority Element II : Boyer-Moore | Made Simple | Leetcode - 229 and 169 | 31:49 | |
|
| 197. | Diagonal Traverse II | 2 Approaches | Map | BFS | GOOGLE | Leetcode-1424 | 31:45 | |
|
| 198. | Is Graph Bipartite ? - (Meta, Microsoft..) | DFS | Graph Concepts & Qns - 16 | Explanation+Coding | 31:40 | |
|
| 199. | 132 Pattern | Intuition explained | Brute Force | Better | Optimal | META | AMAZON | Leetcode - 456 | 31:37 | |
|
| 200. | Minimum Difference Between Largest and Smallest Value in Three Moves | 2 Approaches | Leetcode 1509 | 31:36 | |
|
