2025-06-12 | Maximum Difference Between Adjacent Elements in a Circular Array | Leetcode 3423 | codestorywithMIK | 0:00 | 2,056 | |
|
2025-06-11 | Maximum Difference Between Even and Odd Frequency II | Super Detailed | Leetcode 3445 | MIK | 0:00 | 8,920 | |
|
2025-06-10 | Monotonic Queue | Template | Detailed Dry Runs | Related Problems | codestorywithMIK | 0:00 | 774 | |
|
2025-06-10 | What are Monotonic Data Structures | Monotonic Stack | Template | codestorywithMIK | 0:00 | 1,223 | |
|
2025-06-10 | Introduction to Monotonic Data Structures | Roadmap | Applications | codestorywithMIK | 0:00 | 1,602 | |
|
2025-06-10 | Write Down Your Dream | codestorywithMIK | 0:00 | 1,186 | |
|
2025-06-08 | Burden of being Average | codestorywithMIK | 0:00 | 3,157 | |
|
2025-06-08 | Debug by Day, Deadlift by Night | codestorywithMIK | 0:00 | 5,477 | |
|
2025-06-07 | Achanak se yaad agaya | Leetcode POTD | codestorywithMIK | 0:00 | 17,360 | |
|
2025-06-07 | A Message | Travel Tales | codestorywithMIK | 0:00 | 4,969 | |
|
2025-06-06 | Using a Robot to Print the Lexicographically Smallest String | Thought Process | Leetcode 2434 | MIK | 0:00 | 8,826 | |
|
2025-06-04 | Find the Lexicographically Largest String From the Box I | Another Approach | Leetcode 3403 | MIK | 0:00 | 5,570 | |
|
2025-06-04 | Find the Lexicographically Largest String From the Box I | Thought Process | Leetcode 3403 | MIK | 0:00 | 8,623 | |
|
2025-06-03 | Maximum Candies You Can Get from Boxes | 2 Ways | Simple Intuition | Leetcode 1298 |codestorywithMIK | 0:00 | 7,027 | |
|
2025-06-01 | Distribute Candies Among Children II | 4 Approaches | Detailed | Leetcode 2929 | codestorywithMIK | 0:00 | 11,524 | |
|
2025-05-31 | DP bole to Dynamic Programming 🥹 | codestorywithMIK | 0:00 | 27,463 | |
|
2025-05-29 | Maximize the Number of Target Nodes After Connecting Trees II | Full Dry Run | Leetcode 3373 | MIK | 0:00 | 5,236 | |
|
2025-05-28 | Maximize the Number of Target Nodes After Connecting Trees I | BFS | DFS | Leetcode 3372 | MIK | 0:00 | 8,768 | |
|
2025-05-27 | Are bhai 🥹❤️🙏 | 0:00 | 23,389 | |
|
2025-05-27 | How it feels being good at DSA + Dev 🔥🔥 | codestorywithMIK | 0:00 | 15,138 | |
|
2025-05-27 | Maje hi Maje | DSA | HLD | LLD | codestorywithMIK | 0:00 | 10,273 | |
|
2025-05-27 | Divisible and Non-divisible Sums Difference | Constant Time | Leetcode 2894 | codestorywithMIK | 0:00 | 3,174 | |
|
2025-05-25 | Struggling With Logic in Coding ? Watch This Before Your Next LeetCode Question | codestorywithMIK | 0:00 | 8,611 | |
|
2025-05-25 | Avoid using Global Variables | codestorywithMIK | 0:00 | 8,024 | |
|
2025-05-25 | Longest Palindrome by Concatenating Two Letter Words | Simple Way | Leetcode 2131 | codestorywithMIK | 0:00 | 8,074 | |
|
2025-05-24 | Sometimes rejection is just redirection | codestorywithMIK | 0:00 | 10,947 | |
|
2025-05-24 | What is Lambda Capture | C++ | Java | Leetcode 2942 | codestorywithMIK | 0:00 | 4,574 | |
|
2025-05-23 | Can you guess ? | 0:00 | 26,548 | |
|
2025-05-23 | Interviewer : Bhai kitni salary loge 🥺 | 0:00 | 12,118 | |
|
2025-05-21 | Set Matrix Zeroes | Multiple Approaches | Leetcode 73 | codestorywithMIK | 0:00 | 4,465 | |
|
2025-05-20 | Array k aaage koi bol sakta hai kya | codestorywithMIK | 0:00 | 19,331 | |
|
2025-05-20 | Zero Array Transformation I | Brute Force | Optimal | Leetcode 3356 | codestorywithMIK | 0:00 | 10,613 | |
|
2025-05-19 | Type of Triangle | Simple Explanation | Leetcode 3024 | codestorywithMIK | 0:00 | 2,724 | |
|
2025-05-18 | Painting a Grid With Three Different Colors | Thought Process | Leetcode 1931 | codestorywithMIK | 0:00 | 9,284 | |
|
2025-05-16 | Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK | 0:00 | 9,062 | |
|
2025-05-16 | Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK | 0:00 | 4,338 | |
|
2025-05-15 | Longest Unequal Adjacent Groups Subsequence I | Simple Intuition | Leetcode 2900 | codestorywithMIK | 0:00 | 5,327 | |
|
2025-05-14 | Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK | 0:00 | 4,492 | | Counter-Strike: Source
|
2025-05-14 | Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK | 0:00 | 5,057 | |
|
2025-05-13 | Total Characters in String After Transformations I | Made Easy | Leetcode 3335 | codestorywithMIK | 0:00 | 11,743 | | Counter-Strike: Source
|
2025-05-12 | Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | codestorywithMIK | 0:00 | 7,738 | |
|
2025-05-11 | Three Consecutive Odds | Important Motivation | 2 Approaches | Leetcode 1550 | codestorywithMIK | 0:00 | 2,100 | |
|
2025-05-10 | Dungeon Game | Brute Force | Recursion | Memo | Bottom Up | Leetcode 174 | DP On Grids | MIK | 0:00 | 1,859 | | Brute Force
|
2025-05-10 | This Is Your Sign to Keep Going |Motivation | codestorywithMIK | 0:00 | 10,819 | |
|
2025-05-10 | Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK | 0:00 | 5,280 | |
|
2025-05-09 | Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK | 0:00 | 7,495 | |
|
2025-05-08 | Find Minimum Time to Reach Last Room II | Using Same Code | Leetcode 3342 | codestorywithMIK | 0:00 | 5,295 | |
|
2025-05-07 | No Loop Needed | Find Min & Max in 1 Line using STL | C++ Competitive Programming Hack | 0:00 | 3,695 | |
|
2025-05-07 | Find Minimum Time to Reach Last Room I | Detailed Explanation | Leetcode 3341 | codestorywithMIK | 0:00 | 10,298 | |
|
2025-05-06 | Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 |codestorywithMIK | 0:00 | 4,766 | |
|
2025-05-04 | Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK | 0:00 | 2,598 | |
|
2025-05-04 | Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK | 0:00 | 5,589 | |
|
2025-05-03 | Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK | 0:00 | 6,247 | |
|
2025-05-02 | Push Dominoes | Simplest Intuition | Complete Dry Run | Leetcode 838 | codestorywithMIK | 0:00 | 8,360 | | Dominoes
|
2025-05-01 | Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK | 0:00 | 10,339 | | Counter-Strike: Source
|
2025-04-30 | Find Numbers With Even Number Of Digits | Multiple Ways | Leetcode 1295 | codestorywithMIK | 0:00 | 2,760 | |
|
2025-04-28 | Count Subarrays With Score Less Than K | Khandani Template Simple | Leetcode 2302 | codestorywithMIK | 0:00 | 6,588 | |
|
2025-04-27 | Count Subarrays of Length Three With a Condition | Easy | Leetcode 3392 | codestorywithMIK | 0:00 | 2,812 | |
|
2025-04-25 | Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK | 0:00 | 9,295 | |
|
2025-04-24 | Count Complete Subarrays in an Array | Khandani Template | Dry Run | Leetcode 2799 |codestorywithMIK | 0:00 | 6,707 | |
|
2025-04-23 | Count Largest Group | Simple Simulation | Dry Run | Leetcode 1399 | codestorywithMIK | 0:00 | 6,307 | |
|
2025-04-22 | Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK | 0:00 | 6,676 | |
|
2025-04-22 | Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK | 0:00 | 4,228 | |
|
2025-04-21 | Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK | 0:00 | 10,750 | | The Hidden
|
2025-04-20 | Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK | 0:00 | 7,734 | |
|
2025-04-17 | Count Equal and Divisible Pairs in an Array | Brute Force | Optimal | Detailed Maths | Leetcode 2176 | 0:00 | 5,638 | | Brute Force
|
2025-04-16 | Count the Number of Good Subarrays | Thought Process | Khandani Template | Leetcode 2537 | MIK | 0:00 | 10,022 | |
|
2025-04-15 | Count Good Triplets in an Array | Segment Tree Concepts & Qns | Video 12 | Leetcode 2179 | MIK | 0:00 | 7,437 | |
|
2025-04-14 | Count Good Triplets | Simple Approach | Slight Improvements | Leetcode 1534 | codestorywithMIK | 0:00 | 6,644 | |
|
2025-04-12 | Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK | 0:00 | 9,301 | |
|
2025-04-11 | Count Symmetric Integers | 2 Detailed Approaches | Leetcode 2843 | codestorywithMIK | 0:00 | 5,831 | |
|
2025-04-10 | Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK | 0:00 | 11,421 | |
|
2025-04-09 | Youtube Audio Track Feature | Change Audio Language | codestorywithMIK | 0:00 | 3,326 | |
|
2025-04-08 | Minimum Number of Operations to Make Elements in Array Distinct | 2 Approaches | Leetcode 3396 | MIK | 0:00 | 5,308 | |
|
2025-04-07 | Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK | 0:00 | 5,475 | | Counter-Strike: Source
|
2025-04-04 | Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK | 0:00 | 8,607 | |
|
2025-04-02 | Auto-translate the captions to any language | YouTube | 0:00 | 1,653 | |
|
2025-04-02 | Maximum Value of an Ordered Triplet I | Multiple Approaches | Leetcode 2873 | codestorywithMIK | 0:00 | 9,476 | |
|
2025-03-30 | Legends aren't defined by their successes | 0:00 | 1,666 | |
|
2025-03-30 | Find Median of X Sized Subarrays | Weekly Contest 443 | Hint To Qn 4 | Detailed | codestorywithMIK | 0:00 | 2,363 | |
|
2025-03-30 | Partition Labels | 2 Clean Approaches | Leetcode 763 | codestorywithMIK | 0:00 | 6,561 | |
|
2025-03-29 | Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK | 0:00 | 7,748 | |
|
2025-03-29 | Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK | 0:00 | 3,460 | |
|
2025-03-27 | Find the K-th Largest or Smallest in O(n) using nth_element | Competitive Programming Hack | 0:00 | 2,392 | |
|
2025-03-27 | Minimum Index of a Valid Split | 2 Approaches | Leetcode 2780 | codestorywithMIK | 0:00 | 7,021 | |
|
2025-03-26 | Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK | 0:00 | 7,149 | |
|
2025-03-25 | Check if Grid can be Cut into Sections | Merge Intervals | Leetcode 3394 | Leetcode 56 | Detailed | 0:00 | 8,215 | |
|
2025-03-24 | Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK | 0:00 | 6,828 | |
|
2025-03-23 | Number of Ways to Arrive at Destination | Straight Forward Simple | Leetcode 1976 | codestorywithMIK | 0:00 | 6,123 | |
|
2025-03-22 | Why I Will NEVER Promote Paid DSA Courses! 🚫 The Truth You Need to Know | codestorywithMIK | 0:00 | 6,784 | |
|
2025-03-22 | Count the Number of Complete Components | Multiple Approaches | Leetcode 2685 | codestorywithMIK | 0:00 | 5,844 | |
|
2025-03-21 | Find All Possible Recipes from Given Supplies | Brute Force | Optimal | Leetcode 2115 | 0:00 | 7,733 | | Brute Force
|
2025-03-18 | Longest Nice Subarray | Brute Force | Better | Optimal | Dry Runs | Leetcode 2401 | codestorywithMIK | 0:00 | 12,193 | | Brute Force
|
2025-03-17 | Divide Array Into Equal Pairs | 5 Approaches | Leetcode 2206 | codestorywithMIK | 0:00 | 4,296 | |
|
2025-03-16 | Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK | 0:00 | 9,000 | |
|
2025-03-15 | House Robber IV | Brute Force | Optimal | Leetcode 2560 | codestorywithMIK | 0:00 | 9,900 | | Brute Force
|
2025-03-14 | DSA Shorts with MIK - 11 | Avoid TLE in Competitive Programming with Fast I/O 🔥 | Part 2 | 0:00 | 2,277 | |
|
2025-03-14 | Maximum Candies Allocated to K Children | Brute Force | Optimal | Leetcode 2226 | codestorywithMIK | 0:00 | 7,202 | | Brute Force
|
2025-03-13 | Zero Array Transformation II | Brute Force | Better | Leetcode 3356 | codestorywithMIK | 0:00 | 12,859 | | Brute Force
|
2025-03-12 | Maximum Count of Positive Integer and Negative Integer | Leetcode 2529 | codestorywithMIK | 0:00 | 4,150 | |
|