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

✅Minimum Time Difference0:07:09

✅Minimum Time Difference - LeetCode 539 - Total Minutes in 1 Day - Explained in Detail

✅XOR Queries of0:06:17

✅XOR Queries of a Subarray - LeetCode 2807 -Prefix Sum - XOR Bit Manipulation- Explained in Detail

✅ Insert Greatest0:07:00

✅ Insert Greatest Common Divisors in Linked List - LeetCode 2807 - Simulation - Explained in Detail

✅ Spiral Matrix0:08:26

✅ Spiral Matrix IV - LeetCode 2326 - Simulation- Easy to understand- Explained in Detail

✅ Split Linked0:10:41

✅ Split Linked List in Parts - LeetCode 725 - Maths - O(n) Time O(k) space- Explained in Detail

✅Linked List in0:10:47

✅Linked List in Binary Tree - LeetCode 1367 - DFS + Two Pointers - Optimized - Explained in Detail

✅ Combination Sum0:10:42

✅ Combination Sum II - LeetCode 40 - Union Find - Optimized - Explained in Detail

✅ Regions Cut0:16:22

✅ Regions Cut By Slashes - LeetCode 959 - Union Find - Optimized - Explained in Detail

✅ Robot Collisions0:16:21

✅ Robot Collisions - LeetCode 2751 - Sorting - Optimized - Explained in Detail with Examples

✅ Maximum Score0:12:21

✅ Maximum Score From Removing Substrings - LeetCode 1717 - Greedy - Optimized - Explained in Detail

✅ Reverse Substrings0:10:35

✅ Reverse Substrings Between Each Pair of Parentheses - LeetCode 1190 - Recursion - O(N) - Explained

✅ Merge Nodes0:08:27

✅ Merge Nodes in Between Zeros - LeetCode 2181 - Single Pass - O(N) - Explained in Detail

✅Intersection of Two0:08:07

✅Intersection of Two Arrays II - LeetCode 350 - Sorting - Two Pointers -Visually Explained in Detail

✅ Remove Max0:07:31

✅ Remove Max Number of Edges to Keep Graph Fully Traversable - LeetCode 1579 - Union Find

✅ All Ancestors0:07:24

✅ All Ancestors of a Node in a Directed Acyclic Graph - LeetCode 2192 - Depth First Search

✅ Binary Search0:08:09

✅ Binary Search Tree to Greater Sum Tree - LeetCode 1038 - Reverse Inorder Traversal - Explained

✅ Minimum Number0:11:23

✅ Minimum Number of K Consecutive Bit Flips LeetCode 955 - Bit Manipulation - Explained in Detail

✅ Longest Continuous0:14:34

✅ Longest Continuous Subarray With Abs Diff Less Than or Equal to Limit LeetCode - Sliding Window

✅Count Number of0:11:08

✅Count Number of Nice Subarrays - LeetCode 1248 - Prefix Sum - Hash Table - Explained in Detail

✅ Grumpy Bookstore0:09:22

✅ Grumpy Bookstore Owner - LeetCode 1052 - Sliding Window - Explained in Detail - Easy Approach

✅Magnetic Force Between0:06:49

✅Magnetic Force Between Two Balls - LeetCode 1552 - Binary Search - Explained In Detail

✅Minimum Number of0:13:18

✅Minimum Number of Days to Make m Bouquets 🌸 LeetCode 1482 - Binary Search - Explained in Detail

✅Most Profit Assigning0:09:15

✅Most Profit Assigning Work - LeetCode 826 - Dynamic Programming - Explained in Detail -Step by Step

✅ Sum of0:07:50

✅ Sum of Square Numbers - LeetCode 633 - Math - Interview Solution - Explained in Detail