codestorywithMIK
- I am on a mission to make a Super Resource for Interview Prep for everyone. 🏁 One stop Solution for :
------- System Design
------- Data Structures and Algorithms
- I specialize for building INTUITION and giving reasons behind each and every line.
The Two Sneaky Numbers of Digitville | Learn Important Bit Concept | Dry Runs | Leetcode 3289 | MIK
Smallest Number With All Set Bits | 3 Approaches | Something to learn | Leetcode 3370 | MIK
Make Array Elements Equal to Zero | Brute Force | Optimal | Detailed Dry Runs | Leetcode 3354 | MIK
Simple Bank System | Easy Simulation| Leetcode 2043 | codestorywithMIK
Calculate Money in Leetcode Bank | 3 Easy Approaches | Leetcode 1716 | codestorywithMIK
Next Greater Numerically Balanced Number | 3 Approaches | Leetcode 2048 | codestorywithMIK
Check If Digits Are Equal in String After Operations I | Better Simulation | Leetcode 3461 | MIK
Maximum Frequency of an Element After Performing Operations II | Difference Array | Leetcode 3347
Maximum Frequency of an Element After Performing Operations I | Difference Array | Leetcode 3346
Maximum Frequency of an Element After Performing Operations I | Deep Dive | Leetcode 3346
Lexicographically Smallest String After Applying Operations | Leetcode 1625 | Hidden Common Pattern
Maximum Number of Distinct Elements After Operations | Detailed Deep Dive | Leetcode 3397 | MIK
Smallest Missing Non-negative Integer After Operations | Simple observation | Leetcode 2598 | MIK
Adjacent Increasing Subarrays Detection II | Same as Part I | Leetcode 3350 | codestorywithMIK
Adjacent Increasing Subarrays Detection I | Made Simple | Dry Run | Leetcode 3349 | codestorywithMIK
Find Resultant Array After Removing Anagrams | Multiple Approach | Leetcode 2273 | codestorywithMIK
Find Sum of Array Product of Magical Sequences | Super Detailed | Leetcode 3539 | codestorywithMIK
Maximum Total Damage With Spell Casting | 2 Approaches | Detailed | Leetcode 3186 | codestorywithMIK
Taking Maximum Energy From the Mystic Dungeon | 2 Approaches | Leetcode 3147 | codestorywithMIK
Find the Minimum Amount of Time to Brew Potions | Deep Dive | Leetcode 3494 | codestorywithMIK
Avoid Flood in The City | Detailed Thought Process | Intuitive | Leetcode 1488 | codestorywithMIK
Swim in Rising Water | Different Ways To Think | Intuitive | Leetcode 778 | codestorywithMIK
Pacific Atlantic Water Flow | Detailed | Brute Force | Optimal | Leetcode 417 | codestorywithMIK
Water Bottles II | 2 Approaches | Sridharacharya formula | Leetcode 3100 | codestorywithMIK
DSA Memory Hack | Train Your Brain for Deep Focus | codestorywithMIK
Find Triangular Sum of an Array | 2 Approaches | Constant Space | Leetcode 2221 | codestorywithMIK
Minimum Score Triangulation of Polygon | Simplified for Beginners | Leetcode 1039 | codestorywithMIK
Largest Triangle Area | Heron | Shoelace | Leetcode 812 | codestorywithMIK
Valid Triangle Number | 3 Approaches | Detailed | Leetcode 611 | codestorywithMIK
Triangle | 4 Approaches | Detailed | Leetcode 120 | codestorywithMIK