| 301. | Design Circular Deque | Simplest Explanation | 2 Ways | Leetcode 641 | codestorywithMIK | 4,989 | |
|
| 302. | A Message | Travel Tales | codestorywithMIK | 4,969 | |
|
| 303. | Palindromic Substrings | Blueprint | Palindrome Problems | 4 Approaches | Leetcode 647 | 4,967 | |
|
| 304. | Meeting Rooms III | Detailed Intuition | Brute Force | Optimal | Leetcode 2402 | 4,901 | |
|
| 305. | Water Bottles | 3 Approaches | Easy Explanations | Leetcode 1518 | codestorywithMIK | 4,852 | |
|
| 306. | Minimum Operations to Exceed Threshold Value II |Easy Explanation | Leetcode 3066 | codestorywithMIK | 4,824 | | Threshold
|
| 307. | Partition Array for Maximum Sum | Why DP | Recursion | Memo | Bottom Up | Leetcode 1043 | 4,809 | |
|
| 308. | Largest Divisible Subset | LIS Variant | DP Concepts & Qns-18 | Leetcode-368 | 4,801 | |
|
| 309. | Find the Power of K-Size Subarrays I | Simple Explanation | Dry Run| Leetcode 3254 |codestorywithMIK | 4,801 | |
|
| 310. | Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 |codestorywithMIK | 4,766 | |
|
| 311. | String Compression III | Simple Simulation | Leetcode 3163 | codestorywithMIK | 4,764 | |
|
| 312. | Minimum Total Distance Traveled | Detailed Thought Process | Leetcode 2463 | codestorywithMIK | 4,743 | |
|
| 313. | Find Champion II | Easy Explanation | Leetcode 2924 | codestorywithMIK | 4,722 | |
|
| 314. | Make String a Subsequence Using Cyclic Increments | Similar Problem |Leetcode 2825 |codestorywithMIK | 4,713 | |
|
| 315. | Minimum Falling Path Sum II | 4 Approaches | Detailed Dry Run | Leetcode 1289 | codestorywithMIK | 4,695 | |
|
| 316. | DSA Shorts with MIK - 10 | Avoid TLE in Competitive Programming with Fast I/O | 4,686 | |
|
| 317. | Lucky Numbers in a Matrix | 2 Approaches | Dry Run | Leetcode 1380 | codestorywithMIK | 4,656 | |
|
| 318. | Minimum Recolors to Get K Consecutive Black Blocks | 2 Approaches | Leetcode 2379 | codestorywithMIK | 4,646 | |
|
| 319. | Count Total Number of Colored Cells | Maths Proof | 2 Approaches | Leetcode 2579 | codestorywithMIK | 4,632 | |
|
| 320. | Decoded String at Index | Clean Code | TCS | GOOGLE | ORACLE | Leetcode - 880 | 4,585 | |
|
| 321. | What is Lambda Capture | C++ | Java | Leetcode 2942 | codestorywithMIK | 4,574 | |
|
| 322. | Binary Trees With Factors | Easy Intuition | Dry Run | GOOGLE | Leetcode - 823 | 4,525 | |
|
| 323. | Delete Nodes From Linked List Present in Array | Simple | Dry Run | Leetcode 3217 | codestorywithMIK | 4,522 | |
|
| 324. | Count the Number of Consistent Strings | Using Bit Manipulation | Leetcode 1684 | codestorywithMIK | 4,519 | |
|
| 325. | Count Substrings That Satisfy K-Constraint I & II | Detailed Explanation | Leetcode 3258 & 3261 | 4,506 | |
|
| 326. | Merge Nodes in Between Zeros | 2 Approaches | Leap Of Faith | Leetcode 2181 | codestorywithMIK | 4,498 | |
|
| 327. | Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK | 4,492 | | Counter-Strike: Source
|
| 328. | You will never have to ❤️ | 4,490 | |
|
| 329. | Find All People With Secret | 4 Approaches | Google | Leetcode 2092 | 4,490 | |
|
| 330. | Find Missing and Repeated Values | Mathematical Proof | Leetcode 2965 | codestorywithMIK | 4,483 | |
|
| 331. | Set Matrix Zeroes | Multiple Approaches | Leetcode 73 | codestorywithMIK | 4,465 | |
|
| 332. | Compare Version Numbers | stringstream | StringTokenizer | C++ | JAVA |Leetcode 165|codestorywithMIK | 4,456 | |
|
| 333. | Find Center of Star Graph | 2 Simple Approaches | Leetcode 1791 | codestorywithMIK | 4,394 | |
|
| 334. | Maximal Score After Applying K Operations | Standard Heap Problem | Leetcode 2530 | codestorywithMIK | 4,374 | |
|
| 335. | Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK | 4,338 | |
|
| 336. | Are sir lekin 🥺 | 4,321 | |
|
| 337. | Pass the Pillow | 2 Approaches | Easy Explanations | Leetcode 2582 | codestorywithMIK | 4,319 | |
|
| 338. | Append Characters to String to Make Subsequence | Simple Approach | Leetcode 2486 | codestorywithMIK | 4,299 | |
|
| 339. | Divide Array Into Equal Pairs | 5 Approaches | Leetcode 2206 | codestorywithMIK | 4,296 | |
|
| 340. | Check If N and Its Double Exist | Special Motivation | Leetcode 1346 | codestorywithMIK | 4,277 | |
|
| 341. | Clear Digits | 4 Detailed Approaches | Leetcode 3174 | codestorywithMIK | 4,268 | |
|
| 342. | Bitwise AND of Numbers Range | 2 Approaches | Dry Run | Leetcode 201 | 4,266 | |
|
| 343. | Sum of Left Leaves | 2 Approaches | META | Leetcode 404 | codestorywithMIK | 4,256 | |
|
| 344. | Remove Nodes From Linked List | 3 Detailed Approaches | Story | Leetcode 2487 | codestorywithMIK | 4,243 | |
|
| 345. | Validate Binary Tree Nodes | Using Binary Tree Properties | BFS | META | Leetcode - 1361 | 4,234 | |
|
| 346. | Build Array Where You Can Find The Maximum Exactly K Comparisons |DP Concepts & Qns-14|Leetcode-1420 | 4,231 | |
|
| 347. | Minimum Number of Moves to Seat Everyone | Counting Sort | Sort | Leetcode 2037 | codestorywithMIK | 4,229 | |
|
| 348. | Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK | 4,228 | |
|
| 349. | Relatable ? 🥹 #codestorywithmik | 4,211 | |
|
| 350. | Knuth-Morris-Pratt KMP String Matching Algorithm | Search Pattern | GFG POTD | 4,205 | |
|
| 351. | No Face, No Setup | 4,188 | |
|
| 352. | Longest Palindromic Substring | Recursion Memo | Bottom Up | DP On Strings | Leetcode 5 | 4,173 | |
|
| 353. | Maximum Count of Positive Integer and Negative Integer | Leetcode 2529 | codestorywithMIK | 4,150 | |
|
| 354. | Maximum Nesting Depth of the Parentheses | 2 Approaches | Leetcode 1614 | codestorywithMIK | 4,124 | |
|
| 355. | Final Prices With a Special Discount in a Shop | Something to learn |Leetcode 1475 |codestorywithMIK | 4,122 | |
|
| 356. | Amount of Time for Binary Tree to Be Infected | Using BFS | Leetcode 2385 | 4,120 | |
|
| 357. | Lemonade Change | Leetcode 860 | codestorywithMIK | 4,082 | | Counter-Strike: Source
|
| 358. | Pseudo-Palindromic Paths in a Binary Tree | 2 Ways | Bit Magic | Leetcode 1457 | 4,061 | |
|
| 359. | String Compression II | Recursion | Memo | Leetcode 1531 | 4,061 | |
|
| 360. | Find All Groups of Farmland | DFS | BFS | Brute Force | Leetcode 1992 | codestorywithMIK | 4,048 | |
|
| 361. | Minimum Operations to Make Array Equal to Target | Minimum Number of Increments|Leetcode 3229 & 1526 | 4,020 | |
|
| 362. | Minimum Add to Make Parentheses Valid | Simple Intuition | Leetcode 921 | codestorywithMIK | 4,012 | |
|
| 363. | Recursion : The Ultimate Guru 🔥 | 3,998 | |
|
| 364. | Custom Sort String | 2 Approaches | Intuition | Meta | Leetcode 791 | 3,993 | |
|
| 365. | My First Salary ❤️ | 3,970 | |
|
| 366. | Convert 1D Array Into 2D Array | 2 Approaches | Leetcode 2022 | codestorywithMIK | 3,969 | |
|
| 367. | Design a Stack With Increment Operation | Better Approach | O(1) | Leetcode 1381 | codestorywithMIK | 3,966 | |
|
| 368. | Segment Tree | Update Query | Story To Code | Video 2 | 3,946 | |
|
| 369. | Longest Palindromic Substring | Recursion | Memoization | Microsoft | Leetcode - 5 | 3,941 | |
|
| 370. | Constrained Subsequence Sum | Recursion | Memoization | Sliding Window | GOOGLE | Leetcode - 1425 | 3,935 | |
|
| 371. | Number of Islands | DFS | BFS | Same as Island Perimeter | Leetcode 200 | codestorywithMIK | 3,915 | |
|
| 372. | Make Two Arrays Equal by Reversing Subarrays | Easy | Leetcode 1460 | codestorywithMIK | 3,882 | |
|
| 373. | Crawler Log Folder | 2 Approaches | Dry Runs | Leetcode 1598 | codestorywithMIK | 3,869 | |
|
| 374. | Delete Characters to Make Fancy String | Simple & Easy | Leetcode 1957 | codestorywithMIK | 3,860 | |
|
| 375. | Minimum Cost for Cutting Cake I & II | Thought Process | Leetcode 3218 | 3219 | codestorywithMIK | 3,851 | |
|
| 376. | TLE agaya last waale test case me 🥺 | 3,842 | |
|
| 377. | Maximum Number of Integers to Choose From a Range I | Simple | Leetcode 2554 | codestorywithMIK | 3,833 | |
|
| 378. | Cherry Pickup II | 3 Approaches | Super Detailed | Leetcode 1463 | 3,831 | |
|
| 379. | Extra Characters in a String | Tree Diagram | Recursion | Memoization | MADE EASY | Leetcode - 2707 | 3,812 | |
|
| 380. | Take Gifts From the Richest Pile | Simple Explanation | Leetcode 2558 | codestorywithMIK | 3,804 | |
|
| 381. | Reorder List | 3 Approaches | Leetcode 143 | codestorywithMIK | 3,780 | |
|
| 382. | DSA Shorts with MIK - 3 | 3,778 | |
|
| 383. | Minimum Number of Operations to Make Array XOR Equal to K | Easy | Leetcode 2997 | codestorywithMIK | 3,767 | |
|
| 384. | Relative Ranks | 3 Approaches | Leetcode 506 | codestorywithMIK | 3,760 | |
|
| 385. | Replace Words | Using TRIE | Uber | Leetcode 648 | codestorywithMIK | 3,752 | |
|
| 386. | 132 Pattern | Intuition explained | Brute Force | Better | Optimal | META | AMAZON | Leetcode - 456 | 3,750 | |
|
| 387. | One Love = CODING ❤️👨🏻💻 | 3,712 | |
|
| 388. | Adding Spaces to a String | Straight Forward Easy | Leetcode 2109 | codestorywithMIK | 3,709 | |
|
| 389. | Sequential Digits | 2 Approaches | Leetcode 1291 | 3,707 | |
|
| 390. | No Loop Needed | Find Min & Max in 1 Line using STL | C++ Competitive Programming Hack | 3,695 | |
|
| 391. | Merge Two 2D Arrays by Summing Values | Multiple Approaches | Leetcode 2570 | codestorywithMIK | 3,650 | |
|
| 392. | Remove Duplicate Letters | Why Monotonic Stack | Intuition | GOOGLE | Leetcode - 316 | 3,649 | |
|
| 393. | Lexicographically Minimum String After Removing Stars | Easy | Leetcode 3170 | codestorywithMIK | 3,621 | |
|
| 394. | Final Array State After K Multiplication Operations I | Detailed | Leetcode 3264 | codestorywithMIK | 3,611 | |
|
| 395. | Out of Boundary Paths | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 576 | 3,575 | |
|
| 396. | Thoda bed rest lelu ? 🥹 | 3,574 | |
|
| 397. | Decode Ways | Recursion | Memo | Bottom Up | Leetcode 91 | 3,556 | |
|
| 398. | Check if One String Swap Can Make Strings Equal | 2 Approaches | Leetcode 1790 | codestorywithMIK | 3,530 | |
|
| 399. | Parallel Courses III | Topological Sorting | Intuition | Dry Run | UBER | Leetcode - 2050 | 3,518 | Vlog |
|
| 400. | Thank You For The Trust 🙏❤️🥺 | 3,509 | |
|
