Видео 111
Просмотров 79 046

LeetCode 19: Remove Nth Node From End of List (One-Pass Solution!) | Linked List | Two-Pointer

5:40

Remove Nth Node From End of List - Leet Code 19 - (2 Pointer) - JavaScript

8:06

Move Zeroes - Leet Code 283 - (2 pointer) - JavaScript

3:48

Palindrome Linked List- Leet Code 234 - (2 pointer) - JavaScript

8:26

Valid Parentheses - Leet Code 20 - Stack - JavaScript

8:26

Maximum Depth of Binary Tree - Leet Code 104 - (Recursive & Iterative w/ Stack) - JavaScript

7:55

LeetCode 23: Merge k Sorted Lists | Linked List | JavaScript

🚀 LeetCode 23 - Merge k Sorted Lists | JavaScript Walkthrough 🧑‍💻
In this video, I break down LeetCode 23: Merge k Sorted Lists, explaining step by step how to efficiently merge multiple sorted linked lists into one sorted list.
🔹 Problem Summary:
Given an array of k sorted linked lists, merge them into one sorted linked list and return it.
🛠️ Solution Approach:
✅ Extract all values from the lists
✅ Sort the values in ascending order
✅ Reconstruct the linked list from the sorted values
💡 What You'll Learn:
✔️ How to traverse multiple linked lists
✔️ How to use an array to store and sort values
✔️ Constructing a new linked list efficiently
🔥 Code Implementation (JavaScript):

Видео

LeetCode 19: Remove Nth Node From End of List (One-Pass Solution!) | Linked List | Two-Pointer

5:40

LeetCode 19: Remove Nth Node From End of List (One-Pass Solution!) | Linked List | Two-Pointer

Просмотров 2721 час назад

Of course! Here's a RUclips description for your one-pass solution to LeetCode 19: Remove Nth Node From End of List: 🚀 LeetCode 19: Remove Nth Node From End of List (One-Pass Solution!) | Linked List | Two-Pointer Trick In this video, I solve LeetCode 19: Remove Nth Node From End of List using an optimized one-pass solution with the two-pointer technique. This approach lets us find and remove t...

Remove Nth Node From End of List - Leet Code 19 - (2 Pointer) - JavaScript

8:06

Remove Nth Node From End of List - Leet Code 19 - (2 Pointer) - JavaScript

Просмотров 4321 час назад

🚀 LeetCode 19: Remove Nth Node From End of List | Linked List | Two-Pointer Approach In this video, we tackle LeetCode 19: Remove Nth Node From End of List, a popular linked list problem that tests your understanding of pointers and edge cases. We'll break it down step by step and explore an efficient two-pointer approach to solve it in O(n) time complexity. 🔹 Problem Breakdown 🔹 Brute Force vs...

Move Zeroes - Leet Code 283 - (2 pointer) - JavaScript

3:48

Move Zeroes - Leet Code 283 - (2 pointer) - JavaScript

Просмотров 914 дней назад

In this video, we walk through a simple and efficient solution to move all zeroes in an array to the end, while maintaining the relative order of the non-zero elements. This algorithm modifies the array in-place, meaning no extra space is used! What You'll Learn: How to efficiently move all zeroes in an array to the end. The concept of the two-pointer technique in solving array manipulation pro...

Palindrome Linked List- Leet Code 234 - (2 pointer) - JavaScript

8:26

Palindrome Linked List- Leet Code 234 - (2 pointer) - JavaScript

Просмотров 814 дней назад

In this video, we walk through a JavaScript solution for checking if a singly linked list is a palindrome. We'll break down the entire process step-by-step, covering key concepts like fast and slow pointers, reversing a linked list, and comparing the nodes to determine if the linked list reads the same forward and backward. Steps Covered: Using Fast and Slow Pointers: We'll explain how the fast...

Valid Parentheses - Leet Code 20 - Stack - JavaScript

8:26

Valid Parentheses - Leet Code 20 - Stack - JavaScript

Просмотров 3414 дней назад

n this RUclips walkthrough, we’ll break down a JavaScript function that checks whether a string of parentheses, brackets, and curly braces is valid. The function uses a stack to ensure that every opening symbol has a corresponding closing symbol and they are properly nested. We'll walk through each part of the code: Initial Setup: How the input string is split into an array of characters and ho...

Maximum Depth of Binary Tree - Leet Code 104 - (Recursive & Iterative w/ Stack) - JavaScript

7:55

Maximum Depth of Binary Tree - Leet Code 104 - (Recursive & Iterative w/ Stack) - JavaScript

Просмотров 9914 дней назад

In this video, we dive into the concept of finding the maximum depth (or height) of a binary tree. Whether you're a beginner or just need a quick refresher, we break down the process in an easy-to-understand way. You'll learn: What the maximum depth of a binary tree means The recursive approach to solving the problem How to implement the algorithm in code (with a sample problem) By the end of t...

Invert Binary Tree - Leet Code 226 - (Recursive & Iterative) - JavaScript

10:02

Invert Binary Tree - Leet Code 226 - (Recursive & Iterative) - JavaScript

Просмотров 4014 дней назад

In this video, we'll dive deep into the concept of inverting a binary tree, a common interview question and an interesting problem for any programmer to tackle. I'll walk you through both recursive and iterative solutions, breaking down the process step by step. You'll learn: How to invert a binary tree using recursion How to achieve the same result iteratively The differences between recursive...

Find the Town Judge - Leet Code 997 - Hashmap - JavaScript

8:59

Find the Town Judge - Leet Code 997 - Hashmap - JavaScript

Просмотров 921 день назад

In this video, we solve LeetCode 997: Find the Town Judge, a fun and logical problem that tests your ability to work with graphs and hash maps. 🏛️ Problem Summary: In a town of n people, one person might be the town judge. The judge is trusted by everyone but trusts nobody. Using the trust array, our goal is to determine who the judge is-or if no judge exists. What You'll Learn: ✅ How to use ha...

Fair Candy Swap - Leet Code 888 - Set - JavaScript

8:46

Fair Candy Swap - Leet Code 888 - Set - JavaScript

Просмотров 3221 день назад

Bob want to exchange candies to have equal total candy amounts. I’ll walk you through the step-by-step process of solving this problem using JavaScript. You’ll learn: ✅ How to calculate the target candy sum for both Alice and Bob. ✅ Efficient use of a Set to optimize lookups for Bob's candy box sizes. ✅ The logic behind finding a valid candy box swap and why it works. ✅ A complete explanation o...

Linked List Cycle - Leet Code 141 - 2 solutions - (Set and 2 pointers) - JavaScript

10:34

Linked List Cycle - Leet Code 141 - 2 solutions - (Set and 2 pointers) - JavaScript

Просмотров 1321 день назад

In this video, I walk you through two different solutions to LeetCode 141: Detect a Linked List Cycle. 1️⃣ Using a Set: A straightforward approach that leverages extra memory to track visited nodes and identify cycles. 2️⃣ Two-Pointer Technique: An optimized solution with O(1) space complexity, also known as the "Floyd's Cycle Detection Algorithm." Learn how to approach this classic linked list...