LeetCode 2337 | Move Pieces to Obtain a String | Greedy + Two Pointers Explained
CrackCodeLogic
LeetCode 2337 | Move Pieces to Obtain a String | Greedy + Two Pointers Explained
17:50
LeetCode 841 | Keys and Rooms | Graph Traversal using DFS/BFS Explained
CrackCodeLogic
LeetCode 841 | Keys and Rooms | Graph Traversal using DFS/BFS Explained
10:00
LeetCode 701 | Insert into a Binary Search Tree | BST Insertion Explained Recursively & Iteratively
CrackCodeLogic
LeetCode 701 | Insert into a Binary Search Tree | BST Insertion Explained Recursively & Iteratively
6:54
LeetCode 695 | Max Area of Island | DFS Graph Traversal Explained
CrackCodeLogic
LeetCode 695 | Max Area of Island | DFS Graph Traversal Explained
12:24
LeetCode 424 | Longest Repeating Character Replacement | Sliding Window Explained
CrackCodeLogic
LeetCode 424 | Longest Repeating Character Replacement | Sliding Window Explained
18:34
LeetCode 215 | Kth Largest Element in an Array | Heap & QuickSelect Explained
CrackCodeLogic
LeetCode 215 | Kth Largest Element in an Array | Heap & QuickSelect Explained
6:58
LeetCode 76 | Minimum Window Substring | Sliding Window + Hash Map Explained
CrackCodeLogic
LeetCode 76 | Minimum Window Substring | Sliding Window + Hash Map Explained
24:10
LeetCode 59 | Spiral Matrix II | Matrix Simulation Explained Step-by-Step
CrackCodeLogic
LeetCode 59 | Spiral Matrix II | Matrix Simulation Explained Step-by-Step
13:43
LeetCode 39 | Combination Sum | Backtracking Explained with Intuition and Code
CrackCodeLogic
LeetCode 39 | Combination Sum | Backtracking Explained with Intuition and Code
13:31
LeetCode 5 | Longest Palindromic Substring | Dynamic Programming & Expand Around Center Explained
CrackCodeLogic
LeetCode 5 | Longest Palindromic Substring | Dynamic Programming & Expand Around Center Explained
19:29
LeetCode 3 | Longest Substring Without Repeating Characters | Sliding Window Explained
CrackCodeLogic
LeetCode 3 | Longest Substring Without Repeating Characters | Sliding Window Explained
10:35
Maximum Swap - Leetcode 670 | Greedy Approach Made Simple
CrackCodeLogic
Maximum Swap - Leetcode 670 | Greedy Approach Made Simple
13:17
Maximal Square - Leetcode 221 | Dynamic Programming Explained Clearly
CrackCodeLogic
Maximal Square - Leetcode 221 | Dynamic Programming Explained Clearly
13:27
Course Schedule - Leetcode 207 | Topological Sort (Kahn’s Algorithm + DFS)
CrackCodeLogic
Course Schedule - Leetcode 207 | Topological Sort (Kahn’s Algorithm + DFS)
17:55
Find Peak Element - Leetcode 162 | Binary Search Approach Explained
CrackCodeLogic
Find Peak Element - Leetcode 162 | Binary Search Approach Explained
15:21
Largest Rectangle in Histogram - Leetcode 84 | Monotonic Stack Explained Simply
CrackCodeLogic
Largest Rectangle in Histogram - Leetcode 84 | Monotonic Stack Explained Simply
25:32
LeetCode 253 - Meeting Rooms II | Google Interview Question Explained
CrackCodeLogic
LeetCode 253 - Meeting Rooms II | Google Interview Question Explained
11:22
LeetCode 295 - Find Median from Data Stream | Amazon & Google Interview Prep
CrackCodeLogic
LeetCode 295 - Find Median from Data Stream | Amazon & Google Interview Prep
15:42
🧩 Leetcode 560 - Subarray Sum Equals K | Prefix Sum + HashMap | Amazon Interview Prep
CrackCodeLogic
🧩 Leetcode 560 - Subarray Sum Equals K | Prefix Sum + HashMap | Amazon Interview Prep
12:31
🧠 Leetcode 540 - Single Element in a Sorted Array | Binary Search Trick | Google Interview Prep
CrackCodeLogic
🧠 Leetcode 540 - Single Element in a Sorted Array | Binary Search Trick | Google Interview Prep
10:06
🔄 Leetcode 48 - Rotate Image (90° In-Place) | Matrix Tricks Explained | Meta Interview Prep
CrackCodeLogic
🔄 Leetcode 48 - Rotate Image (90° In-Place) | Matrix Tricks Explained | Meta Interview Prep
4:40
🧪 Leetcode 11 - Container With Most Water | Two Pointer Pattern | Google Interview Prep
CrackCodeLogic
🧪 Leetcode 11 - Container With Most Water | Two Pointer Pattern | Google Interview Prep
9:40
🔁 Leetcode 7 - Reverse Integer | Overflow Handling Explained | Apple Interview Prep
CrackCodeLogic
🔁 Leetcode 7 - Reverse Integer | Overflow Handling Explained | Apple Interview Prep
8:18
🔗 Leetcode 21 - Merge Two Sorted Lists | Linked List Mastery | Amazon Interview Prep
CrackCodeLogic
🔗 Leetcode 21 - Merge Two Sorted Lists | Linked List Mastery | Amazon Interview Prep
13:24
📈 Leetcode 53 - Maximum Subarray | Kadane’s Algorithm Explained | FAANG Interview Prep
CrackCodeLogic
📈 Leetcode 53 - Maximum Subarray | Kadane’s Algorithm Explained | FAANG Interview Prep
14:41
📅 Leetcode 56 - Merge Intervals | Sorting + Merging Explained | Amazon Interview Prep
CrackCodeLogic
📅 Leetcode 56 - Merge Intervals | Sorting + Merging Explained | Amazon Interview Prep
9:23
🔢 Leetcode 128 - Longest Consecutive Sequence | HashSet Optimization | Google Interview Prep
CrackCodeLogic
🔢 Leetcode 128 - Longest Consecutive Sequence | HashSet Optimization | Google Interview Prep
19:41
🧱 Leetcode 20 - Valid Parentheses | Stack Logic Explained | Microsoft Interview Prep
CrackCodeLogic
🧱 Leetcode 20 - Valid Parentheses | Stack Logic Explained | Microsoft Interview Prep
8:04
🌳 Leetcode 662 - Maximum Width of Binary Tree | BFS + Indexing | Amazon Interview Prep
CrackCodeLogic
🌳 Leetcode 662 - Maximum Width of Binary Tree | BFS + Indexing | Amazon Interview Prep
19:16
🎯 Leetcode 863 - All Nodes Distance K in Binary Tree | DFS + BFS Hybrid | Google Interview Prep
CrackCodeLogic
🎯 Leetcode 863 - All Nodes Distance K in Binary Tree | DFS + BFS Hybrid | Google Interview Prep
15:40
📈 Leetcode 121 - Best Time to Buy and Sell Stock | Greedy Explained | Meta Interview Prep
CrackCodeLogic
📈 Leetcode 121 - Best Time to Buy and Sell Stock | Greedy Explained | Meta Interview Prep
13:30
🧗 Leetcode 70 - Climbing Stairs | DP Explained Simply | Google Interview Prep
CrackCodeLogic
🧗 Leetcode 70 - Climbing Stairs | DP Explained Simply | Google Interview Prep
13:44
🧹 Leetcode 27 - Remove Element | Two Pointer Approach | Amazon Interview Question
CrackCodeLogic
🧹 Leetcode 27 - Remove Element | Two Pointer Approach | Amazon Interview Question
6:40
🧠 Leetcode 1 - Two Sum | HashMap Trick Explained | FAANG Interview Prep
CrackCodeLogic
🧠 Leetcode 1 - Two Sum | HashMap Trick Explained | FAANG Interview Prep
15:44
🔄 Leetcode 88 - Merge Sorted Array | Easy But Tricky! | Microsoft Interview Prep
CrackCodeLogic
🔄 Leetcode 88 - Merge Sorted Array | Easy But Tricky! | Microsoft Interview Prep
8:15
💧 Leetcode 42 - Trapping Rain Water | Explained with Intuition & Code | Google Interview Question
CrackCodeLogic
💧 Leetcode 42 - Trapping Rain Water | Explained with Intuition & Code | Google Interview Question
29:39
🔥 Leetcode 200 - Number of Islands | DFS & BFS Explained Clearly | Coding Interview Prep
CrackCodeLogic
🔥 Leetcode 200 - Number of Islands | DFS & BFS Explained Clearly | Coding Interview Prep
20:39