Zero Array Transformation III | How to detect topic | How to detect Data Structure | Leetcode 3362
Zero Array Transformation I | Brute Force | Optimal | Leetcode 3356 | codestorywithMIK
DSA Shorts with MIK - 10 | Avoid TLE in Competitive Programming with Fast I/O | Part 1
DSA Shorts with MIK - 11 | Avoid TLE in Competitive Programming with Fast I/O 🔥 | Part 2
2025 Placement Roadmap | How I Would Have Prepared | Year 2025 Special | Happy New Year
Maximum Employees to Be Invited to a Meeting | Super Detailed | Leetcode 2127 | codestorywithMIK
Painting a Grid With Three Different Colors | Thought Process | Leetcode 1931 | codestorywithMIK
Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK
Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | codestorywithMIK
Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK
Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK
Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK
Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK
Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK
Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK
Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK
Adding Spaces to a String | Straight Forward Easy | Leetcode 2109 | codestorywithMIK
Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | codestorywithMIK
Count the Number of Complete Components | Multiple Approaches | Leetcode 2685 | codestorywithMIK
Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK
Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK
Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK
Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK
Find Unique Binary String | Multiple Approaches | Intuition | Leetcode 1980 | codestorywithMIK
Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK
Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK
Count the Number of Consistent Strings | Using Bit Manipulation | Leetcode 1684 | codestorywithMIK
Maximum Ascending Subarray Sum | Brute Force | Optimal | Leetcode 1800 | codestorywithMIK
Minimum Length of String After Operations | 2 Approaches |Intuition |Leetcode 3223 |codestorywithMIK
Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK
1795 : MAP OF HIGHEST PEAK| GRAPH | BFS | LEETCODE DAILY CHALLENGE | DAILY DSA PROBLEM
Sentence Similarity III | 2 Simple Approaches | Dry Run | Leetcode 1813 | codestorywithMIK
Domino and Tromino Tiling | Detailed Explanations | Leetcode 790 | codestorywithMIK
Find the Power of K-Size Subarrays I | Why Monotonic Deque | Dry Run|Leetcode 3254 |codestorywithMIK
Count Subarrays With Fixed Bounds | Made Simple | Microsoft | Leetcode 2444 | codestorywithMIK
Longest Subarray With Maximum Bitwise AND | Simple Observation | Leetcode 2419 | codestorywithMIK
Count Number of Maximum Bitwise-OR Subsets | Simplest Approach |Leetcode 2044 | codestorywithMIK
Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | codestorywithMIK
Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593
Extra Characters in a String | Recursion | Bottom Up | Easy | Leetcode 2707 | codestorywithMIK
Maximum Number of Fish in a Grid | DSU | DFS | BFS | Leetcode 2658 | codestorywithMIK
