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
DSA Shorts with MIK - 10 | Avoid TLE in Competitive Programming with Fast I/O | Part 1
Divisible and Non-divisible Sums Difference | Constant Time | Leetcode 2894 | codestorywithMIK
Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK
Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK
Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 |codestorywithMIK
Count Subarrays With Score Less Than K | Khandani Template Simple | Leetcode 2302 | codestorywithMIK
Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK
Count Complete Subarrays in an Array | Khandani Template | Dry Run | Leetcode 2799 |codestorywithMIK
Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK
Find Minimum Time to Reach Last Room I | Detailed Explanation | Leetcode 3341 | codestorywithMIK
Total Characters in String After Transformations I | Made Easy | Leetcode 3335 | codestorywithMIK
Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK
Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK
Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK
Push Dominoes | Simplest Intuition | Complete Dry Run | Leetcode 838 | codestorywithMIK
Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK
Count the Number of Good Subarrays | Thought Process | Khandani Template | Leetcode 2537 | MIK
Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK
Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK
Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | codestorywithMIK
Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK
Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK
Count of Substrings Containing Every Vowel and K Consonants II | Leetcode 3306 | codestorywithMIK
Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK
Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK
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 Good Triplets in an Array | Segment Tree Concepts & Qns | Video 12 | Leetcode 2179 | MIK
Count Equal and Divisible Pairs in an Array | Brute Force | Optimal | Detailed Maths | Leetcode 2176
DSA Shorts with MIK - 11 | Avoid TLE in Competitive Programming with Fast I/O 🔥 | Part 2
Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | codestorywithMIK
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
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
Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK
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
Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK
Minimum Number of Operations to Make Elements in Array Distinct | 2 Approaches | Leetcode 3396 | MIK
Longest Nice Subarray | Brute Force | Better | Optimal | Dry Runs | Leetcode 2401 | codestorywithMIK
Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK
Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK
Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK
Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK
Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK
Best Sightseeing Pair | 3 Approaches | Detailed For Beginners | Leetcode 1014 | codestorywithMIK
Count Symmetric Integers | 2 Detailed Approaches | Leetcode 2843 | codestorywithMIK