Все публикации

0:31:22

Find the K-th Character in String Game II | Recursion | Dry Run | Leetcode 3307 | codestorywithMIK

0:47:29

All O`one Data Structure | Super Simple Explanation | Leetcode 432 | codestorywithMIK

0:00:57

DSA Shorts with MIK - 5

0:24:55

Design Circular Deque | Simplest Explanation | 2 Ways | Leetcode 641 | codestorywithMIK

0:00:10

Priorities 🥹🥹🥹

0:32:41

My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK

0:37:33

My Calendar I | Detailed Approach | Leetcode 729 | codestorywithMIK

0:31:21

Sum of Prefix Scores of Strings | Trie | Full Easy Dry Run | Leetcode 2416 | codestorywithMIK

0:37:07

Find the Length of the Longest Common Prefix | 2 Approaches | Leetcode 3043 | codestorywithMIK

0:25:33

Extra Characters in a String | Recursion | Bottom Up | Easy | Leetcode 2707 | codestorywithMIK

0:42:59

K-th Smallest in Lexicographical Order | Super Detailed | Dry Run | Leetcode 440 | codestorywithMIK

0:16:15

Lexicographical Numbers | Simple DFS | Leetcode 386 | codestorywithMIK

0:36:39

Shortest Palindrome | Multiple Ways | KMP Zindabaad | Leetcode 214 | codestorywithMIK

0:21:45

Different Ways to Add Parentheses | Simple Story To Code | Leetcode 241 | codestorywithMIK

0:24:01

Minimum Time Difference | Easy Approach | Detailed | Leetcode 539 | codestorywithMIK

0:00:55

DSA Shorts with MIK - 4

0:29:45

Find the Longest Substring Containing Vowels in Even Counts | Leetcode 1371 | codestorywithMIK

0:01:01

DSA Shorts with MIK - 3

0:14:31

Longest Subarray With Maximum Bitwise AND | Simple Observation | Leetcode 2419 | codestorywithMIK

0:11:45

XOR Queries of a Subarray | Simple Explanation | Leetcode 1310 | codestorywithMIK

0:14:34

Count the Number of Consistent Strings | Using Bit Manipulation | Leetcode 1684 | codestorywithMIK

0:19:28

Insert Greatest Common Divisors in Linked List | 2 Approaches | Leetcode 2807 | codestorywithMIK

0:24:17

Spiral Matrix IV | Same Concept Copy Paste | Dry Run | Leetcode 2326 | codestorywithMIK

1:11:10

Maximum Number of Moves to Kill All Pawns | Step By Step Detailed | Leetcode 3283 | codestorywithMIK