ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

40 results

James Peralta
4015. Weighted Sum of a Tree

James works through LeetCode 4015: Weighted Sum of a Tree, breaking down how to build the tree from the parent array and ...

13:45
4015. Weighted Sum of a Tree

291 views

9h ago

Brute To Best
LeetCode #420: Strong Password Checker, Greedy Case Analysis in O(n)

Problem #420 of the Brute To Best series: Strong Password Checker. A password is strong if it has 6 to 20 characters, contains at ...

17:08
LeetCode #420: Strong Password Checker, Greedy Case Analysis in O(n)

5 views

16h ago

LindorCodes
Sliding Window + HashMap: LeetCode 159 Full Walkthrough (Python)

Sliding window with a hash map — one of the patterns you need locked in before any FAANG interview. In this video ...

17:28
Sliding Window + HashMap: LeetCode 159 Full Walkthrough (Python)

3 views

4h ago

Aditya Mahajan
LeetCode 1190: Reverse Substrings Between Each Pair of Parentheses

Reverse Substrings Between Each Pair of Parentheses (LeetCode 1190), explained properly in 13:20. Reverse the letters inside ...

13:18
LeetCode 1190: Reverse Substrings Between Each Pair of Parentheses

267 views

13h ago

Rahul IITD
Stream of Characters (LeetCode 1032 Hard): Reverse Suffix Trie for Real-Time Queries

Preparing for upcoming College Campus Placements, Off-Campus Drives, or FAANG & Top Tech OAs (Google, Amazon, ...

4:12
Stream of Characters (LeetCode 1032 Hard): Reverse Suffix Trie for Real-Time Queries

6 views

9h ago

BIG BRAINS
Best Time to Buy and Sell Stock Explained | Greedy | Java | LeetCode 121 | GYP #44

BigBrains — GetYouPlaced #44 Best Time to Buy and Sell Stock is a classic interview problem and a great example of a simple ...

4:34
Best Time to Buy and Sell Stock Explained | Greedy | Java | LeetCode 121 | GYP #44

8 views

5h ago

Programming with Sikander
LeetCode 20: Valid Parentheses | Step-by-Step Python Solution using Stack

In this video, we solve the popular interview problem "LeetCode 20: Valid Parentheses" step-by-step using Python! We will cover: ...

16:08
LeetCode 20: Valid Parentheses | Step-by-Step Python Solution using Stack

11 views

8h ago

Alexander Gullen
I was recording that wasn't I?

problem* Today's problem is https://leetcode.com/problems/group-anagrams/. It's the third problem of the ...

8:02
I was recording that wasn't I?

1 view

7h ago

Explainedbychhavi
LeetCode 1190 | Reverse Substrings Between Each Pair of Parentheses | Java Stack Solution

Solution link ...

6:41
LeetCode 1190 | Reverse Substrings Between Each Pair of Parentheses | Java Stack Solution

206 views

17h ago

Proof2Code
LeetCode Weekly Contest 521 & Biweekly Contest 191 | 4 Problems Solved in Java

In this video, I solve and explain the **first two problems from LeetCode Weekly Contest 521 and Biweekly Contest 191** using ...

19:45
LeetCode Weekly Contest 521 & Biweekly Contest 191 | 4 Problems Solved in Java

14 views

13h ago

Mahesh Ahirwar
Sort Linked List in Java | Merge Sort Explained | LeetCode 148 | Mahesh DSA Sheet

In this video, we solve the Sort List problem in Java using the Merge Sort concept. Instead of converting the Linked List into ...

9:55
Sort Linked List in Java | Merge Sort Explained | LeetCode 148 | Mahesh DSA Sheet

5 views

8h ago

Code with Hari
LeetCode 1299 Solution | Replace Elements with Greatest Element on Right Side | Java

LeetCode 1299 Solution - Replace Elements with Greatest Element on Right Side | Java In this video, we solve LeetCode 1299: ...

8:31
LeetCode 1299 Solution | Replace Elements with Greatest Element on Right Side | Java

4 views

10h ago

The Daily Decoded
199. Binary Tree Right Side View | LeetCode | C++ | No BFS Needed (Full Dry Run)

Binary Tree Right Side View (LeetCode 199) explained in C++ from absolute scratch. No BFS, no queue, no level-by-level loop.

8:43
199. Binary Tree Right Side View | LeetCode | C++ | No BFS Needed (Full Dry Run)

2 views

5h ago

</> CodeWithIK
Basic Calculator | Stack Solution Explained

Solve LeetCode 224: Basic Calculator step-by-step! Learn how to parse mathematical expressions containing numbers, addition, ...

18:24
Basic Calculator | Stack Solution Explained

13 views

17h ago

Tarun Verse
LeetCode 1190 | Reverse Substrings Between Each Pair of Parentheses | Java | DSA

Welcome to Tarun Verse! In this video, I solve LeetCode 1190 – Reverse Substrings Between Each Pair of Parentheses using ...

16:05
LeetCode 1190 | Reverse Substrings Between Each Pair of Parentheses | Java | DSA

67 views

8h ago

Shaan Labs
Reverse Substrings Between Each Pair of Parentheses | LEETCODE 1190 | Solve In Seconds | Amazon Meta

Reverse Substrings Between Each Pair of Parentheses is a medium LeetCode stack problem asked at Amazon, Meta, Microsoft, ...

14:42
Reverse Substrings Between Each Pair of Parentheses | LEETCODE 1190 | Solve In Seconds | Amazon Meta

1,318 views

19h ago

BP Codes
LeetCode 907: Sum of Subarray Minimums

LeetCode 907 — Sum of Subarray Minimums In this video, I explain how to solve Sum of Subarray Minimums and gradually ...

7:15
LeetCode 907: Sum of Subarray Minimums

4 views

5h ago

Raj Code's | CP | DSA
Part 13 | LeetCode 1190 – Reverse Substrings Between Each Pair of Parentheses

Part 13 | LeetCode 1190 – Reverse Substrings Between Each Pair of Parentheses In this video, I solve LeetCode 1190: Reverse ...

14:51
Part 13 | LeetCode 1190 – Reverse Substrings Between Each Pair of Parentheses

34 views

19h ago

The Logic Blueprint
Multi-Source BFS Explained: The Grid Algorithm Behind Rotting Oranges

Data Structures and Algorithms become much easier when you can see the logic unfold. In this video, we use the Rotting Oranges ...

6:24
Multi-Source BFS Explained: The Grid Algorithm Behind Rotting Oranges

5 views

6h ago

Gopo workspace
LeetCode Weekly Contest Q2 — Maximum Equal Adjacent Pairs After One Replacement (Full Solution)

LeetCode Weekly Contest — Q2: Maximum Equal Adjacent Pairs After at Most One Replacement In this video, I break down an ...

7:45
LeetCode Weekly Contest Q2 — Maximum Equal Adjacent Pairs After One Replacement (Full Solution)

74 views

16h ago