- Also available on topmate.io for 1-1 sessions - https://topmate.io/mazhar_mik (Currently Inactive due to tight schedule)
- I am on a mission to make a Super Resource for Interview Prep for everyone. 🏁 One stop Solution for :
------- System Design
------- Data Structures and Algorithms
- I specialize for building INTUITION and giving reasons behind each and every line.

Most Viewed Games

Brute Force

113,748 views

14 videos

0:00

Counter-Strike: Source

34,577 views

5 videos

19:16

The Grid

16,976 views

2 videos

0:00

XOR

13,289 views

2 videos

0:00

[ More ]

Latest Videos

Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK

2025-04-25 1:17:22 PM ● 673 views ● 0:00

Count Complete Subarrays in an Array | Khandani Template | Dry Run | Leetcode 2799 |codestorywithMIK

2025-04-24 1:30:58 AM ● 5,762 views ● 0:00

Count Largest Group | Simple Simulation | Dry Run | Leetcode 1399 | codestorywithMIK

2025-04-23 12:55:24 AM ● 5,937 views ● 0:00

Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK

2025-04-22 4:07:43 PM ● 5,921 views ● 0:00

Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK

2025-04-22 10:38:08 AM ● 3,964 views ● 0:00

Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK

2025-04-21 2:01:10 AM ● 10,445 views ● 0:00

The Hidden (2007)

Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK

2025-04-20 6:49:47 AM ● 7,734 views ● 0:00

Count Equal and Divisible Pairs in an Array | Brute Force | Optimal | Detailed Maths | Leetcode 2176

2025-04-17 7:27:33 AM ● 5,638 views ● 0:00

Brute Force (2003)

Count the Number of Good Subarrays | Thought Process | Khandani Template | Leetcode 2537 | MIK

2025-04-16 1:56:21 AM ● 10,022 views ● 0:00

Count Good Triplets in an Array | Segment Tree Concepts & Qns | Video 12 | Leetcode 2179 | MIK

2025-04-15 1:51:57 PM ● 7,437 views ● 0:00

[ More ]