| 2025-01-21 | It’s Time | Go Get It | 0:00 | 5,900 | |
|
| 2025-01-21 | Grid Game | Detailed Explanation | Complete Ry Run | Leetcode 2017 | codestorywithMIK | 0:00 | 10,199 | | The Grid
|
| 2025-01-20 | First Completely Painted Row or Column | 3 Approaches | Detailed | Leetcode 2661 | codestorywithMIK | 0:00 | 6,719 | |
|
| 2025-01-19 | Trapping Rain Water II | Deep Dive Explanation | What | Why | How | Leetcode 407 | codestorywithMIK | 0:00 | 10,336 | |
|
| 2025-01-18 | Minimum Cost to Make at Least One Valid Path in a Grid | 2 Detailed Approaches | Leetcode 1368 | MIK | 0:00 | 9,572 | |
|
| 2025-01-16 | Multi-Source BFS | What | Why | How | Detailed | Graph Concepts & Qns - 46 | codestorywithMIK | 0:00 | 1,912 | |
|
| 2025-01-16 | Bitwise XOR of All Pairings | 2 Simple Approaches | Dry Runs | Leetcode 2425 | codestorywithMIK | 0:00 | 6,034 | |
|
| 2025-01-16 | Neighboring Bitwise XOR | 2 Detailed Approaches | Dry Runs | Leetcode 2683 | codestorywithMIK | 0:00 | 5,986 | | XOR
|
| 2025-01-15 | Minimize XOR | 2 Detailed Approaches | Dry Runs | Leetcode 2429 | codestorywithMIK | 0:00 | 9,145 | |
|
| 2025-01-14 | Find the Prefix Common Array of Two Arrays | 3 Detailed Approach | Leetcode 2657 | codestorywithMIK | 0:00 | 5,989 | |
|
| 2025-01-13 | DSA Shorts with MIK - 9 | 0:00 | 1,904 | |
|
| 2025-01-13 | Minimum Length of String After Operations | 2 Approaches |Intuition |Leetcode 3223 |codestorywithMIK | 0:00 | 5,629 | |
|
| 2025-01-11 | Your don’t need paid course for DSA | 0:00 | 2,902 | |
|
| 2025-01-11 | Construct K Palindrome Strings | Super Detailed Intuition | Leetcode 1400 | codestorywithMIK | 0:00 | 7,322 | |
|
| 2025-01-10 | Word Subsets | Simple Thought Process | C++ | Java | Leetcode 916 | codestorywithMIK | 0:00 | 7,845 | |
|
| 2025-01-09 | Counting Words With a Given Prefix | Brute Force | Trie | Leetcode 2185 | codestorywithMIK | 0:00 | 3,240 | | Brute Force
|
| 2025-01-08 | Count Prefix and Suffix Pairs I | Brute Force | Trie | Leetcode 3042 | codestorywithMIK | 0:00 | 6,123 | | Brute Force
|
| 2025-01-07 | String Matching in an Array | Simple Approaches | Leetcode 1408 | codestorywithMIK | 0:00 | 8,566 | |
|
| 2025-01-06 | Minimum Number of Operations to Move All Balls to Each Box | Leetcode 1769 | 3 Approaches | MIK | 0:00 | 8,307 | |
|
| 2025-01-05 | Shifting Letters II | Leetcode 2381 | Difference Array Technique: Concepts & Questions - 2 | MIK | 0:00 | 9,384 | |
|
| 2025-01-05 | Introduction | What | How | Difference Array Technique: Concepts & Questions - 1 | codestorywithMIK | 0:00 | 8,924 | |
|
| 2025-01-03 | But bhai…. | 0:00 | 5,744 | |
|
| 2025-01-03 | Number of Ways to Split Array | Simple Thought Process | Leetcode 2270 | codestorywithMIK | 0:00 | 5,278 | |
|
| 2025-01-02 | Maximum Non Negative Product in a Matrix | Recursion | Memo | Bottom Up | Leetcode 1594 |DP On Grids | 0:00 | 1,333 | |
|
| 2025-01-02 | Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK | 0:00 | 6,517 | |
|
| 2024-12-31 | 2025 Placement Roadmap | How I Would Have Prepared | Year 2025 Special | Happy New Year | 0:00 | 12,447 | |
|
| 2024-12-31 | What is special about year 2025 ? | 0:00 | 1,194 | |
|
| 2024-12-28 | Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK | 0:00 | 9,665 | |
|
| 2024-12-27 | Best Sightseeing Pair | 3 Approaches | Detailed For Beginners | Leetcode 1014 | codestorywithMIK | 0:00 | 6,755 | |
|
| 2024-12-26 | Unique Paths II | Recursion | Memo | Bottom Up | Leetcode 63 | DP On Grids | codestorywithMIK | 0:00 | 893 | |
|
| 2024-12-26 | Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code | 0:00 | 6,107 | |
|
| 2024-12-24 | Find Building Where Alice and Bob Can Meet | Segment Tree Concepts & Qns | Video 11 | Leetcode 2940 | 0:00 | 1,815 | |
|
| 2024-12-24 | Range Maximum Index Query | Part 2 | Segment Tree Concepts & Qns | Video 10 | codestorywithMIK | 0:00 | 865 | |
|
| 2024-12-24 | Find Minimum Diameter After Merging Two Trees | Leetcode 3203 | Graph Concepts & Qns - 45 | MIK | 0:00 | 6,234 | |
|
| 2024-12-24 | Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts & Qns - 44 | MIK | 0:00 | 5,483 | |
|
| 2024-12-23 | Range Maximum Index Query | Part 1 | Segment Tree Concepts & Qns | Video 9 | codestorywithMIK | 0:00 | 1,813 | |
|
| 2024-12-23 | Thank You For The Trust 🙏❤️🥺 | 0:00 | 3,509 | |
|
| 2024-12-23 | Minimum Number of Operations to Sort a Binary Tree by Level | Leetcode 2471 | codestorywithMIK | 0:00 | 5,446 | |
|
| 2024-12-20 | Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK | 0:00 | 5,988 | |
|
| 2024-12-19 | Max Chunks To Make Sorted | 3 Detailed Approaches | Leetcode 769 | codestorywithMIK | 0:00 | 5,566 | |
|
| 2024-12-18 | Final Prices With a Special Discount in a Shop | Something to learn |Leetcode 1475 |codestorywithMIK | 0:00 | 4,122 | |
|
| 2024-12-17 | Unique Paths | Recursion | Memo | Bottom Up | Leetcode 62 | DP On Grids | codestorywithMIK | 0:00 | 805 | |
|
| 2024-12-17 | Construct String With Repeat Limit | 2 Simple Approaches | Leetcode 2182 | codestorywithMIK | 0:00 | 6,427 | |
|
| 2024-12-16 | Introduction | DP On Grids | Part 2 | DP Concepts & Qns-30 | codestorywithMIK | 0:00 | 643 | |
|
| 2024-12-16 | Final Array State After K Multiplication Operations I | Detailed | Leetcode 3264 | codestorywithMIK | 0:00 | 3,611 | |
|
| 2024-12-15 | Introduction | DP On Grids | Part 1 | DP Concepts & Qns-29 | codestorywithMIK | 0:00 | 1,134 | |
|
| 2024-12-14 | Maximum Average Pass Ratio | Detailed | Covered Minute Details | Leetcode 1792 | codestorywithMIK | 0:00 | 7,405 | |
|
| 2024-12-13 | Continuous Subarrays | Detailed Approaches | Time Complexity | Leetcode 2762 | codestorywithMIK | 0:00 | 8,705 | |
|
| 2024-12-12 | Find Score of an Array After Marking All Elements | 2 Approaches | Leetcode 2593 | codestorywithMIK | 0:00 | 5,132 | |
|
| 2024-12-11 | Take Gifts From the Richest Pile | Simple Explanation | Leetcode 2558 | codestorywithMIK | 0:00 | 3,804 | |
|
| 2024-12-10 | Maximum Beauty of an Array After Applying Operation | 3 Approaches | Leetcode 2779 |codestorywithMIK | 0:00 | 7,460 | |
|
| 2024-12-09 | Sorry System Stack 🥹 | 0:00 | 2,219 | |
|
| 2024-12-09 | Find Longest Special Substring That Occurs Thrice I & II | Leetcode 2981 & 2982 | codestorywithMIK | 0:00 | 7,637 | |
|
| 2024-12-09 | You will never have to ❤️ | 0:00 | 4,490 | |
|
| 2024-12-08 | Primality Check | Sieve of Eratosthenes | Super Detailed For Beginners | codestorywithMIK | 0:00 | 1,728 | |
|
| 2024-12-08 | Special Array II | 3 Detailed Approaches | Beginners Alert | Leetcode 3152 | codestorywithMIK | 0:00 | 6,916 | |
|
| 2024-12-07 | Two Best Non-Overlapping Events | Brute Force | Better | Leetcode 2054 | codestorywithMIK | 0:00 | 8,488 | | Brute Force
|
| 2024-12-06 | Minimum Limit of Balls in a Bag | Detailed | Why Binary Search | Leetcode 1760 | codestorywithMIK | 0:00 | 8,927 | |
|
| 2024-12-05 | Maximum Number of Integers to Choose From a Range I | Simple | Leetcode 2554 | codestorywithMIK | 0:00 | 3,833 | |
|
| 2024-12-04 | Move Pieces to Obtain a String | Brute Force | Wrong | Optimal | Leetcode 2337 | codestorywithMIK | 0:00 | 8,274 | |
|
| 2024-12-03 | Make String a Subsequence Using Cyclic Increments | Similar Problem |Leetcode 2825 |codestorywithMIK | 0:00 | 4,713 | |
|
| 2024-12-02 | Consistency is 🔑 | 0:00 | 1,733 | |
|
| 2024-12-02 | Adding Spaces to a String | Straight Forward Easy | Leetcode 2109 | codestorywithMIK | 0:00 | 3,709 | |
|
| 2024-11-30 | Check If N and Its Double Exist | Special Motivation | Leetcode 1346 | codestorywithMIK | 0:00 | 4,277 | |
|
| 2024-11-29 | November Leetcode Badge, 2024 | 0:00 | 923 | |
|
| 2024-11-29 | Hierholzer's Algorithm | Valid Arrangement of Pairs | Leetcode 2097 | Graph Concepts & Qns - 43 | 0:00 | 7,667 | |
|
| 2024-11-29 | Euler Path | Euler Circuit | PART-3 | Graph Concepts & Qns - 42 | Explanation + Code | 0:00 | 2,416 | |
|
| 2024-11-28 | Minimum Time to Visit a Cell In a Grid | Using Studied Concept | Leetcode 2577 | codestorywithMIK | 0:00 | 6,096 | |
|
| 2024-11-27 | Minimum Obstacle Removal to Reach Corner I | Using Studied Concept | Leetcode 2290 |codestorywithMIK | 0:00 | 6,286 | |
|
| 2024-11-26 | Shortest Distance After Road Addition Queries I | Easy Explanation | Leetcode 3243 |codestorywithMIK | 0:00 | 5,661 | |
|
| 2024-11-26 | Where coding meets storytelling | MIK | 0:00 | 5,579 | |
|
| 2024-11-25 | Find Champion II | Easy Explanation | Leetcode 2924 | codestorywithMIK | 0:00 | 4,722 | |
|
| 2024-11-24 | Sliding Puzzle | Detailed for Beginners | Leetcode 773 | codestorywithMIK | 0:00 | 8,130 | |
|
| 2024-11-23 | Minimum Array Sum | Detailed for Beginners | Contest Problem | Leetcode 3366 | codestorywithMIK | 0:00 | 3,196 | |
|
| 2024-11-23 | Maximum Matrix Sum | Simple Thought Process | Leetcode 1975 | codestorywithMIK | 0:00 | 5,660 | |
|
| 2024-11-22 | Rotating the Box | Brute Force | Optimal | Leetcode 1861 | codestorywithMIK | 0:00 | 5,697 | |
|
| 2024-11-21 | Flip Columns For Maximum Number of Equal Rows | 2 Approaches | Leetcode 1072 | codestorywithMIK | 0:00 | 7,765 | |
|
| 2024-11-20 | Count Unguarded Cells in the Grid | Simple Explanation | Leetcode 2257 | codestorywithMIK | 0:00 | 6,777 | | The Grid
|
| 2024-11-19 | Take K of Each Character From Left and Right | 2 Approaches | Leetcode 2516 | codestorywithMIK | 0:00 | 9,106 | |
|
| 2024-11-18 | Defuse the Bomb | Detailed for Beginners | Leetcode 1652 | codestorywithMIK | 0:00 | 5,789 | |
|
| 2024-11-18 | Maximum Sum of Distinct Subarrays With Length K | Khandani Template |Leetcode 2461 |codestorywithMIK | 0:00 | 6,536 | |
|
| 2024-11-17 | Shortest Subarray with Sum at Least K | Already Studied Concept | Leetcode 862 | codestorywithMIK | 0:00 | 10,691 | |
|
| 2024-11-16 | Find the Power of K-Size Subarrays I | Why Monotonic Deque | Dry Run|Leetcode 3254 |codestorywithMIK | 0:00 | 1,802 | |
|
| 2024-11-16 | Find the Power of K-Size Subarrays I | Simple Explanation | Dry Run| Leetcode 3254 |codestorywithMIK | 0:00 | 4,801 | |
|
| 2024-11-15 | Shortest Subarray to be Removed to Make Array Sorted | Detailed | Leetcode 1574 | codestorywithMIK | 0:00 | 8,422 | |
|
| 2024-11-14 | Minimized Maximum of Products Distributed to Any Store | Leetcode 2064 | codestorywithMIK | 0:00 | 6,691 | |
|
| 2024-11-13 | Count the Number of Fair Pairs | Detailed Explanation | Leetcode 2563 | codestorywithMIK | 0:00 | 8,101 | |
|
| 2024-11-12 | Most Beautiful Item for Each Query | Simple Explanation | Leetcode 2070 | codestorywithMIK | 0:00 | 7,100 | |
|
| 2024-11-11 | Prime Subtraction Operation | Straight Forward Approach | Leetcode 2601 | codestorywithMIK | 0:00 | 8,280 | |
|
| 2024-11-10 | Shortest Subarray With OR at Least K II | Made Easy | Detailed | Leetcode 3097 | codestorywithMIK | 0:00 | 7,160 | |
|
| 2024-11-09 | Minimum Array End | How much you know about AND | Detailed | Leetcode 3133 | codestorywithMIK | 0:00 | 9,466 | |
|
| 2024-11-08 | DSA Shorts with MIK - 8 | 0:00 | 1,119 | |
|
| 2024-11-08 | Maximum XOR for Each Query | Simple Explanation | Leetcode 1829 | codestorywithMIK | 0:00 | 7,303 | | XOR
|
| 2024-11-07 | Largest Combination With Bitwise AND Greater Than Zero | Detailed | Leetcode 2275 | codestorywithMIK | 0:00 | 7,534 | |
|
| 2024-11-06 | Find if Array Can Be Sorted | Detailed Approaches | Dry Runs | Leetcode 3011 | codestorywithMIK | 0:00 | 9,031 | |
|
| 2024-11-05 | Minimum Number of Changes to Make Binary String Beautiful | 2 Ways | Leetcode 2914 |codestorywithMIK | 0:00 | 6,619 | | Binaries
|
| 2024-11-04 | Consistency is the key | 0:00 | 2,175 | |
|
| 2024-11-03 | String Compression III | Simple Simulation | Leetcode 3163 | codestorywithMIK | 0:00 | 4,764 | |
|
| 2024-11-02 | Rotate String | Something to learn | Leetcode 796 | codestorywithMIK | 0:00 | 5,354 | |
|
| 2024-10-31 | Delete Characters to Make Fancy String | Simple & Easy | Leetcode 1957 | codestorywithMIK | 0:00 | 3,860 | |
|
