| 101. | Find in Mountain Array | Binary Search | Using Same Code | AMAZON | Leetcode - 1095 | 78 | |
|
| 102. | Spiral Matrix III | Simple Simulation | Made Easy | Leetcode 885 | codestorywithMIK | 77 | |
|
| 103. | Check if There is a Valid Partition For The Array | Recursion | Memoization | GOOGLE | Leetcode-2369 | 77 | |
|
| 104. | Non-decreasing Subsequences -(Khaandani Backtracking Template) : Explanation ➕ Live Coding | 77 | |
|
| 105. | Find the Duplicate Number | With Proof | Follow Up Qns | Hare And Tortoise | AMAZON | Leetcode - 287 | 77 | |
|
| 106. | K-th Smallest in Lexicographical Order | Super Detailed | Dry Run | Leetcode 440 | codestorywithMIK | 76 | |
|
| 107. | Open the Lock | Why BFS | Similar Pattern Problems | META | Leetcode 752 | codestorywithMIK | 76 | |
|
| 108. | Knight Probability in Chessboard | Recursion | Memoization | AMAZON | DIRECTi | Leetcode-688 | 76 | |
|
| 109. | Flip String to Monotone Increasing - (GOOGLE) | Recursion+Memo | Explanation ➕ Live Coding | 76 | |
|
| 110. | Step-By-Step Directions From a Binary Tree Node to Another | 2 Approaches | Leetcode 2096 | 76 | |
|
| 111. | Minimum Number of Days to Make m Bouquets | Simple Thought Process| Leetcode 1482 | codestorywithMIK | 76 | |
|
| 112. | Magnetic Force Between Two Balls | Simple Thought Process | Leetcode 1552 | codestorywithMIK | 75 | |
|
| 113. | Validate Binary Tree Nodes | Using Binary Tree Properties | BFS | META | Leetcode - 1361 | 75 | |
|
| 114. | Maximum Sum Circular Subarray (Microsoft, Amazon) : Explanation ➕ Live Coding | 75 | |
|
| 115. | Put Marbles in Bags | Full Intuition | Dry Run | Leetcode-2551 | AMAZON | Explanation ➕ Live Coding | 75 | |
|
| 116. | Minimum Operations to Reduce X to Zero | 2 Approaches | Recursion | Hashmap | Leetcode - 1658 | 75 | |
|
| 117. | Maximum Score From Removing Substrings | 2 Approaches | With Proof | Leetcode 1717 | 74 | |
|
| 118. | Repeated Substring Pattern | Full Intuition | Time Complexity | GOOGLE | AMAZON | Leetcode-459 | 74 | |
|
| 119. | Partition Array for Maximum Sum | Why DP | Recursion | Memo | Bottom Up | Leetcode 1043 | 74 | |
|
| 120. | Find the Student that Will Replace the Chalk | 2 Ways | Leetcode 1894 | codestorywithMIK | 74 | |
|
| 121. | String Compression II | Recursion | Memo | Leetcode 1531 | 74 | |
|
| 122. | Number of Laser Beams in a Bank | Clear Explanation | Dry Run | Amazon | Leetcode 2125 | 74 | |
|
| 123. | Count Number of Nice Subarrays | 2 Approaches | Similar Concept | Leetcode 1248 | codestorywithMIK | 74 | |
|
| 124. | Student Attendance Record II | Recursion | Memoization | Bottom Up | Leetcode 552 | codestorywithMIK | 73 | |
|
| 125. | Buddy Strings | GOOGLE | META | Leetcode-859 | Explanation ➕ Live Coding | 73 | |
|
| 126. | Number of Longest Increasing Subsequence | Using LIS | Full Dry Run | META | Leetcode-673 | 73 | |
|
| 127. | Minimum Height Trees | Know Every Detail | Why BFS | GOOGLE | Leetcode 310 | codestorywithMIK | 73 | |
|
| 128. | DSA Sheet-1 Announcement | More To Come Soon | Stay Tuned | 73 | |
|
| 129. | Non-overlapping Intervals | 2 Approaches | Intuition | Dry Run | Leetcode-435 | GOOGLE | Explanation | 72 | |
|
| 130. | Soup Servings | INTUITIVE | Recursion | Memoization | GOOGLE | Leetcode-808 | 72 | |
|
| 131. | Minimum Time Difference | Easy Approach | Detailed | Leetcode 539 | codestorywithMIK | 72 | |
|
| 132. | Kth Largest Element in an Array | Heap | Sorting | 2 Approaches | Time Complexity | Leetcode-215 | 72 | |
|
| 133. | Number of Ways of Cutting a Pizza - (Google, TikTok) | Leetcode-1444 | Explanation ➕ Live Coding | 72 | |
|
| 134. | Different Ways to Add Parentheses | Simple Story To Code | Leetcode 241 | codestorywithMIK | 71 | |
|
| 135. | Binary Tree Maximum Path Sum - (Google, Meta, Amazon, Flipkart) : Explanation ➕ Live Coding | 71 | |
|
| 136. | Maximum Length of Pair Chain | Same as LIS | FULL INTUITION | DP Concepts & Qns - 13 | Leetcode-646 | 71 | |
|
| 137. | Maximum Score of a Good Subarray | GREEDY | INTUITION | AMAZON | Leetcode - 1793 | 70 | |
|
| 138. | K-th Symbol in Grammar | Recursion | Recurrence Relation Explained | GOOGLE | Leetcode - 779 | 70 | |
|
| 139. | Number of Flowers in Full Bloom | Brute Force | Optimal Approach | Binary Search | Leetcode - 2251 | 70 | |
|
| 140. | Minimum Cost to Make Array Equal | Simplest Solution | MICROSOFT | Leetcode-2448 | Explanation | 70 | |
|
| 141. | Minimum Number of Operations to Make Array Continuous | Brute Force | Optimal | Leetcode - 2009 | 70 | |
|
| 142. | Sort Integers by The Number of 1 Bits | 2 Approaches | AMAZON | Leetcode - 1356 | 70 | |
|
| 143. | Snakes and Ladders - (Microsoft, Amazon, Adobe..) : Explanation ➕ Live Coding | 69 | |
|
| 144. | Frequency of the Most Frequent Element | Binary Search | Sliding Window | META | Leetcode-1838 | 69 | |
|
| 145. | Minimum Number of Days to Disconnect Island | Studied Concept | Leetcode 1568 | codestorywithMIK | 69 | |
|
| 146. | Combination Sum IV | 2 Ways | DRY RUN | Tree Diagram | GOOGLE | SNAPCHAT | META | Leetcode - 377 | 69 | |
|
| 147. | Partition List | Made Super Easy | MICROSOFT | Leetcode-86 | Dry Run | Live Code | 69 | |
|
| 148. | Bitwise AND of Numbers Range | 2 Approaches | Dry Run | Leetcode 201 | 69 | |
|
| 149. | Unique Paths II | Made Super Easy | Recursion | Memoization | 2D Array | AMAZON | Leetcode-63 | 69 | |
|
| 150. | Minimum One Bit Operations to Make Integers Zero | Detailed Explanation | LinkedIn | Leetcode 1611 | 68 | |
|
| 151. | Parallel Courses III | Topological Sorting | Intuition | Dry Run | UBER | Leetcode - 2050 | 68 | Vlog |
|
| 152. | My Calendar I | Detailed Approach | Leetcode 729 | codestorywithMIK | 68 | |
|
| 153. | 01 Matrix | Detailed Dry Run | Why BFS from 0s | GOOGLE | Leetcode - 542 | 68 | |
|
| 154. | Pow(x, n) | Reasoning | Dry Run | LINKEDIN | AMAZON | Leetcode-50 | Live Code + Explanation | 68 | |
|
| 155. | Tallest Billboard | Recur + Memo | Tree Diagram | GOOGLE | Leetcode-956 | Live Code | 68 | |
|
| 156. | Excel Sheet Column Title | Made it simple | Dry Run | Leetcode-168 | Meta | Microsoft | Explanation | 68 | |
|
| 157. | Valid Parenthesis String | 4 Detailed Approaches | Leetcode 678 | codestorywithMIK | 67 | |
|
| 158. | Number of Subsequences That Satisfy the Given Sum Condition | AMAZON | Leetcode - 1498 | Live Coding | 67 | |
|
| 159. | Maximize Score After N Operations | BRUTE FORCE To OPTIMAL | META | Leetcode-1799 | Live Code | 66 | |
|
| 160. | Count Sub Islands | Easiest Thought Process | Leetcode 1905 | codestorywithMIK | 66 | | Counter-Strike: Source
|
| 161. | Longest Subarray With Maximum Bitwise AND | Simple Observation | Leetcode 2419 | codestorywithMIK | 66 | |
|
| 162. | Minimum Increment to Make Array Unique | Sorting | Counting Sort | Leetcode 945 | codestorywithMIK | 66 | |
|
| 163. | Maximum Number That Sum of the Prices Is Less Than or Equal to K |Brute Force |Optimal |Contest 380 | 66 | |
|
| 164. | Number of Ways to Reorder Array to Get Same BST | Pascal's triangle | GOOGLE | Leetcode-1569 | 65 | |
|
| 165. | Restore The Array - (GOOGLE, MICROSOFT) | Recur+Memo | Leetcode-1416 | Live Code + Explanation | 65 | |
|
| 166. | Largest Color Value in a Directed Graph | Leetcode - 1857 | META | Explanation ➕ Live Coding Trash | 65 | |
|
| 167. | Lexicographically Smallest Equivalent String | DFS | Explanation ➕ Live Coding | 65 | |
|
| 168. | Bus Routes | Dry Run | Intuition | UBER | Leetcode-815 | 65 | |
|
| 169. | Min Cost Climbing Stairs | Bottom Up | Recursion | Memoization | GOOGLE | Leetcode - 746 | 64 | |
|
| 170. | Find Unique Binary String | Multiple Approaches | Intuition | AMAZON | META | GOOGLE | Leetcode-1980 | 64 | |
|
| 171. | Find the Winner of the Circular Game | 3 Approaches | Leetcode 1823 | codestorywithMIK | 64 | |
|
| 172. | The K Weakest Rows in a Matrix | 2 Approaches | Binary Search | Heap | Sorting | Leetcode - 1337 | 64 | |
|
| 173. | Combination Sum II | Simple Khandani Template | Leetcode 40 | codestorywithMIK | 64 | |
|
| 174. | Count Nice Pairs in an Array | Simple Clean | Important suggestion | AMAZON | Leetcode-1814 | 63 | |
|
| 175. | Find the Winner of an Array Game | Simulation | Easy Explanation | GOOGLE | Leetcode - 1535 | 63 | |
|
| 176. | LRU Cache - (Adobe, Microsoft, Amazon, Twitch...):Explanation➕Live Coding | 63 | |
|
| 177. | Lexicographical Numbers | Simple DFS | Leetcode 386 | codestorywithMIK | 63 | |
|
| 178. | Knuth-Morris-Pratt KMP String Matching Algorithm | Search Pattern | GFG POTD | 63 | |
|
| 179. | Reverse Substrings Between Each Pair of Parentheses | 2 Approaches | Leetcode 1190 |codestorywithMIK | 63 | |
|
| 180. | Largest Divisible Subset | LIS Variant | DP Concepts & Qns-18 | Leetcode-368 | 62 | |
|
| 181. | Count Subarrays Where Max Element Appears at Least K Times | 2 Approaches | Leetcode 2962 | 62 | |
|
| 182. | CANDY | 2 Approaches | O(1) Space | O(N) Space | AMAZON | Leetcode - 135 | 62 | |
|
| 183. | Sum of Prefix Scores of Strings | Trie | Full Easy Dry Run | Leetcode 2416 | codestorywithMIK | 62 | |
|
| 184. | Reorganize String | 2 Approaches | Time Complexity | Full Dry Run | TESLA | AMAZON | Leetcode-767 | 62 | |
|
| 185. | Construct Quad Tree (Leetcode - 427) - (Google) : Explanation ➕ Live Coding | 62 | |
|
| 186. | Special Array With X Elements Greater Than or Equal X | 3 Approaches |Leetcode 1608|codestorywithMIK | 62 | |
|
| 187. | Longest Subarray of 1's After Deleting One Element | Multiple Approaches | GOOGLE | Leetcode-1493 | 62 | |
|
| 188. | Greatest Common Divisor Traversal | Why Graph | Why DSU | Google | Leetcode 2709 | 61 | |
|
| 189. | Amount of Time for Binary Tree to Be Infected | Using BFS | Leetcode 2385 | 61 | |
|
| 190. | Best Time to Buy and Sell Stock with Transaction Fee | Recur + Memo | META | Leetcode-714 | 61 | |
|
| 191. | Shortest Palindrome | Multiple Ways | KMP Zindabaad | Leetcode 214 | codestorywithMIK | 61 | |
|
| 192. | Make Array Strictly Increasing | Recur + Memo | Time Complexity | GOOGLE | Leetcode-1187 | Live Code | 61 | |
|
| 193. | Profitable Schemes - (AMAZON) | Recur+Memo | Leetcode-879 | Live Code + Explanation | 61 | |
|
| 194. | Longest Cycle in a Graph | Leetcode - 2360 | DFS | Explanation ➕ Live Coding Trash | 60 | |
|
| 195. | Find All Groups of Farmland | DFS | BFS | Brute Force | Leetcode 1992 | codestorywithMIK | 60 | |
|
| 196. | Longest String Chain | Same as LIS | FULL INTUITION | DP Concepts & Qns - 14 | Leetcode-1048 | 60 | |
|
| 197. | Peak Index in a Mountain Array | Binary Search | DRY RUN | GOOGLE | Leetcode-852 | 60 | |
|
| 198. | Reveal Cards In Increasing Order | 2 Approaches | Leetcode 950 | codestorywithMIK | 60 | |
|
| 199. | Maximum Width Ramp | Brute Force | Better | Optimal | Leetcode 962 | codestorywithMIK | 60 | | Brute Force
|
| 200. | Jump Game IV - (Leetcode - 1345) - (Google, Microsoft, Adobe, Amazon) : Explanation ➕ Live Coding | 59 | |
|
