Struggling With Logic in Coding ? Watch This Before Your Next LeetCode Question | codestorywithMIK
Zero Array Transformation III | How to detect topic | How to detect Data Structure | Leetcode 3362
Longest Palindrome by Concatenating Two Letter Words | Simple Way | Leetcode 2131 | codestorywithMIK
DSA Shorts with MIK - 10 | Avoid TLE in Competitive Programming with Fast I/O | Part 1
Join CryptoHood™️ Whatsapp Channel Time Farm Code| Time Farm Join CryptoHood™️ Whatsapp Channel code
DSA Shorts with MIK - 11 | Avoid TLE in Competitive Programming with Fast I/O 🔥 | Part 2
Maximum Employees to Be Invited to a Meeting | Super Detailed | Leetcode 2127 | codestorywithMIK
2025 Placement Roadmap | How I Would Have Prepared | Year 2025 Special | Happy New Year
Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK
Construct Smallest Number From DI String | Easy Approaches | Leetcode 2375 | codestorywithMIK
Minimum Cost to Make at Least One Valid Path in a Grid| 2 Approaches | Leetcode 1368 | CodeWithShaaz
Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
The k-th Lexicographical String of All Happy Strings of Length n | Leetcode 1415 |BOOTCODER
Painting a Grid With Three Different Colors | Thought Process | Leetcode 1931 | codestorywithMIK
Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK
Zero Array Transformation I | Brute Force | Optimal | Leetcode 3356 | codestorywithMIK
Minimum Array End | How much you know about AND | Detailed | Leetcode 3133 | codestorywithMIK
Minimum Length of String After Operations | 2 Approaches |Intuition |Leetcode 3223 |codestorywithMIK
Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK
Divide Nodes Into the Maximum Number of Groups | Super Detailed | Leetcode 2493 | codestorywithMIK
Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK
Maximum Ascending Subarray Sum | Brute Force | Optimal | Leetcode 1800 | codestorywithMIK
Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK
Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK
1795 : MAP OF HIGHEST PEAK| GRAPH | BFS | LEETCODE DAILY CHALLENGE | DAILY DSA PROBLEM
Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK
Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK
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 the Number of Consistent Strings | Using Bit Manipulation | Leetcode 1684 | codestorywithMIK
Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | 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 Fish in a Grid | DSU | DFS | BFS | Leetcode 2658 | codestorywithMIK
Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | 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
Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK
Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK
Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK
Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK
Delete Characters to Make Fancy String | Simple & Easy | Leetcode 1957 | codestorywithMIK
Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK
Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK
1795 : MAP OF HIGHEST PEAK| GRAPH | BFS | LEETCODE DAILY CHALLENGE | DAILY DSA PROBLEM
Take Gifts From the Richest Pile | Simple Explanation | Leetcode 2558 | codestorywithMIK
Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK
Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK
Find All Possible Recipes from Given Supplies | Brute Force | Optimal | Leetcode 2115
Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK
Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK
Number of Ways to Arrive at Destination | Straight Forward Simple | Leetcode 1976 | codestorywithMIK
My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK
Shortest Distance After Road Addition Queries I | Easy Explanation | Leetcode 3243 |codestorywithMIK
Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK
Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK
Shortest Palindrome | Multiple Ways | KMP Zindabaad | Leetcode 214 | codestorywithMIK
K-th Smallest in Lexicographical Order | Super Detailed | Dry Run | Leetcode 440 | codestorywithMIK
Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK
Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK
Different Ways to Add Parentheses | Simple Story To Code | Leetcode 241 | codestorywithMIK
Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK
Count and Say | Made Super Easy | Simple Explanation | Leetcode 38 | codestorywithMIK
Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK
Check if Number is a Sum of Powers of Three | Maths Proof | 3 Ways | Leetcode 1780 |codestorywithMIK
Print Shortest Common Supersequence | DP On Strings | Leetcode 1092 | DP Concepts & Qns-21
Max Chunks To Make Sorted | 3 Detailed Approaches | Leetcode 769 | codestorywithMIK
Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK
Find Minimum Time to Reach Last Room I | Detailed Explanation | Leetcode 3341 | codestorywithMIK