| 201. | One Love = CODING β€οΈπ¨π»βπ» | 216 | |
|
| 202. | Combinations | INTUITIVE | Backtracking Template | Two Ways | Similar Problems | Leetcode-77 | 150 | |
|
| 203. | Majority Element I | Majority Element II : Boyer-Moore | Made Simple | Leetcode - 229 and 169 | 150 | |
|
| 204. | Reduction Operations to Make the Array Elements Equal | Intuition | Leetcode-1887 | 167 | |
|
| 205. | Count Number of Homogenous Substrings | Intuition | Math | Leetcode - 1759 | 153 | |
|
| 206. | Intersection of Two Arrays | 4 Approaches | Leetcode 349 | 152 | |
|
| 207. | Number of Ways to Stay in the Same Place After Some Steps | Recursion | Memoization | Leetcode- 1269 | 147 | |
|
| 208. | Water the plants | Intuition Explained | Similar Problem | GfG POTD | 173 | |
|
| 209. | Frog Jump | Khandaani Tareeka | Memoization | GOOGLE | AMAZON | META | Leetcode-403 | 147 | |
|
| 210. | Robot Collisions | Made Easy | Dry Run | Leetcode 2751 | codestorywithMIK | 328 | |
|
| 211. | Excel Sheet Column Title | Made it simple | Dry Run | Leetcode-168 | Meta | Microsoft | Explanation | 147 | |
|
| 212. | Max Dot Product of Two Subsequences | Recursion | Memoization | AMAZON | Leetcode - 1458 | 147 | |
|
| 213. | Minimize Maximum Pair Sum in Array | Clear Intuition | Similar Problems | AMAZON | Leetcode-1877 | 149 | |
|
| 214. | Promise from a coder to coder πͺπ©π»βπ»π¨π»βπ» | 144 | |
|
| 215. | Minimum ASCII Delete Sum for Two Strings | INTUITIVE | Recursion | Memoization | Leetcode-712 | 144 | |
|
| 216. | Count Nodes Equal to Average of Subtree | 2 Approaches | Leetcode-2265 | Explanation β Live Coding | 153 | |
|
| 217. | Minimum Time Visiting All Points | Diagram Explanation | Maths Explained | Media.net | Leetcode 1266 | 144 | |
|
| 218. | Substring With Largest Variance | Full Dry Run | Leetcode-2272 | AMAZON, GOOGLE | Explanation | 142 | |
|
| 219. | Construct String from Binary Tree | Amazon | Leetcode 606 | 146 | |
|
| 220. | Tallest Billboard | Recur + Memo | Tree Diagram | GOOGLE | Leetcode-956 | Live Code | 141 | |
|
| 221. | Longest String Chain | Same as LIS | FULL INTUITION | DP Concepts & Qns - 14 | Leetcode-1048 | 141 | |
|
| 222. | Minimum Number of Steps to Make Two Strings Anagram | Simple | Intuitive | Google | Leetcode 1347 | 151 | |
|
| 223. | Consistency is the π #hardwork #consistencyiskey #consistency #motivation #leetcode #coding | 140 | |
|
| 224. | Maximum Number of Coins You Can Get | Greedy | 2 Approaches | Leetcode - 1561 | 147 | |
|
| 225. | Power of Four | 3 Approaches | Maths | With Proof | Bit Magic | Leetcode - 342 | 141 | |
|
| 226. | Smallest Sufficient Team | Recur + Memo | Bit Manipulation Made Easy | AMAZON | Leetcode-1125 | 139 | |
|
| 227. | Remove Nth Node From End of List | 1 Pass | 2 Pass | Leetcode 19 | 149 | |
|
| 228. | Find Words That Can Be Formed by Characters | META | Leetcode 1160 | 139 | |
|
| 229. | Combination Sum IV | 2 Ways | DRY RUN | Tree Diagram | GOOGLE | SNAPCHAT | META | Leetcode - 377 | 138 | |
|
| 230. | Put Marbles in Bags | Full Intuition | Dry Run | Leetcode-2551 | AMAZON | Explanation β Live Coding | 138 | |
|
| 231. | Reverse Linked List II | Clean | Simple Code | Dry Run | MICROSOFT | Leetcode - 92 | 137 | |
|
| 232. | Redistribute Characters to Make All Strings Equal | 3 Ways | C++ | JAVA | Leetcode 1897 | 144 | |
|
| 233. | Largest Positive Integer That Exists With Its Negative |4 Approaches|Leetcode 2441 |codestorywithMIK | 146 | |
|
| 234. | Maximum Running Time of N Computers | Binary Search | INTUITION | Dry Run | GOOGLE | Leetcode-2141 | 136 | |
|
| 235. | Maximize the Confusion of an Exam | 3 Approaches | MICROSOFT | Leetcode-2024 | Explanation | 136 | |
|
| 236. | Subarray Sums Divisible by K - (Microsoft, Amazon, Paytm) : Explanation β Live Coding | 136 | |
|
| 237. | Number of 1 Bits | 4 Approaches | Time Complexity | Apple | Microsoft | Amazon | Leetcode 191 | 137 | |
|
| 238. | Lucky Numbers in a Matrix | 2 Approaches | Dry Run | Leetcode 1380 | codestorywithMIK | 216 | |
|
| 239. | Counting Bits | Follow Up Qn | 2 Approaches | AMAZON | Leetcode - 338 | 133 | |
|
| 240. | Maximum Length of Pair Chain | Same as LIS | FULL INTUITION | DP Concepts & Qns - 13 | Leetcode-646 | 132 | |
|
| 241. | Minimum Cost for Cutting Cake I & II | Thought Process | Leetcode 3218 | 3219 | codestorywithMIK | 175 | |
|
| 242. | Permutations | INTUITIVE | Backtracking Template | Two Ways | Similar Problems | Leetcode-46 | 131 | |
|
| 243. | 01 Matrix | Detailed Dry Run | Why BFS from 0s | GOOGLE | Leetcode - 542 | 131 | |
|
| 244. | Make Array Strictly Increasing | Recur + Memo | Time Complexity | GOOGLE | Leetcode-1187 | Live Code | 129 | |
|
| 245. | Amount of Time for Binary Tree to Be Infected | Using DFS | One Pass | Leetcode 2385 | 139 | |
|
| 246. | Design HashMap | Brute Force | Optimal | META | GOOGLE | NETFLIX | Leetcode - 706 | 128 | |
|
| 247. | Lexicographically Smallest Equivalent String | DFS | Explanation β Live Coding | 128 | |
|
| 248. | Design Graph With Shortest Path Calculator | Dijkstraβs | Floyd Warshall | Leetcode-2642 | 132 | |
|
| 249. | Minimum Cost to Make Array Equal | Simplest Solution | MICROSOFT | Leetcode-2448 | Explanation | 127 | |
|
| 250. | Count Elements With Maximum Frequency | One Pass | Two Pass | Leetcode 3005 | 138 | | Frequency
|
| 251. | Minimum Penalty for a Shop | MULTIPLE APPROACHES | Dry Run | META | Leetcode - 2483 | 127 | |
|
| 252. | Knuth-Morris-Pratt KMP String Matching Algorithm | Search Pattern | GFG POTD | 268 | |
|
| 253. | Letter Combinations of a Phone Number | INTUITIVE | Backtracking Template | Leetcode-17 | 126 | |
|
| 254. | Destination City | 2 Approaches | Leetcode-1436 | 132 | |
|
| 255. | Calculate Money in Leetcode Bank | 2 Approaches | O(n) | O(1) | Leetcode 1716 | 126 | |
|
| 256. | Thank you for such a thoughtful gift β₯οΈππ #gift #surprise #friendhip #bond #love #thoughtfull | 124 | |
|
| 257. | Freedom Trail | Recursion | Memoization | Bottom Up | Detailed | Leetcode 514 | codestorywithMIK | 266 | |
|
| 258. | Widest Vertical Area Between Two Points Containing No Points | Leetcode 1637 | 125 | |
|
| 259. | Keep working hard. Your day will come β€οΈβ€οΈ #coding #leetcode #hardwork #motivation #reels #algorithm | 121 | |
|
| 260. | Lexicographically Minimum String After Removing Stars | Easy | Leetcode 3170 | codestorywithMIK | 166 | |
|
| 261. | Shortest Path to Get All Keys | Full Detail | Leetcode-864 | GOOGLE | Explanation β Live Coding | 120 | |
|
| 262. | Find Largest Value in Each Tree Row | DFS | BFS | META | Leetcode - 515 | 122 | |
|
| 263. | Gas Station (Google, Amazon, Uber, Microsoft, FactSet, Zoho, Flipkart) : Explanation β Live Coding | 119 | |
|
| 264. | No One Can Fu***ng Stop You π₯π₯π₯ #coding #motivation #hardwork #reels #youtubeshorts #dontgiveup | 119 | |
|
| 265. | Squares of a Sorted Array | 2 Approaches | Follow Up | Leetcode 977 | 134 | |
|
| 266. | Pow(x, n) | Reasoning | Dry Run | LINKEDIN | AMAZON | Leetcode-50 | Live Code + Explanation | 118 | |
|
| 267. | Every trip teaches me something. #codestorywithmik | 127 | |
|
| 268. | Find the Difference | 3 Approaches | Phone Interview | AMAZON | Leetcode - 389 | 117 | |
|
| 269. | Knight Probability in Chessboard | Recursion | Memoization | AMAZON | DIRECTi | Leetcode-688 | 117 | |
|
| 270. | Longest Arithmetic Subsequence | Recur + Memo | Bottom Up | GOOGLE | Leetcode-1027 | Live Code | 116 | |
|
| 271. | Difference Between Ones and Zeros in Row and Column | Intuition | Leetcode-2482 | 122 | |
|
| 272. | Asteroid Collision | Intuition | Dry Run | Leetcode-735 | Uber | Lyft | Explanation β Live Coding | 116 | |
|
| 273. | Count of Matches in Tournament | MICROSOFT | Leetcode 1688 | 118 | |
|
| 274. | Tumlog saath ho. Bas kaafi hai β€οΈ 18K family #codestorywithmik | 146 | |
|
| 275. | Number of Ways to Reorder Array to Get Same BST | Pascal's triangle | GOOGLE | Leetcode-1569 | 116 | |
|
| 276. | Longest Arithmetic Subsequence of Given Difference | Recur + Memo | Optimal | META | Leetcode-1218 | 115 | |
|
| 277. | Median of Two Sorted Arrays | PART-1 | Brute Force | Better Approach | Google | Apple | Leetcode - 4 | 115 | |
|
| 278. | Palindrome Linked List | 4 Approaches | Leetcode 234| codestorywithMIK | 120 | |
|
| 279. | Number of Subsequences That Satisfy the Given Sum Condition | AMAZON | Leetcode - 1498 | Live Coding | 114 | |
|
| 280. | Single Number II | Multiple Approaches | GOOGLE, AMAZON | META | Leetcode-137 | Explanation | 114 | |
|
| 281. | Longest Cycle in a Graph | Leetcode - 2360 | DFS | Explanation β Live Coding Trash | 114 | |
|
| 282. | Power of Two | Multiple Approaches | Leetcode 231 | 124 | |
|
| 283. | Thank you from the bottom of my heart β€οΈπ #codestorywithmik | 129 | |
|
| 284. | Longest Path With Different Adjacent Characters : (Microsoft) | Explanation β Live Coding | 112 | |
|
| 285. | Non-overlapping Intervals | 2 Approaches | Intuition | Dry Run | Leetcode-435 | GOOGLE | Explanation | 112 | |
|
| 286. | Construct Quad Tree (Leetcode - 427) - (Google) : Explanation β Live Coding | 112 | |
|
| 287. | Number of Longest Increasing Subsequence | Using LIS | Full Dry Run | META | Leetcode-673 | 112 | |
|
| 288. | Guidance | Q& A | Part-1 | Getting Started with DSA ? | Road Map | 111 | |
|
| 289. | Largest Substring Between Two Equal Characters | 3 Ways | C++ | JAVA | Leetcode 1624 | 125 | |
|
| 290. | Reverse Prefix of Word | Detail on reverse Function | Leetcode 2000 | codestorywithMIK | 122 | |
|
| 291. | Find Beautiful Indices in the Given Array | Part I | Part II | Same Code | KMP | Weekly Contest 380 | 126 | |
|
| 292. | Sum of Left Leaves | 2 Approaches | META | Leetcode 404 | codestorywithMIK | 239 | |
|
| 293. | Distribute candies in a binary tree | Intuition | Story To Code | GfG POTD | 117 | |
|
| 294. | String Compression II | Recursion | 2-D Memoization | Leetcode 1531 | 126 | |
|
| 295. | Data Stream as Disjoint Intervals - (AMAZON) : Explanation β Live Coding | 106 | |
|
| 296. | Concatenated Words - (META) : Explanation β Live Coding | 106 | |
|
| 297. | Maximum Number of Events That Can Be Attended II | Recur + Memo | 2 Ways | AMAZON | Leetcode-1751 | 106 | |
|
| 298. | Element Appearing More Than 25% In Sorted Array | 3 Approaches | Leetcode-1287 | 115 | |
|
| 299. | Sort Array By Parity | 3 Approaches | Custom Comparator | META | Leetcode - 905 | 105 | |
|
| 300. | The K Weakest Rows in a Matrix | 2 Approaches | Binary Search | Heap | Sorting | Leetcode - 1337 | 104 | |
|
