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 ...
Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | codestorywithMIK
Push Dominoes | Simplest Intuition | Complete Dry Run | Leetcode 838 | codestorywithMIK
Total Characters in String After Transformations I | Made Easy | Leetcode 3335 | codestorywithMIK
Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK
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
Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK
Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK
Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK
Find Minimum Time to Reach Last Room I | Detailed Explanation | Leetcode 3341 | codestorywithMIK
Find Numbers With Even Number Of Digits | Multiple Ways | Leetcode 1295 | codestorywithMIK
Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
More to come soon #coding #hoodie #fashion #winteriscoming #winterishere #leetcode #codestorywithMIK
Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK
Total Characters in String After Transformations I | Made Easy | Leetcode 3335 | codestorywithMIK
Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK
Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK
Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK
Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK
Find Minimum Time to Reach Last Room II | Using Same Code | Leetcode 3342 | codestorywithMIK
Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK
Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK
I Tell Stories ⚡️ #story #code #storytocode #codestorywithMIK #dsa #india #leetcode #datastructures
Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK
Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK
Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK