codestorywithMIK
Also available on topmate.io for 1-1 sessions - https://topmate.io/mazhar_mik (Currently Inactive due to tight schedule) - I am on a ...
Maximize the Number of Target Nodes After Connecting Trees II | Full Dry Run | Leetcode 3373 | MIK
Maximize the Number of Target Nodes After Connecting Trees I | BFS | DFS | Leetcode 3372 | MIK
Struggling With Logic in Coding ? Watch This Before Your Next LeetCode Question | codestorywithMIK
DSA Shorts with MIK - 11 | Avoid TLE in Competitive Programming with Fast I/O 🔥 | Part 2
Divisible and Non-divisible Sums Difference | Constant Time | Leetcode 2894 | codestorywithMIK
DSA Shorts with MIK - 10 | Avoid TLE in Competitive Programming with Fast I/O | Part 1
Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
Longest Palindrome by Concatenating Two Letter Words | Simple Way | Leetcode 2131 | codestorywithMIK
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
Why I Will NEVER Promote Paid DSA Courses! 🚫 The Truth You Need to Know | codestorywithMIK
Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK
Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK
Most Profitable Path in a Tree | BFS | DFS | Detailed | Leetcode 2467 | codestorywithMIK
Minimum Cost to Make at Least One Valid Path in a Grid| 2 Approaches | Leetcode 1368 | CodeWithShaaz
Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK
Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK
First Completely Painted Row or Column | Approaches | Detailed | Leetcode 2661 | CodeWithShaaz
Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK
Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 |codestorywithMIK
Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK
Maximum Number of Integers to Choose From a Range I | Simple | Leetcode 2554 | codestorywithMIK
Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK
Maximize the Number of Target Nodes After Connecting Trees I | BFS | DFS | Leetcode 3372 | MIK
Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | codestorywithMIK
Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK
Count Subarrays With Score Less Than K | Khandani Template Simple | Leetcode 2302 | codestorywithMIK
Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK
Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK
Count of Substrings Containing Every Vowel and K Consonants II | Leetcode 3306 | codestorywithMIK
Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK
DSA Shorts with MIK - 11 | Avoid TLE in Competitive Programming with Fast I/O 🔥 | Part 2
Check if Number is a Sum of Powers of Three | Maths Proof | 3 Ways | Leetcode 1780 |codestorywithMIK
Minimum Operations to Make Array Values Equal to K | Detailed Thought Process | Leetcode 3375 | MIK
Count Equal and Divisible Pairs in an Array | Brute Force | Optimal | Detailed Maths | Leetcode 2176
Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | codestorywithMIK
Struggling With Logic in Coding ? Watch This Before Your Next LeetCode Question | codestorywithMIK
Count Good Triplets in an Array | Segment Tree Concepts & Qns | Video 12 | Leetcode 2179 | MIK
Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK
Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK
Maximum Number of Fish in a Grid | DSU | DFS | BFS | Leetcode 2658 | codestorywithMIK
Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK
Minimum Number of Operations to Make Elements in Array Distinct | 2 Approaches | Leetcode 3396 | MIK
The k-th Lexicographical String of All Happy Strings of Length n | Leetcode 1415 | codestorywithMIK
DSA Shorts with MIK - 10 | Avoid TLE in Competitive Programming with Fast I/O | Part 1
Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK
Longest Nice Subarray | Brute Force | Better | Optimal | Dry Runs | Leetcode 2401 | codestorywithMIK
Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK
Closest Prime Numbers in Range | 2 Detailed Approaches | Leetcode 2523 | codestorywithMIK
Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK
Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK
Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK
Find All Possible Recipes from Given Supplies | Brute Force | Optimal | Leetcode 2115
Count Symmetric Integers | 2 Detailed Approaches | Leetcode 2843 | codestorywithMIK
Maximum Absolute Sum of Any Subarray | Kadane's Algorithm | Leetcode 1749 | codestorywithMIK
Construct Smallest Number From DI String | Easy Approaches | Leetcode 2375 | codestorywithMIK
Best Sightseeing Pair | 3 Approaches | Detailed For Beginners | Leetcode 1014 | codestorywithMIK
Maximum Count of Positive Integer and Negative Integer | Leetcode 2529 | codestorywithMIK
Maximum Candies Allocated to K Children | Brute Force | Optimal | Leetcode 2226 | codestorywithMIK
Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK
Domino and Tromino Tiling | Detailed Explanations | Leetcode 790 | codestorywithMIK
Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK
Find the Punishment Number of an Integer | Multiple Ways | Dry Run |Leetcode 2698 | codestorywithMIK
Check if Grid can be Cut into Sections | Merge Intervals | Leetcode 3394 | Leetcode 56 | Detailed
Minimum Operations to Exceed Threshold Value II |Easy Explanation | Leetcode 3066 | codestorywithMIK
Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK
Letter Tile Possibilities | 2 Ways | Using Standard Template | Leetcode 1079 | codestorywithMIK
Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK
Number of Ways to Split Array | Simple Thought Process | Leetcode 2270 | codestorywithMIK
Maximum Ascending Subarray Sum | Brute Force | Optimal | Leetcode 1800 | codestorywithMIK
Count Largest Group | Simple Simulation | Dry Run | Leetcode 1399 | codestorywithMIK
Count Good Triplets | Simple Approach | Slight Improvements | Leetcode 1534 | codestorywithMIK
Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK