| 2024-09-22 | K-th Smallest in Lexicographical Order | Super Detailed | Dry Run | Leetcode 440 | codestorywithMIK | 0:00 | 9,975 | |
|
| 2024-09-21 | Lexicographical Numbers | Simple DFS | Leetcode 386 | codestorywithMIK | 0:00 | 8,523 | |
|
| 2024-09-20 | Shortest Palindrome | Multiple Ways | KMP Zindabaad | Leetcode 214 | codestorywithMIK | 0:00 | 10,000 | |
|
| 2024-09-19 | Different Ways to Add Parentheses | Simple Story To Code | Leetcode 241 | codestorywithMIK | 0:00 | 10,480 | |
|
| 2024-09-16 | Minimum Time Difference | Easy Approach | Detailed | Leetcode 539 | codestorywithMIK | 0:00 | 7,869 | |
|
| 2024-09-15 | DSA Shorts with MIK - 4 | 0:00 | 2,497 | |
|
| 2024-09-15 | Find the Longest Substring Containing Vowels in Even Counts | Leetcode 1371 | codestorywithMIK | 0:00 | 12,836 | | Counter-Strike: Source
|
| 2024-09-14 | DSA Shorts with MIK - 3 | 0:00 | 3,778 | |
|
| 2024-09-14 | Longest Subarray With Maximum Bitwise AND | Simple Observation | Leetcode 2419 | codestorywithMIK | 0:00 | 6,496 | |
|
| 2024-09-13 | XOR Queries of a Subarray | Simple Explanation | Leetcode 1310 | codestorywithMIK | 0:00 | 5,578 | |
|
| 2024-09-12 | Count the Number of Consistent Strings | Using Bit Manipulation | Leetcode 1684 | codestorywithMIK | 0:00 | 4,519 | |
|
| 2024-09-10 | Insert Greatest Common Divisors in Linked List | 2 Approaches | Leetcode 2807 | codestorywithMIK | 0:00 | 3,376 | |
|
| 2024-09-08 | Maximum Number of Moves to Kill All Pawns | Step By Step Detailed | Leetcode 3283 | codestorywithMIK | 0:00 | 2,969 | |
|
| 2024-09-08 | Leetcode Contest Qn-4 ka Khauf | 0:00 | 1,933 | |
|
| 2024-09-07 | Linked List in Binary Tree | Easy | Dry Run | Leetcode 1367 | codestorywithMIK | 0:00 | 7,018 | |
|
| 2024-09-06 | Delete Nodes From Linked List Present in Array | Simple | Dry Run | Leetcode 3217 | codestorywithMIK | 0:00 | 4,522 | |
|
| 2024-09-04 | Walking Robot Simulation | Detailed Simulation | Leetcode 874 | codestorywithMIK | 0:00 | 8,447 | |
|
| 2024-09-02 | Find the Student that Will Replace the Chalk | 2 Ways | Leetcode 1894 | codestorywithMIK | 0:00 | 5,484 | |
|
| 2024-09-01 | DSA Shorts with MIK - 2 | 0:00 | 2,435 | |
|
| 2024-09-01 | Convert 1D Array Into 2D Array | 2 Approaches | Leetcode 2022 | codestorywithMIK | 0:00 | 3,969 | |
|
| 2024-08-31 | Palindrome Partitioning II | Using Blue Print | DP On Strings | Leetcode 132 | DP Concepts & Qns-28 | 0:00 | 1,725 | |
|
| 2024-08-30 | Modify Graph Edge Weights | Using Dijkstra | Thought Process | Leetcode 2699 | codestorywithMIK | 0:00 | 8,993 | |
|
| 2024-08-29 | Most Stones Removed with Same Row or Column | Using DSU | DRY RUN | Leetcode 947 | codestorywithMIK | 0:00 | 6,314 | |
|
| 2024-08-28 | Count Sub Islands | Easiest Thought Process | Leetcode 1905 | codestorywithMIK | 0:00 | 7,019 | | Counter-Strike: Source
|
| 2024-08-25 | Travel Tales | 0:00 | 1,358 | |
|
| 2024-08-24 | Find the Closest Palindrome | Simple Observations | Leetcode 564 | codestorywithMIK | 0:00 | 9,001 | |
|
| 2024-08-23 | Fraction Addition and Subtraction | Simple Simulation | Leetcode 592 | codestorywithMIK | 0:00 | 10,868 | |
|
| 2024-08-22 | DSA Shorts with MIK - 1 | 0:00 | 2,611 | |
|
| 2024-08-22 | Number Complement | Multiple Approaches | Leetcode 476 | codestorywithMIK | 0:00 | 5,856 | |
|
| 2024-08-19 | 2 Keys Keyboard | Detailed Explanations | Leetcode 650 | codestorywithMIK | 0:00 | 8,381 | |
|
| 2024-08-18 | Count Substrings That Satisfy K-Constraint I & II | Detailed Explanation | Leetcode 3258 & 3261 | 0:00 | 4,506 | |
|
| 2024-08-17 | The Imperial Delhi | Weekend Getaway | Luxury Stay | 5 Star hotel | WeekendWithMik | 0:00 | 6,485 | |
|
| 2024-08-17 | Maximum Number of Points with Cost | Detailed Explanation | Leetcode 1937 | codestorywithMIK | 0:00 | 11,399 | |
|
| 2024-08-16 | Maximum Distance in Arrays | Leetcode 624 | codestorywithMIK | 0:00 | 6,824 | |
|
| 2024-08-14 | Lemonade Change | Leetcode 860 | codestorywithMIK | 0:00 | 4,082 | | Counter-Strike: Source
|
| 2024-08-13 | Find K-th Smallest Pair Distance | Multiple Approaches | Leetcode 719 | codestorywithMIK | 0:00 | 10,994 | |
|
| 2024-08-12 | Combination Sum II | Simple Khandani Template | Leetcode 40 | codestorywithMIK | 0:00 | 8,215 | |
|
| 2024-08-10 | Regions Cut By Slashes | Already Studied Concept | Easy Code | Leetcode 959 | codestorywithMIK | 0:00 | 10,139 | |
|
| 2024-08-10 | Minimum Number of Days to Disconnect Island | Studied Concept | Leetcode 1568 | codestorywithMIK | 0:00 | 10,878 | |
|
| 2024-08-09 | Thank you 60,000 Subscribers ❤️ | 0:00 | 514 | |
|
| 2024-08-09 | Magic Squares In Grid | Simple Approach | Clean Code | Leetcode 840 | codestorywithMIK | 0:00 | 7,671 | |
|
| 2024-08-07 | Spiral Matrix III | Simple Simulation | Made Easy | Leetcode 885 | codestorywithMIK | 0:00 | 11,708 | |
|
| 2024-08-06 | Integer to English Words | Story To Code | Leetcode 273 | codestorywithMIK | 0:00 | 11,087 | |
|
| 2024-08-04 | Happy Friendship Day ❤️ | 0:04 | 657 | |
|
| 2024-08-04 | Range Sum of Sorted Subarray Sums | Learning Something New | Leetcode 1508 | codestorywithMIK | 35:31 | 8,799 | |
|
| 2024-08-02 | Make Two Arrays Equal by Reversing Subarrays | Easy | Leetcode 1460 | codestorywithMIK | 12:02 | 3,882 | |
|
| 2024-08-01 | Minimum Swaps to Group All 1's Together II | 2 Ways | Dry Runs | Leetcode 2134 | codestorywithMIK | 25:57 | 10,513 | |
|
| 2024-07-30 | Filling Bookcase Shelves | Recursion Memoization | Why not Greedy | Leetcode 1105 | codestorywithMIK | 29:49 | 11,465 | |
|
| 2024-07-29 | Minimum Deletions to Make String Balanced | Multiple Approaches | Leetcode 1653 | codestorywithMIK | 34:00 | 9,428 | |
|
| 2024-07-28 | Count Number of Teams | Simple thought process | Intuition | Leetcode 1395 | 24:13 | 9,321 | |
|
| 2024-07-27 | Second Minimum Time to Reach Destination | 2 Approaches | FULL DRY RUN | Leetcode 2045 | 1:05:57 | 7,935 | |
|
| 2024-07-25 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | 3 Ways | Leetcode 1334 | 38:58 | 6,845 | | Threshold
|
| 2024-07-23 | Sort the Jumbled Numbers | 2 Approaches | Leetcode 2191 | codestorywithMIK | 27:05 | 6,473 | |
|
| 2024-07-21 | Minimum Operations to Make Array Equal to Target | Minimum Number of Increments|Leetcode 3229 & 1526 | 45:23 | 4,020 | |
|
| 2024-07-20 | Palindrome Partitioning | Using Blue Print | DP On Strings | Leetcode 131 | DP Concepts & Qns-27 | 35:55 | 1,690 | |
|
| 2024-07-20 | Build a Matrix With Conditions | BFS | DFS | Detailed Explanation | Leetcode 2392 | codestorywithMIK | 40:50 | 7,367 | |
|
| 2024-07-19 | Number of Good Leaf Nodes Pairs | Simple DFS | Dry Run | Leetcode 1530 | codestorywithMIK | 31:30 | 1,778 | |
|
| 2024-07-19 | Find Valid Matrix Given Row and Column Sums | Simple Approach | Leetcode 1605 | codestorywithMIK | 0:00 | 7,204 | |
|
| 2024-07-18 | Lucky Numbers in a Matrix | 2 Approaches | Dry Run | Leetcode 1380 | codestorywithMIK | 23:54 | 4,656 | |
|
| 2024-07-17 | Number of Good Leaf Nodes Pairs | Using Graph And BFS | Dry Run | Leetcode 1530 | codestorywithMIK | 28:54 | 9,147 | |
|
| 2024-07-15 | Step-By-Step Directions From a Binary Tree Node to Another | 2 Approaches | Leetcode 2096 | 34:05 | 9,338 | |
|
| 2024-07-14 | Create Binary Tree From Descriptions | Simplest Approach | Leetcode 2196 | codestorywithMIK | 19:14 | 7,073 | |
|
| 2024-07-13 | Robot Collisions | Made Easy | Dry Run | Leetcode 2751 | codestorywithMIK | 35:30 | 7,645 | |
|
| 2024-07-13 | Range Sum Query - Mutable | Leetcode 307 | Segment Tree Concepts & Qns | Video 8 | codestorywithMIK | 17:17 | 1,382 | |
|
| 2024-07-13 | Minimum Cost for Cutting Cake I & II | Thought Process | Leetcode 3218 | 3219 | codestorywithMIK | 39:26 | 3,851 | |
|
| 2024-07-13 | Number of Atoms | Made Easy | Full Dry Run | Leetcode 726 | Google | codestorywithMIK | 0:00 | 9,578 | |
|
| 2024-07-13 | Minimum Insertion Steps to Make a String Palindrome | Blue Print | DP On Strings | Leetcode 1312 | 0:00 | 1,487 | |
|
| 2024-07-12 | Maximum Score From Removing Substrings | 2 Approaches | With Proof | Leetcode 1717 | 40:33 | 7,660 | |
|
| 2024-07-10 | Reverse Substrings Between Each Pair of Parentheses | 2 Approaches | Leetcode 1190 |codestorywithMIK | 35:54 | 7,902 | |
|
| 2024-07-09 | Crawler Log Folder | 2 Approaches | Dry Runs | Leetcode 1598 | codestorywithMIK | 15:01 | 3,869 | |
|
| 2024-07-08 | Average Waiting Time | Simple Simulation | Leetcode 1701 | codestorywithMIK | 17:02 | 5,418 | |
|
| 2024-07-07 | Find the Winner of the Circular Game | 3 Approaches | Leetcode 1823 | codestorywithMIK | 34:34 | 8,291 | |
|
| 2024-07-07 | Range Update Query | Lazy Propagation | Segment Tree Concepts & Qns | Video 7 | codestorywithMIK | 49:06 | 2,232 | |
|
| 2024-07-06 | Water Bottles | 3 Approaches | Easy Explanations | Leetcode 1518 | codestorywithMIK | 30:53 | 4,852 | |
|
| 2024-07-06 | Pass the Pillow | 2 Approaches | Easy Explanations | Leetcode 2582 | codestorywithMIK | 24:09 | 4,319 | |
|
| 2024-07-03 | Merge Nodes in Between Zeros | 2 Approaches | Leap Of Faith | Leetcode 2181 | codestorywithMIK | 21:35 | 4,498 | |
|
| 2024-07-03 | Minimum Difference Between Largest and Smallest Value in Three Moves | 2 Approaches | Leetcode 1509 | 31:36 | 6,912 | |
|
| 2024-07-01 | Intersection of Two Arrays II | 2 Approaches | Easy Explanations | Leetcode 350 | codestorywithMIK | 14:10 | 5,528 | |
|
| 2024-06-30 | Longest Palindromic Subsequence | Using Blue Print | DP On Strings | Leetcode 516 | DP Concepts - 25 | 17:04 | 2,037 | |
|
| 2024-06-29 | Range Minimum Query | Segment Tree Concepts & Qns | Video 6 | codestorywithMIK | 14:24 | 2,112 | |
|
| 2024-06-29 | Longest Palindromic Substring | Recursion Memo | Bottom Up | DP On Strings | Leetcode 5 | 47:31 | 4,173 | |
|
| 2024-06-29 | Query Sum II | Segment Tree Concepts & Qns | Video 5 | codestorywithMIK | 18:47 | 1,976 | |
|
| 2024-06-28 | All Ancestors of a Node in a Directed Acyclic Graph | 3 Approaches | Leetcode 2192 |codestorywithMIK | 42:56 | 6,878 | |
|
| 2024-06-27 | Maximum Total Importance of Roads | Thought Process | Leetcode 2285 | codestorywithMIK | 21:59 | 5,824 | |
|
| 2024-06-26 | Find Center of Star Graph | 2 Simple Approaches | Leetcode 1791 | codestorywithMIK | 11:51 | 4,394 | |
|
| 2024-06-25 | Balance a Binary Search Tree | Simple Explanation | Leetcode 1382 | codestorywithMIK | 14:11 | 6,973 | |
|
| 2024-06-24 | Minimum Number of K Consecutive Bit Flips | 3 Approaches | Detailed | Leetcode 995 | 3191 | 1:03:24 | 9,618 | |
|
| 2024-06-24 | Binary Search Tree to Greater Sum Tree | Brute | Better | Optimal | Leetcode 1038 | codestorywithMIK | 27:37 | 6,063 | |
|
| 2024-06-23 | Segment Tree | Why size is 4*n | With Proof | Video 4 | 14:30 | 2,151 | |
|
| 2024-06-22 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Leetcode 1438 |Detailed | 49:01 | 10,048 | |
|
| 2024-06-22 | Count Number of Nice Subarrays | 2 Approaches | Similar Concept | Leetcode 1248 | codestorywithMIK | 32:49 | 8,014 | |
|
| 2024-06-20 | Grumpy Bookstore Owner | Simplest Thought Process | Leetcode 1052 | codestorywithMIK | 29:24 | 8,986 | |
|
| 2024-06-19 | Magnetic Force Between Two Balls | Simple Thought Process | Leetcode 1552 | codestorywithMIK | 25:02 | 9,805 | |
|
| 2024-06-18 | Segment Tree | Range Sum Query | Story To Code | Video 3 | 29:00 | 3,274 | |
|
| 2024-06-18 | Minimum Number of Days to Make m Bouquets | Simple Thought Process| Leetcode 1482 | codestorywithMIK | 25:55 | 8,449 | |
|
| 2024-06-17 | Most Profit Assigning Work | Multiple Approaches | With Intuition | Leetcode 826 | codestorywithMIK | 37:27 | 8,093 | |
|
| 2024-06-17 | Segment Tree | Update Query | Story To Code | Video 2 | 22:23 | 3,946 | |
|
| 2024-06-16 | Segment Tree | Introduction | Basics | Build Segment Tree | Video 1 | codestorywithMIK | 54:43 | 9,580 | |
|
| 2024-06-15 | Patching Array | Thought Process | Dry Runs | GOOGLE | Leetcode 330 | codestorywithMIK | 32:02 | 10,321 | |
|
| 2024-06-14 | Minimum Increment to Make Array Unique | Sorting | Counting Sort | Leetcode 945 | codestorywithMIK | 29:00 | 5,192 | |
|
