| 2025-03-11 | Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK | 0:00 | 6,283 | |
|
| 2025-03-10 | Are mummy 🥹 | 0:00 | 11,069 | |
|
| 2025-03-10 | Count of Substrings Containing Every Vowel and K Consonants II | Leetcode 3306 | codestorywithMIK | 0:00 | 12,664 | |
|
| 2025-03-08 | DSA Shorts with MIK - 10 | Avoid TLE in Competitive Programming with Fast I/O | 0:00 | 4,686 | |
|
| 2025-03-08 | Minimum Recolors to Get K Consecutive Black Blocks | 2 Approaches | Leetcode 2379 | codestorywithMIK | 0:00 | 4,646 | |
|
| 2025-03-07 | Closest Prime Numbers in Range | 2 Detailed Approaches | Leetcode 2523 | codestorywithMIK | 0:00 | 6,211 | |
|
| 2025-03-06 | Find Missing and Repeated Values | Mathematical Proof | Leetcode 2965 | codestorywithMIK | 0:00 | 4,483 | |
|
| 2025-03-05 | Count Total Number of Colored Cells | Maths Proof | 2 Approaches | Leetcode 2579 | codestorywithMIK | 0:00 | 4,632 | |
|
| 2025-03-04 | Check if Number is a Sum of Powers of Three | Maths Proof | 3 Ways | Leetcode 1780 |codestorywithMIK | 0:00 | 6,574 | |
|
| 2025-03-03 | Partition Array According to Given Pivot | Multiple Approaches | Leetcode 2161 | codestorywithMIK | 0:00 | 5,068 | |
|
| 2025-03-02 | Merge Two 2D Arrays by Summing Values | Multiple Approaches | Leetcode 2570 | codestorywithMIK | 0:00 | 3,650 | |
|
| 2025-03-01 | Nasha hai bhai 🥹 | 0:00 | 5,216 | |
|
| 2025-02-27 | Recursion : The Ultimate Guru 🔥 | 0:00 | 3,998 | |
|
| 2025-02-27 | Aamchi Mumbai, jithe sab kuch possible aahe ❤️ | 0:00 | 697 | |
|
| 2025-02-27 | Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK | 0:00 | 9,237 | |
|
| 2025-02-26 | Maximum Absolute Sum of Any Subarray | Kadane's Algorithm | Leetcode 1749 | codestorywithMIK | 0:00 | 7,040 | |
|
| 2025-02-25 | Number of Sub-arrays With Odd Sum | Brute Force | Better | Optimal | Leetcode 1524 |codestorywithMIK | 0:00 | 9,573 | | Brute Force
|
| 2025-02-23 | Thoda bed rest lelu ? 🥹 | 0:00 | 3,574 | |
|
| 2025-02-23 | Recovering ❤️🩹 🙏 | 0:00 | 1,447 | |
|
| 2025-02-23 | Construct Binary Tree from Preorder and Postorder Traversal | Leetcode 889 | codestorywithMIK | 0:00 | 8,872 | |
|
| 2025-02-22 | Another Success Story | Microsoft | 0:00 | 942 | |
|
| 2025-02-22 | Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | codestorywithMIK | 0:00 | 7,675 | |
|
| 2025-02-21 | Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK | 0:00 | 5,428 | |
|
| 2025-02-19 | The k-th Lexicographical String of All Happy Strings of Length n | Leetcode 1415 | codestorywithMIK | 0:00 | 7,567 | |
|
| 2025-02-18 | Construct Smallest Number From DI String | Easy Approaches | Leetcode 2375 | codestorywithMIK | 0:00 | 8,822 | |
|
| 2025-02-17 | Letter Tile Possibilities | 2 Ways | Using Standard Template | Leetcode 1079 | codestorywithMIK | 0:00 | 9,844 | |
|
| 2025-02-16 | Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK | 0:00 | 10,516 | |
|
| 2025-02-15 | Find the Punishment Number of an Integer | Multiple Ways | Dry Run |Leetcode 2698 | codestorywithMIK | 0:00 | 10,159 | |
|
| 2025-02-14 | Product of the Last K Numbers | Brute Force | Follow Up Optimal | Leetcode 1352 | codestorywithMIK | 0:00 | 6,470 | | Brute Force
|
| 2025-02-13 | Maximize the Minimum Game Score | Super Detailed | Dry Runs | Leetcode 3449 | codestorywithMIK | 0:00 | 2,067 | |
|
| 2025-02-13 | Minimum Operations to Exceed Threshold Value II |Easy Explanation | Leetcode 3066 | codestorywithMIK | 0:00 | 4,824 | | Threshold
|
| 2025-02-12 | Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK | 0:00 | 6,298 | |
|
| 2025-02-11 | Remove All Occurrences of a Substring | 3 Approaches | Leetcode 1910 | codestorywithMIK | 0:00 | 7,952 | |
|
| 2025-02-10 | Clear Digits | 4 Detailed Approaches | Leetcode 3174 | codestorywithMIK | 0:00 | 4,268 | |
|
| 2025-02-09 | Count Number of Bad Pairs | 3 Ways | Intuition | Leetcode 2364 | codestorywithMIK | 0:00 | 7,446 | |
|
| 2025-02-08 | Design a Number Container System | 2 Approaches | Leetcode 2349 | codestorywithMIK | 0:00 | 6,970 | |
|
| 2025-02-06 | No Face, No Setup | 0:00 | 4,188 | |
|
| 2025-02-06 | Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK | 0:00 | 8,132 | |
|
| 2025-02-05 | Check if One String Swap Can Make Strings Equal | 2 Approaches | Leetcode 1790 | codestorywithMIK | 0:00 | 3,530 | |
|
| 2025-02-04 | How I felt when baba said | 0:00 | 2,690 | |
|
| 2025-02-03 | Longest Strictly Increasing or Strictly Decreasing Subarray | Leetcode 3105 | codestorywithMIK | 0:00 | 3,413 | |
|
| 2025-02-02 | Why Buy Courses ? Go Nirma Style for DSA! 🚀 | 0:00 | 2,302 | |
|
| 2025-02-02 | Check if Array Is Sorted and Rotated | 3 Approaches | Leetcode 1752 | codestorywithMIK | 0:00 | 6,294 | |
|
| 2025-02-01 | Special Array I | 2 Approaches | Leetcode 3151 | codestorywithMIK | 0:00 | 3,430 | |
|
| 2025-01-31 | Making A Large Island | Brute Force | Better | Optimal | Dry Run | Leetcode 827 | codestorywithMIK | 0:00 | 5,929 | | Brute Force
|
| 2025-01-30 | Are sir lekin 🥺 | 0:00 | 4,321 | |
|
| 2025-01-30 | Divide Nodes Into the Maximum Number of Groups | Super Detailed | Leetcode 2493 | codestorywithMIK | 0:00 | 8,049 | |
|
| 2025-01-29 | Redundant Connection | DSU | DFS | BFS | Leetcode 684 | codestorywithMIK | 0:00 | 6,809 | | The Redundant
|
| 2025-01-28 | Are bhai bhai bhai 🤯 | 0:00 | 2,719 | |
|
| 2025-01-28 | Achaaaaaa ☕️🧑🏻💻 | 0:00 | 5,060 | |
|
| 2025-01-26 | Maximum Employees to Be Invited to a Meeting | Super Detailed | Leetcode 2127 | codestorywithMIK | 0:00 | 9,190 | |
|
| 2025-01-26 | Course Schedule IV | 3 Detailed Approaches | Leetcode 1462 | codestorywithMIK | 0:00 | 7,071 | |
|
| 2025-01-25 | Make Lexicographically Smallest Array by Swapping Elements | Brute Force | Optimal | Leetcode 2948 | 0:00 | 9,868 | | Brute Force
|
| 2025-01-24 | My First Salary ❤️ | 0:00 | 3,970 | |
|
| 2025-01-24 | Bas aur kya batau ? | 0:00 | 2,317 | |
|
| 2025-01-23 | Count Servers that Communicate | 3 Detailed Approaches | Dry Runs | Leetcode 1267 | codestorywithMIK | 0:00 | 6,758 | |
|
| 2025-01-22 | Interviewer vs Candidate 😏 | 0:00 | 2,450 | |
|
| 2025-01-22 | TLE agaya last waale test case me 🥺 | 0:00 | 3,842 | |
|
| 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 | |
|
