DSA Shorts with MIK - 10 | Avoid TLE in Competitive Programming with Fast I/O | Part 1
2025 Placement Roadmap | How I Would Have Prepared | Year 2025 Special | Happy New Year
Zero Array Transformation III | How to detect topic | How to detect Data Structure | Leetcode 3362
Maximum Employees to Be Invited to a Meeting | Super Detailed | Leetcode 2127 | codestorywithMIK
Zero Array Transformation I | Brute Force | Optimal | Leetcode 3356 | codestorywithMIK
Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK
Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK
Introduction | What | How | Difference Array Technique: Concepts & Questions - 1 | codestorywithMIK
Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK
Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK
First Completely Painted Row or Column | Approaches | Detailed | Leetcode 2661 | CodeWithShaaz
Minimum Total Distance Traveled | Detailed Thought Process | Leetcode 2463 | codestorywithMIK
Minimum Cost to Make at Least One Valid Path in a Grid| 2 Approaches | Leetcode 1368 | CodeWithShaaz
Construct Smallest Number From DI String | Easy Approaches | Leetcode 2375 | codestorywithMIK
Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK
The k-th Lexicographical String of All Happy Strings of Length n | Leetcode 1415 |BOOTCODER
Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK
Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK
Divide Nodes Into the Maximum Number of Groups | Super Detailed | Leetcode 2493 | codestorywithMIK
Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK
Minimum Length of String After Operations | 2 Approaches |Intuition |Leetcode 3223 |codestorywithMIK
Minimum Array End | How much you know about AND | Detailed | Leetcode 3133 | codestorywithMIK
Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | codestorywithMIK
Maximum Count of Positive Integer and Negative Integer | Leetcode 2529 | codestorywithMIK
Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK
Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK
Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK
Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK
Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK
Maximum Candies Allocated to K Children | Brute Force | Optimal | Leetcode 2226 | codestorywithMIK
Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK
Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK
Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK
Maximum Ascending Subarray Sum | Brute Force | Optimal | Leetcode 1800 | codestorywithMIK
Count the Number of Consistent Strings | Using Bit Manipulation | Leetcode 1684 | codestorywithMIK
K-th Smallest in Lexicographical Order | Super Detailed | Dry Run | Leetcode 440 | codestorywithMIK
Extra Characters in a String | Recursion | Bottom Up | Easy | Leetcode 2707 | codestorywithMIK
Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK
1795 : MAP OF HIGHEST PEAK| GRAPH | BFS | LEETCODE DAILY CHALLENGE | DAILY DSA PROBLEM
Sentence Similarity III | 2 Simple Approaches | Dry Run | Leetcode 1813 | codestorywithMIK
Domino and Tromino Tiling | Detailed Explanations | Leetcode 790 | codestorywithMIK
Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593
Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK
Divide Players Into Teams of Equal Skill | With Proof | Dry Run | Leetcode 2491 | codestorywithMIK
Range Maximum Index Query | Part 1 | Segment Tree Concepts & Qns | Video 9 | codestorywithMIK
Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK
Take Gifts From the Richest Pile | Simple Explanation | Leetcode 2558 | codestorywithMIK
My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK
Shortest Palindrome | Multiple Ways | KMP Zindabaad | Leetcode 214 | codestorywithMIK
Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK
Adding Spaces to a String | Straight Forward Easy | Leetcode 2109 | codestorywithMIK
Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK