ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

55,092 results

Bitflip
Solve ANY Prefix Tree Problem on Leetcode

Prefix Trees (aka Tries) are my favorite data structure for a reason – they're so easy. Learn the pattern I use to solve ANY Prefix ...

8:40
Solve ANY Prefix Tree Problem on Leetcode

3,081 views

11mo ago

Nishant Chahar
How to start Leetcode in 2026 ( as a Beginner ) | LeetCode Roadmap 2026

In this video, we break the biggest myth around LeetCode that more questions automatically mean better interviews. You'll ...

13:42
How to start Leetcode in 2026 ( as a Beginner ) | LeetCode Roadmap 2026

175,547 views

7mo ago

Explainedbychhavi
LeetCode 486 | Predict the Winner 🔥 | DP Space Optimization Explained Step by Step | Java

Struggling to understand LeetCode 486 - Predict the Winner? In this video, we'll solve the problem from scratch using an ...

18:23
LeetCode 486 | Predict the Winner 🔥 | DP Space Optimization Explained Step by Step | Java

537 views

1mo ago

CodingNinja
LeetCode 2839 Explained | Check if Strings Can Be Made Equal (Easy Trick!)

Learn how to solve LeetCode 2839 – Check if Strings Can Be Made Equal With Operations I in a clear and intuitive way.

6:06
LeetCode 2839 Explained | Check if Strings Can Be Made Equal (Easy Trick!)

225 views

5mo ago

Explainedbychhavi
LeetCode 1872 Stone Game VIII | O(n) DP Explained Simply 🔥

LeetCode 1872 - Stone Game VIII In this video, I explain how to solve Stone Game VIII using an optimized O(n) approach in ...

11:29
LeetCode 1872 Stone Game VIII | O(n) DP Explained Simply 🔥

214 views

1mo ago

Explainedbychhavi
Leetcode 877 | DP + Minimax Explained Visually | Java | Dynamic Programming Interview Question

In this video, we'll solve LeetCode 877: Stone Game using Dynamic Programming (DP) + Minimax with a clear visual explanation ...

5:22
Leetcode 877 | DP + Minimax Explained Visually | Java | Dynamic Programming Interview Question

179 views

1mo ago

Shaan Labs
Leetcode 3310. Remove Methods From Project | Easiest DFS BFS Approach | Solve In Seconds

Leetcode 3310. Remove Methods From Project solved with DFS and BFS in Java. This LeetCode daily solution explains how to ...

19:41
Leetcode 3310. Remove Methods From Project | Easiest DFS BFS Approach | Solve In Seconds

561 views

1mo ago

PRABHAT ADVAIT
Master LeetCode in 2025 | Daily Challenges, Streak Hacks, Topic-Wise Prep & Badges Explained!

Welcome to the ultimate LeetCode Introduction for 2025! In this video, I walk you through everything you need to know to use ...

8:27
Master LeetCode in 2025 | Daily Challenges, Streak Hacks, Topic-Wise Prep & Badges Explained!

362 views

10mo ago

codewithamod
LeetCode 12: Integer to Roman |Day 18 | Best Java Solution Explained Step-by-Step

In this video, we'll solve LeetCode Problem 12: Integer to Roman using Java. You'll learn: How Roman numerals work ...

11:05
LeetCode 12: Integer to Roman |Day 18 | Best Java Solution Explained Step-by-Step

144 views

11mo ago

Explainedbychhavi
LeetCode 3875: Construct Uniform Parity Array I | Brute Force Approach | Main Twist

In this video, we solve LeetCode 3875 – Construct Uniform Parity Array I using a simple and beginner-friendly Brute Force ...

13:55
LeetCode 3875: Construct Uniform Parity Array I | Brute Force Approach | Main Twist

593 views

3w ago

Explainedbychhavi
3014. Minimum Number of Pushes to Type Word I | Greedy Explained Visually | LeetCode 3014 | Java

🚀 In this video, we solve LeetCode 3014 - Minimum Number of Pushes to Type Word I using a simple Greedy observation. You'll ...

5:17
3014. Minimum Number of Pushes to Type Word I | Greedy Explained Visually | LeetCode 3014 | Java

1,220 views

1mo ago

Explainedbychhavi
LeetCode 3069: From ArrayList Overhead to 0ms Array Optimization (Java)

... today daily leetcode java daily dsa problem daily coding problem leetcode problem solving leetcode explained in java leetcode ...

10:24
LeetCode 3069: From ArrayList Overhead to 0ms Array Optimization (Java)

318 views

1mo ago

Explainedbychhavi
3016. Minimum Number of Pushes to Type Word II | Greedy Explained Visually | LeetCode 3016 | Java

🚀 In this video, we solve LeetCode 3016 - Minimum Number of Pushes to Type Word II using a Greedy approach. Unlike Part I ...

5:58
3016. Minimum Number of Pushes to Type Word II | Greedy Explained Visually | LeetCode 3016 | Java

559 views

1mo ago

Explainedbychhavi
LeetCode 3731 | Find Missing Elements | 4 Approaches Explained | Java

Problem Link : https://leetcode.com/problems/find-missing-elements/description/?envType=daily-question&envId=2026-08-04 In ...

7:50
LeetCode 3731 | Find Missing Elements | 4 Approaches Explained | Java

591 views

1mo ago

Code Crusaders
Leetcode 2751.  Robot Collisions Visual Explanation (Stack Simulation)

LeetCode 2751 – Robot Collisions Explained In this video we break down LeetCode 2751 and understand how to efficiently ...

5:28
Leetcode 2751. Robot Collisions Visual Explanation (Stack Simulation)

477 views

5mo ago

Explainedbychhavi
LeetCode 1510: Stone Game IV | Game Theory + DP Explained Easily

Can Alice win the Stone Game? In this video, we solve LeetCode 1510 – Stone Game IV using Recursion + DP (Memoization).

16:49
LeetCode 1510: Stone Game IV | Game Theory + DP Explained Easily

184 views

1mo ago

CodeWithU
LeetCode 1614: Maximum Nesting Depth of Parentheses | Explained & Solved in Java

LeetCode 1614 – Maximum Nesting Depth of the Parentheses In today's LeetCode Problem of the Day, we'll understand and ...

8:11
LeetCode 1614: Maximum Nesting Depth of Parentheses | Explained & Solved in Java

9 views

19h ago

Think Bit
LeetCode Biweekly Contest 188 | Problem 2 | Widest Possible Fence | C++ Solution Explained

In this video, we solve Problem 2: Widest Possible Fence from LeetCode Biweekly Contest 188. In this explanation, we don't jump ...

13:53
LeetCode Biweekly Contest 188 | Problem 2 | Widest Possible Fence | C++ Solution Explained

286 views

1mo ago

Explainedbychhavi
LeetCode 2996 Explained Simply | Smallest Missing Integer Greater Than Sequential Prefix Sum | Java

LeetCode 2996 — Smallest Missing Integer Greater Than Sequential Prefix Sum explained in the easiest way with a clear ...

6:57
LeetCode 2996 Explained Simply | Smallest Missing Integer Greater Than Sequential Prefix Sum | Java

121 views

1mo ago

CodingNinja
LeetCode 1614: Maximum Nesting Depth of the Parentheses | Python Solution Explained

Learn how to solve LeetCode 1614 – Maximum Nesting Depth of the Parentheses using Python. In this video, I explain a simple ...

4:21
LeetCode 1614: Maximum Nesting Depth of the Parentheses | Python Solution Explained

173 views

22h ago

Show more