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 ...
Using a Robot to Print the Lexicographically Smallest String | Thought Process | Leetcode 2434 | MIK
Distribute Candies Among Children II | 4 Approaches | Detailed | Leetcode 2929 | codestorywithMIK
Struggling With Logic in Coding ? Watch This Before Your Next LeetCode Question | codestorywithMIK
Maximize the Number of Target Nodes After Connecting Trees I | BFS | DFS | Leetcode 3372 | MIK
Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK
Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK
Painting a Grid With Three Different Colors | Thought Process | Leetcode 1931 | codestorywithMIK
Maximum Difference Between Increasing Elements | Easy | Leetcode 2016 | codestorywithMIK
Maximum Employees to Be Invited to a Meeting | Super Detailed | Leetcode 2127 | codestorywithMIK
Find the Lexicographically Largest String From the Box I | Another Approach | Leetcode 3403 | MIK
Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK
Zero Array Transformation III | How to detect topic | How to detect Data Structure | Leetcode 3362
Most Profitable Path in a Tree | BFS | DFS | Detailed | Leetcode 2467 | codestorywithMIK
Maximum Candies You Can Get from Boxes | 2 Ways | Simple Intuition | Leetcode 1298 |codestorywithMIK
Zero Array Transformation I | Brute Force | Optimal | Leetcode 3356 | codestorywithMIK
Count Subarrays With Score Less Than K | Khandani Template Simple | Leetcode 2302 | codestorywithMIK
Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | codestorywithMIK
DSA Shorts with MIK - 10 | Avoid TLE in Competitive Programming with Fast I/O | Part 1
Maximize the Number of Target Nodes After Connecting Trees II | Full Dry Run | Leetcode 3373 | MIK
Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 |codestorywithMIK
Total Characters in String After Transformations I | Made Easy | Leetcode 3335 | codestorywithMIK
Find Minimum Time to Reach Last Room I | Detailed Explanation | Leetcode 3341 | codestorywithMIK
Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK
Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
Maximum Number of Points From Grid Queries | DFS | BFS | Optimal | Leetcode 2503 | codestorywithMIK
Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK
Max Difference You Can Get From Changing an Integer | Made Easy | Leetcode 1432 | codestorywithMIK
Count Complete Subarrays in an Array | Khandani Template | Dry Run | Leetcode 2799 |codestorywithMIK
Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK
Product of the Last K Numbers | Brute Force | Follow Up Optimal | Leetcode 1352 | codestorywithMIK
Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK
Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK
Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK
Push Dominoes | Simplest Intuition | Complete Dry Run | Leetcode 838 | codestorywithMIK
Find the Lexicographically Largest String From the Box I | Thought Process | Leetcode 3403 | MIK
Count of Substrings Containing Every Vowel and K Consonants II | Leetcode 3306 | codestorywithMIK
Maximum Value of an Ordered Triplet I | Multiple Approaches | Leetcode 2873 | codestorywithMIK
Number of Sub-arrays With Odd Sum | Brute Force | Better | Optimal | Leetcode 1524 |codestorywithMIK
The k-th Lexicographical String of All Happy Strings of Length n | Leetcode 1415 | codestorywithMIK
Check if Number is a Sum of Powers of Three | Maths Proof | 3 Ways | Leetcode 1780 |codestorywithMIK
Maximum Difference by Remapping a Digit | Easy | 2 Ways | Leetcode 2566 | codestorywithMIK
Construct Binary Tree from Preorder and Postorder Traversal | Leetcode 889 | codestorywithMIK
Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK
Closest Prime Numbers in Range | 2 Detailed Approaches | Leetcode 2523 | codestorywithMIK
Maximum Difference Between Adjacent Elements in a Circular Array | Leetcode 3423 | codestorywithMIK
Maximum Difference Between Even and Odd Frequency II | Super Detailed | Leetcode 3445 | MIK
Find the Punishment Number of an Integer | Multiple Ways | Dry Run |Leetcode 2698 | codestorywithMIK
Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK
Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | codestorywithMIK
Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK
Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK
Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK
Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK
Count the Number of Good Subarrays | Thought Process | Khandani Template | Leetcode 2537 | MIK
Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK
Letter Tile Possibilities | 2 Ways | Using Standard Template | Leetcode 1079 | codestorywithMIK
Grid Game | Detailed Explanation | Complete Ry Run | Leetcode 2017 | codestorywithMIK
Check if Grid can be Cut into Sections | Merge Intervals | Leetcode 3394 | Leetcode 56 | Detailed
Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK
Maximum Absolute Sum of Any Subarray | Kadane's Algorithm | Leetcode 1749 | codestorywithMIK
Longest Unequal Adjacent Groups Subsequence I | Simple Intuition | Leetcode 2900 | codestorywithMIK
Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK
Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK
CANDY | 2 Approaches | O(1) Space | O(N) Space | AMAZON | Leetcode 135 | codestorywithMIK
Count Good Triplets in an Array | Segment Tree Concepts & Qns | Video 12 | Leetcode 2179 | MIK
Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK
Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK
Find All Possible Recipes from Given Supplies | Brute Force | Optimal | Leetcode 2115
Making A Large Island | Brute Force | Better | Optimal | Dry Run | Leetcode 827 | codestorywithMIK
Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK
Maximum Count of Positive Integer and Negative Integer | Leetcode 2529 | codestorywithMIK
Find Numbers With Even Number Of Digits | Multiple Ways | Leetcode 1295 | codestorywithMIK
Find Minimum Time to Reach Last Room II | Using Same Code | Leetcode 3342 | codestorywithMIK
Count Largest Group | Simple Simulation | Dry Run | Leetcode 1399 | codestorywithMIK
Divisible and Non-divisible Sums Difference | Constant Time | Leetcode 2894 | codestorywithMIK
Maximum Candies Allocated to K Children | Brute Force | Optimal | Leetcode 2226 | codestorywithMIK
Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK
Introduction | What | How | Difference Array Technique: Concepts & Questions - 1 | codestorywithMIK
Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK
Minimum Cost to Make at Least One Valid Path in a Grid| 2 Approaches | Leetcode 1368 | CodeWithShaaz
Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK
Trapping Rain Water II | Deep Dive Explanation | What | Why | How | Leetcode 407 | codestorywithMIK
K-th Smallest in Lexicographical Order | Super Detailed | Dry Run | Leetcode 440 | codestorywithMIK
Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK
Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK
Zero Array Transformation II | Brute Force | Better | Leetcode 3356 | codestorywithMIK
Number of Ways to Split Array | Simple Thought Process | Leetcode 2270 | codestorywithMIK
First Completely Painted Row or Column | Approaches | Detailed | Leetcode 2661 | CodeWithShaaz
Maximum Ascending Subarray Sum | Brute Force | Optimal | Leetcode 1800 | codestorywithMIK
Minimum Recolors to Get K Consecutive Black Blocks | 2 Approaches | Leetcode 2379 | codestorywithMIK
Check if Array Is Sorted and Rotated | 3 Approaches | Leetcode 1752 | codestorywithMIK
Count Servers that Communicate | 3 Detailed Approaches | Dry Runs | Leetcode 1267 | codestorywithMIK
Minimum Operations to Exceed Threshold Value II |Easy Explanation | Leetcode 3066 | codestorywithMIK
2025 Placement Roadmap | How I Would Have Prepared | Year 2025 Special | Happy New Year
First Completely Painted Row or Column | 3 Approaches | Detailed | Leetcode 2661 | codestorywithMIK
The k-th Lexicographical String of All Happy Strings of Length n | Leetcode 1415 |BOOTCODER
Count Symmetric Integers | 2 Detailed Approaches | Leetcode 2843 | codestorywithMIK
Number of Ways to Arrive at Destination | Straight Forward Simple | Leetcode 1976 | codestorywithMIK
Minimum Number of Operations to Make Elements in Array Distinct | 2 Approaches | Leetcode 3396 | MIK
Domino and Tromino Tiling | Detailed Explanations | Leetcode 790 | codestorywithMIK
Make Lexicographically Smallest Array by Swapping Elements | Brute Force | Optimal | Leetcode 2948
Minimized Maximum of Products Distributed to Any Store | Leetcode 2064 | codestorywithMIK
Minimum Number of Operations to Sort a Binary Tree by Level | Leetcode 2471 | codestorywithMIK
Minimum Operations to Make Array Values Equal to K | Detailed Thought Process | Leetcode 3375 | MIK
Three Consecutive Odds | Important Motivation | 2 Approaches | Leetcode 1550 | codestorywithMIK
Minimum Number of Operations to Move All Balls to Each Box | Leetcode 1769 | 3 Approaches | MIK