58:36

Maximum Beauty of an Array After Applying Operation | 3 Approaches | Leetcode 2779 |codestorywithMIK

58:52

Find Longest Special Substring That Occurs Thrice I & II | Leetcode 2981 & 2982 | codestorywithMIK

01:07:18

Special Array II | 3 Detailed Approaches | Beginners Alert | Leetcode 3152 | codestorywithMIK

49:19

Primality Check | Sieve of Eratosthenes | Super Detailed For Beginners | codestorywithMIK

27:53

Two Best Non-Overlapping Events | Brute Force | Better | Leetcode 2054 | codestorywithMIK

42:13

Minimum Limit of Balls in a Bag | Detailed | Why Binary Search | Leetcode 1760 | codestorywithMIK

11:46

Maximum Number of Integers to Choose From a Range I | Simple | Leetcode 2554 | codestorywithMIK

38:50

Move Pieces to Obtain a String | Brute Force | Wrong | Optimal | Leetcode 2337 | codestorywithMIK

13:39

Make String a Subsequence Using Cyclic Increments | Similar Problem |Leetcode 2825 |codestorywithMIK

07:07

Adding Spaces to a String | Straight Forward Easy | Leetcode 2109 | codestorywithMIK

14:57

Check If N and Its Double Exist | Special Motivation | Leetcode 1346 | codestorywithMIK

31:41

Hierholzer's Algorithm | Valid Arrangement of Pairs | Leetcode 2097 | Graph Concepts & Qns - 43

17:43

Euler Path | Euler Circuit | PART-3 | Graph Concepts & Qns - 42 | Explanation + Code

36:40

Minimum Time to Visit a Cell In a Grid | Using Studied Concept | Leetcode 2577 | codestorywithMIK

25:58

Minimum Obstacle Removal to Reach Corner I | Using Studied Concept | Leetcode 2290 |codestorywithMIK

25:20

Shortest Distance After Road Addition Queries I | Easy Explanation | Leetcode 3243 |codestorywithMIK

11:24

Find Champion II | Easy Explanation | Leetcode 2924 | codestorywithMIK

34:24

Sliding Puzzle | Detailed for Beginners | Leetcode 773 | codestorywithMIK

29:01

Minimum Array Sum | Detailed for Beginners | Contest Problem | Leetcode 3366 | codestorywithMIK

18:33

Maximum Matrix Sum | Simple Thought Process | Leetcode 1975 | codestorywithMIK

34:16

Rotating the Box | Brute Force | Optimal | Leetcode 1861 | codestorywithMIK

30:05

Flip Columns For Maximum Number of Equal Rows | 2 Approaches | Leetcode 1072 | codestorywithMIK

14:58

Count Unguarded Cells in the Grid | Simple Explanation | Leetcode 2257 | codestorywithMIK

35:44

Take K of Each Character From Left and Right | 2 Approaches | Leetcode 2516 | codestorywithMIK

19:53

Maximum Sum of Distinct Subarrays With Length K | Khandani Template |Leetcode 2461 |codestorywithMIK

21:21

Defuse the Bomb | Detailed for Beginners | Leetcode 1652 | codestorywithMIK

35:37

Shortest Subarray with Sum at Least K | Already Studied Concept | Leetcode 862 | codestorywithMIK

16:43

Find the Power of K-Size Subarrays I | Why Monotonic Deque | Dry Run|Leetcode 3254 |codestorywithMIK

20:23

Find the Power of K-Size Subarrays I | Simple Explanation | Dry Run| Leetcode 3254 |codestorywithMIK

34:17

Shortest Subarray to be Removed to Make Array Sorted | Detailed | Leetcode 1574 | codestorywithMIK

25:39

Minimized Maximum of Products Distributed to Any Store | Leetcode 2064 | codestorywithMIK

34:31

Count the Number of Fair Pairs | Detailed Explanation | Leetcode 2563 | codestorywithMIK

22:44

Most Beautiful Item for Each Query | Simple Explanation | Leetcode 2070 | codestorywithMIK

24:07

Prime Subtraction Operation | Straight Forward Approach | Leetcode 2601 | codestorywithMIK

34:16

Shortest Subarray With OR at Least K II | Made Easy | Detailed | Leetcode 3097 | codestorywithMIK

31:08

Minimum Array End | How much you know about AND | Detailed | Leetcode 3133 | codestorywithMIK

27:34

Maximum XOR for Each Query | Simple Explanation | Leetcode 1829 | codestorywithMIK

29:40

Largest Combination With Bitwise AND Greater Than Zero | Detailed | Leetcode 2275 | codestorywithMIK

30:07

Find if Array Can Be Sorted | Detailed Approaches | Dry Runs | Leetcode 3011 | codestorywithMIK

23:39

Minimum Number of Changes to Make Binary String Beautiful | 2 Ways | Leetcode 2914 |codestorywithMIK

07:25

String Compression III | Simple Simulation | Leetcode 3163 | codestorywithMIK

16:46

Rotate String | Something to learn | Leetcode 796 | codestorywithMIK

07:14

Delete Characters to Make Fancy String | Simple & Easy | Leetcode 1957 | codestorywithMIK

31:58

Minimum Total Distance Traveled | Detailed Thought Process | Leetcode 2463 | codestorywithMIK

31:03

Minimum Number of Removals to Make Mountain Array | Thought Process | Leetcode 1671|codestorywithMIK

15:53

Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | codestorywithMIK

24:47

Longest Square Streak in an Array | Detailed Approaches | Dry Run | Leetcode 2501 | codestorywithMIK

42:01

Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK

41:20

Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK

30:09

Maximum Width Ramp | How to identify Monotonic Stack | Dry Runs | Leetcode 962 | codestorywithMIK

30:19

Remove Sub-Folders from the Filesystem | 2 Simple Approaches | Leetcode 1233 | codestorywithMIK

23:43

Flip Equivalent Binary Trees | Simple Recursion | Dry Run | Leetcode 951 | codestorywithMIK

35:35

Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK

28:27

Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593

19:16

Parsing A Boolean Expression | Cleanest Explanation | Dry Run | Leetcode 1106 | codestorywithMIK

24:52

Find Kth Bit in Nth Binary String | Detailed Recursion | Dry Run | Leetcode 1545 | codestorywithMIK

21:07

Count Number of Maximum Bitwise-OR Subsets | Simplest Approach |Leetcode 2044 | codestorywithMIK

26:14

Maximum Swap | 2 Simple Approaches | Leetcode 670 | codestorywithMIK

23:27

Longest Happy String | Simple Thought Process | Leetcode 1405 | codestorywithMIK

13:23

Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | codestorywithMIK