Maximum Difference Between Even and Odd Frequency II | Super Detailed | Leetcode 3445 | MIK
Introduction to Monotonic Data Structures | Roadmap | Applications | codestorywithMIK
Using a Robot to Print the Lexicographically Smallest String | Thought Process | Leetcode 2434 | MIK
Maximum Difference Between Even and Odd Frequency I | Easy | Leetcode 3442 | codestorywithMIK
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
DSA Shorts with MIK - 11 | Avoid TLE in Competitive Programming with Fast I/O 🔥 | Part 2
Maximum Employees to Be Invited to a Meeting | Super Detailed | Leetcode 2127 | codestorywithMIK
Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK
Struggling With Logic in Coding ? Watch This Before Your Next LeetCode Question | codestorywithMIK
The k-th Lexicographical String of All Happy Strings of Length n | Leetcode 1415 |BOOTCODER
Maximum Value of an Ordered Triplet I | Multiple Approaches | Leetcode 2873 | codestorywithMIK
First Completely Painted Row or Column | Approaches | Detailed | Leetcode 2661 | CodeWithShaaz
Minimum Cost to Make at Least One Valid Path in a Grid| 2 Approaches | Leetcode 1368 | CodeWithShaaz
Recover a Tree From Preorder Traversal | Easy DFS Simulation | Leetcode 1028 | codestorywithMIK
Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK
Distribute Candies Among Children II | 4 Approaches | Detailed | Leetcode 2929 | codestorywithMIK
Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
Find the Lexicographically Largest String From the Box I | Thought Process | Leetcode 3403 | MIK
Most Profitable Path in a Tree | BFS | DFS | Detailed | Leetcode 2467 | codestorywithMIK
Letter Tile Possibilities | 2 Ways | Using Standard Template | Leetcode 1079 | codestorywithMIK
Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK
K-th Smallest in Lexicographical Order | Super Detailed | Dry Run | Leetcode 440 | codestorywithMIK
Zero Array Transformation III | How to detect topic | How to detect Data Structure | Leetcode 3362
Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK
1795 : MAP OF HIGHEST PEAK| GRAPH | BFS | LEETCODE DAILY CHALLENGE | DAILY DSA PROBLEM
Find All Possible Recipes from Given Supplies | Brute Force | Optimal | Leetcode 2115
Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | codestorywithMIK
Sum of Prefix Scores of Strings | Trie | Full Easy Dry Run | Leetcode 2416 | codestorywithMIK
Maximum Ascending Subarray Sum | Brute Force | Optimal | Leetcode 1800 | codestorywithMIK
Construct the Lexicographically Largest Valid Sequence | Detailed | Leetcode 1718 | codestorywithMIK
Count the Number of Consistent Strings | Using Bit Manipulation | Leetcode 1684 | codestorywithMIK
Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK
Maximum Count of Positive Integer and Negative Integer | Leetcode 2529 | codestorywithMIK
Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK
Largest Color Value in a Directed Graph | Detailed | Leetcode 1857 | META | codestorywithMIK
Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK
Find the Maximum Sum of Node Values | Two Approaches | Detailed | Leetcode 3068 | codestorywithMIK
Painting a Grid With Three Different Colors | Thought Process | Leetcode 1931 | codestorywithMIK
Find the Lexicographically Largest String From the Box I | Another Approach | Leetcode 3403 | MIK
Count Number of Maximum Bitwise-OR Subsets | Simplest Approach |Leetcode 2044 | codestorywithMIK
Shortest Subarray With OR at Least K II | Made Easy | Detailed | Leetcode 3097 | codestorywithMIK
Primality Check | Sieve of Eratosthenes | Super Detailed For Beginners | codestorywithMIK
Number of Ways to Form a Target String Given a Dictionary | Recur | Memo | Leetcode 1639 | MIK
Print Shortest Common Supersequence | DP On Strings | Leetcode 1092 | DP Concepts & Qns-21
Divide Players Into Teams of Equal Skill | With Proof | Dry Run | Leetcode 2491 | codestorywithMIK
Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK
Shortest Subarray with Sum at Least K | Already Studied Concept | Leetcode 862 | codestorywithMIK
Maximum Number of Points From Grid Queries | DFS | BFS | Optimal | Leetcode 2503 | codestorywithMIK
Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK
Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK
My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK
Find the Punishment Number of an Integer | Multiple Ways | Dry Run |Leetcode 2698 | codestorywithMIK
Longest Subarray With Maximum Bitwise AND | Simple Observation | Leetcode 2419 | codestorywithMIK
Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK
Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593
Take Gifts From the Richest Pile | Simple Explanation | Leetcode 2558 | codestorywithMIK
Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK
Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK
Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK
Check if Number is a Sum of Powers of Three | Maths Proof | 3 Ways | Leetcode 1780 |codestorywithMIK
Minimized Maximum of Products Distributed to Any Store | Leetcode 2064 | codestorywithMIK
Domino and Tromino Tiling | Detailed Explanations | Leetcode 790 | codestorywithMIK
Maximum Candies You Can Get from Boxes | 2 Ways | Simple Intuition | Leetcode 1298 |codestorywithMIK
Sentence Similarity III | 2 Simple Approaches | Dry Run | Leetcode 1813 | codestorywithMIK
Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK
Closest Prime Numbers in Range | 2 Detailed Approaches | Leetcode 2523 | codestorywithMIK
Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK
Find Closest Node to Given Two Nodes | BFS | DFS | Leetcode 2359 | codestorywithMIK
Making A Large Island | Brute Force | Better | Optimal | Dry Run | Leetcode 827 | codestorywithMIK
Extra Characters in a String | Recursion | Bottom Up | Easy | Leetcode 2707 | codestorywithMIK
Put Marbles in Bags | Full Intuition | Dry Run | Leetcode-2551 | AMAZON | codestorywithMIK
Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK
Minimum Add to Make Parentheses Valid | Simple Intuition | Leetcode 921 | codestorywithMIK
Delete Characters to Make Fancy String | Simple & Easy | Leetcode 1957 | codestorywithMIK
Shortest Common Supersequence | 3 Approaches | DP On Strings |DP Concepts & Qns 20|codestorywithMIK
Count Subarrays With Fixed Bounds | Made Simple | Microsoft | Leetcode 2444 | codestorywithMIK
Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK
Neighboring Bitwise XOR | 2 Detailed Approaches | Dry Runs | Leetcode 2683 | codestorywithMIK
Count Good Triplets | Simple Approach | Slight Improvements | Leetcode 1534 | codestorywithMIK
CANDY | 2 Approaches | O(1) Space | O(N) Space | AMAZON | Leetcode 135 | codestorywithMIK
Move Pieces to Obtain a String | Brute Force | Wrong | Optimal | Leetcode 2337 | codestorywithMIK
Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK
Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK
Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK
Construct Binary Tree from Preorder and Postorder Traversal | Leetcode 889 | codestorywithMIK
Make String a Subsequence Using Cyclic Increments | Similar Problem |Leetcode 2825 |codestorywithMIK
Longest Nice Subarray | Brute Force | Better | Optimal | Dry Runs | Leetcode 2401 | codestorywithMIK
Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK
Minimum Array End | How much you know about AND | Detailed | Leetcode 3133 | codestorywithMIK
Different Ways to Add Parentheses | Simple Story To Code | Leetcode 241 | codestorywithMIK
Number of Ways to Arrive at Destination | Straight Forward Simple | Leetcode 1976 | codestorywithMIK