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 | Minimum Cost for Cutting Cake I & II | Thought Process | Leetcode 3218 | 3219 | codestorywithMIK | 39:26 | 3,851 | |
|
2024-07-13 | Robot Collisions | Made Easy | Dry Run | Leetcode 2751 | codestorywithMIK | 35:30 | 7,645 | |
|
2024-07-13 | Minimum Insertion Steps to Make a String Palindrome | Blue Print | DP On Strings | Leetcode 1312 | 0:00 | 1,487 | |
|
2024-07-13 | Number of Atoms | Made Easy | Full Dry Run | Leetcode 726 | Google | codestorywithMIK | 0:00 | 9,578 | |
|
2024-07-13 | Range Sum Query - Mutable | Leetcode 307 | Segment Tree Concepts & Qns | Video 8 | codestorywithMIK | 17:17 | 1,382 | |
|
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 | Range Update Query | Lazy Propagation | Segment Tree Concepts & Qns | Video 7 | codestorywithMIK | 49:06 | 2,232 | |
|
2024-07-07 | Find the Winner of the Circular Game | 3 Approaches | Leetcode 1823 | codestorywithMIK | 34:34 | 8,291 | |
|
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 | Query Sum II | Segment Tree Concepts & Qns | Video 5 | codestorywithMIK | 18:47 | 1,976 | |
|
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-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 | IPO | Easy Beginner Friendly | Story To Code | Leetcode 502 | codestorywithMIK | 29:52 | 9,237 | |
|
2024-06-14 | Minimum Increment to Make Array Unique | Sorting | Counting Sort | Leetcode 945 | codestorywithMIK | 29:00 | 5,192 | |
|
2024-06-13 | Minimum Number of Moves to Seat Everyone | Counting Sort | Sort | Leetcode 2037 | codestorywithMIK | 21:39 | 4,229 | |
|
2024-06-10 | Relative Sort Array | Counting Sort | Using Lambda | Leetcode 1122 | codestorywithMIK | 20:15 | 5,760 | |
|
2024-06-07 | How codestorywithMIK was started | Motivation | Rejections | 50K Special | 21:30 | 7,041 | |
|
2024-06-07 | Replace Words | Using TRIE | Uber | Leetcode 648 | codestorywithMIK | 22:48 | 3,752 | |
|
2024-06-06 | Replace Words | Using HashSet | Uber | Leetcode 648 | codestorywithMIK | 14:34 | 6,318 | |
|
2024-06-05 | Hand of Straights | Simple Thought Process | Google | Leetcode 846 | codestorywithMIK | 18:31 | 8,845 | |
|
2024-06-04 | Find Common Characters | Simple Dry Run | Leetcode 1002 | codestorywithMIK | 13:11 | 7,527 | |
|
2024-06-04 | Find Subarray With Bitwise AND Closest to K | Sliding Window | Leetcode 3171 | codestorywithMIK | 1:00:23 | 2,738 | |
|
2024-06-03 | We hit 50K ❤️🙏 | 0:30 | 1,966 | |
|
2024-06-03 | Longest Palindrome | 3 Easy Approaches | Leetcode 409 | codestorywithMIK | 19:16 | 5,165 | | Counter-Strike: Source
|
2024-06-02 | Append Characters to String to Make Subsequence | Simple Approach | Leetcode 2486 | codestorywithMIK | 6:56 | 4,299 | |
|
2024-06-01 | Lexicographically Minimum String After Removing Stars | Easy | Leetcode 3170 | codestorywithMIK | 23:42 | 3,621 | |
|
2024-05-30 | Single Number III | Detailed Explanation | Leetcode 260 | codestorywithMIK | 25:54 | 6,222 | |
|
2024-05-29 | Count Triplets That Can Form Two Arrays of Equal XOR | Leetcode 1442 | codestorywithMIK | 24:04 | 7,636 | |
|
2024-05-28 | Number of Steps to Reduce a Number in Binary Representation to One | 2 Approaches | Leetcode 1404 | 31:58 | 6,656 | |
|
2024-05-27 | Get Equal Substrings Within Budget | Classic Sliding Window | Leetcode 1208 | codestorywithMIK | 20:09 | 5,658 | |
|
2024-05-26 | Special Array With X Elements Greater Than or Equal X | 3 Approaches |Leetcode 1608|codestorywithMIK | 37:05 | 5,983 | |
|
2024-05-25 | Student Attendance Record II | Recursion | Memoization | Bottom Up | Leetcode 552 | codestorywithMIK | 40:53 | 6,230 | |
|
2024-05-08 | Relative Ranks | 3 Approaches | Leetcode 506 | codestorywithMIK | 30:38 | 3,760 | |
|
2024-05-07 | Double a Number Represented as a Linked List | 4 Approaches | Story|Leetcode 2816 | codestorywithMIK | 43:12 | 3,197 | |
|
2024-05-06 | Remove Nodes From Linked List | 3 Detailed Approaches | Story | Leetcode 2487 | codestorywithMIK | 31:29 | 4,243 | |
|
2024-05-05 | Thank you from the bottom of my heart ❤️🙏 #codestorywithmik | 0:07 | 649 | |
|
2024-05-03 | Compare Version Numbers | stringstream | StringTokenizer | C++ | JAVA |Leetcode 165|codestorywithMIK | 23:20 | 4,456 | |
|
2024-05-02 | Largest Positive Integer That Exists With Its Negative |4 Approaches|Leetcode 2441 |codestorywithMIK | 28:04 | 2,980 | |
|
2024-05-01 | Reverse Prefix of Word | Detail on reverse Function | Leetcode 2000 | codestorywithMIK | 7:47 | 2,044 | |
|
2024-04-30 | Number of Wonderful Substrings | Clear Intuition | Full Dry Run | Leetcode 1915 | codestorywithMIK | 38:20 | 9,085 | |
|
2024-04-29 | Minimum Number of Operations to Make Array XOR Equal to K | Easy | Leetcode 2997 | codestorywithMIK | 11:09 | 3,767 | |
|
2024-04-28 | Travel Mood 🌍 #codestorywithmik | 0:15 | 961 | |
|
2024-04-27 | Freedom Trail | Recursion | Memoization | Bottom Up | Detailed | Leetcode 514 | codestorywithMIK | 1:01:27 | 5,104 | |
|
2024-04-26 | Minimum Falling Path Sum II | 4 Approaches | Detailed Dry Run | Leetcode 1289 | codestorywithMIK | 1:05:22 | 4,695 | |
|
2024-04-25 | Longest Ideal Subsequence | LIS Variant | Bottom Up | Optimal | Leetcode 2370 | codestorywithMIK | 43:32 | 6,686 | |
|
2024-04-24 | N-th Tribonacci Number | 3 Approaches | AMAZON | Leetcode 1137 | codestorywithMIK | 20:46 | 2,442 | |
|
2024-04-23 | Minimum Height Trees | Know Every Detail | Why BFS | GOOGLE | Leetcode 310 | codestorywithMIK | 44:23 | 6,693 | |
|
2024-04-22 | Open the Lock | Why BFS | Similar Pattern Problems | META | Leetcode 752 | codestorywithMIK | 36:06 | 7,617 | |
|
2024-04-21 | Find Edges in Shortest Paths | Dijkstra's Algo | Full Intuition | Leetcode 3123 | codestorywithMIK | 38:31 | 2,027 | |
|
2024-04-20 | Find All Groups of Farmland | DFS | BFS | Brute Force | Leetcode 1992 | codestorywithMIK | 32:38 | 4,048 | |
|
2024-04-19 | Number of Islands | DFS | BFS | Same as Island Perimeter | Leetcode 200 | codestorywithMIK | 17:48 | 3,915 | |
|
2024-04-18 | Island Perimeter | 3 Approaches | Google | Leetcode 463 | codestorywithMIK | 45:34 | 6,094 | |
|
2024-04-17 | Smallest String Starting From Leaf | DFS | BFS | Google | Leetcode 988 | codestorywithMIK | 25:37 | 5,316 | |
|
2024-04-15 | Edit Distance | Recursion | Memo | Bottom Up | DP On Strings | Leetcode 72 | DP Concepts & Qns-21 | 58:11 | 1,261 | |
|
2024-04-14 | Sum of Left Leaves | 2 Approaches | META | Leetcode 404 | codestorywithMIK | 19:49 | 4,256 | |
|
2024-04-13 | Maximal Rectangle | Multiple Hidden Problems | Intuition | Leetcode 85 | codestorywithMIK | 1:20:50 | 7,225 | |
|
2024-04-12 | One Love = CODING ❤️👨🏻💻 | 0:14 | 3,712 | |
|
2024-04-11 | Remove K Digits | Intuition | Dry Run | Leetcode 402 | codestorywithMIK | 35:07 | 8,166 | |
|
2024-04-10 | Reveal Cards In Increasing Order | 2 Approaches | Leetcode 950 | codestorywithMIK | 37:16 | 8,515 | |
|
2024-04-09 | Time Needed to Buy Tickets | 3 Approaches | Leetcode 2073 | codestorywithMIK | 37:29 | 3,443 | |
|
2024-04-08 | Number of Students Unable to Eat Lunch | 2 Approaches | Leetcode 1700 | codestorywithMIK | 19:00 | 5,923 | |
|
2024-04-07 | Minimum Cost Walk in Weighted Graph | Thought Process | DSU | Leetcode 3108 | codestorywithMIK | 44:02 | 1,424 | |
|
2024-04-07 | Valid Parenthesis String | 4 Detailed Approaches | Leetcode 678 | codestorywithMIK | 1:13:23 | 6,180 | |
|
2024-04-06 | Print Shortest Common Supersequence | DP On Strings | Leetcode 1092 | DP Concepts & Qns-21 | 26:36 | 767 | |
|
2024-04-06 | Minimum Remove to Make Valid Parentheses | 3 Detailed Approaches | Leetcode 1249 | codestorywithMIK | 44:18 | 5,490 | |
|
2024-04-04 | Maximum Nesting Depth of the Parentheses | 2 Approaches | Leetcode 1614 | codestorywithMIK | 16:48 | 4,124 | |
|
2024-04-02 | Isomorphic Strings | Simple Thought Process | Leetcode 205| LinkedIn | codestorywithMIK | 19:01 | 5,870 | |
|
2024-04-01 | Length of Last Word | 2 Ways | Leetcode 58 | Amazon | codestorywithMIK | 13:46 | 2,902 | |
|
2024-03-31 | April, we are coming 🔥🔥🔥 #leetcode #maths #leetcodequestionandanswers #codestorywithmik | 0:06 | 2,569 | |
|
2024-03-31 | Count Alternating Subarrays | Super Easy | Leetcode 3031 | Weekly Contest 391 | codestorywithMIK | 21:31 | 3,210 | |
|
2024-03-30 | Subarrays with K Different Integers | Approach-2 | One Pass | Leetcode 992 | codestorywithMIK | 29:18 | 3,376 | |
|