ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

88 results

Sahil & Sarra
I solved 541 Leetcode problems. But you need only 150.

1. How to use Leetcode effectively? 2. How to learn Data Structures and Algorithms? 3. How to use Leetcode solutions? 4.

7:42
I solved 541 Leetcode problems. But you need only 150.

2,534,617 views

3 years ago

Eric Websmith
Leetcode 208 Implement Trie Prefix Tree ||  Python || Blind 75 Leetcode Questions

00:00 Introduction Trie 01:42 Demo 03:19 Python Code Web page used in this video: ...

6:00
Leetcode 208 Implement Trie Prefix Tree || Python || Blind 75 Leetcode Questions

22 views

3 years ago

Off By One
Two Sum - Leetcode 1 - Blind 75 Explained - Arrays - Python

In this video, I will be showing you how to solve Two Sum, Leetcode 1, in O(n) time using a HashMap in Python. Blind 75 Solutions ...

6:59
Two Sum - Leetcode 1 - Blind 75 Explained - Arrays - Python

528 views

3 years ago

Eric Websmith
Leetcode 211 Design Add and Search Words Data Structure Blind 75

https://ericwebsmith.github.io/leetcode_web/?id=211 00:00 Introduction 00:22 Official answer is wrong 00:48 Demonstrate the ...

4:38
Leetcode 211 Design Add and Search Words Data Structure Blind 75

27 views

3 years ago

Off By One
Longest Increasing Subsequence - Leetcode 300 - Blind 75 Explained - Dynamic Programming - Python

In this video, I will be showing you how to solve Longest Increasing Subsequence, Leetcode 300, in O(n^2) time and O(n) space ...

11:00
Longest Increasing Subsequence - Leetcode 300 - Blind 75 Explained - Dynamic Programming - Python

496 views

3 years ago

Off By One
Best Time to Buy and Sell Stock - Leetcode 121 - Blind 75 Explained - Arrays - Python

In this video, I will be showing you how to solve Best Time to Buy and Sell Stock in O(n) time and O(1) space in Python. Blind 75 ...

7:25
Best Time to Buy and Sell Stock - Leetcode 121 - Blind 75 Explained - Arrays - Python

259 views

3 years ago

Off By One
House Robber - Leetcode 198  - Blind 75 Explained - Dynamic Programming - Python

In this video, I will be showing you how to solve House Robber, Leetcode 198, in O(n) time and O(1) space in Python with ...

11:44
House Robber - Leetcode 198 - Blind 75 Explained - Dynamic Programming - Python

542 views

3 years ago

Off By One
Coin Change - Leetcode 322 - Blind 75 Explained - Dynamic Programming - Python

In this video, I will be showing you how to solve Coin Change, Leetcode 322, in O(n*m) time and O(n) space in Python with ...

13:25
Coin Change - Leetcode 322 - Blind 75 Explained - Dynamic Programming - Python

511 views

3 years ago

Off By One
Longest Common Subsequence - Leetcode 1143 - Blind 75 Explained - Dynamic Programming - Python

In this video, I will be showing you how to solve Longest Common Subsequence, Leetcode 1143 , in O(n*m) time and O(n*m) ...

10:55
Longest Common Subsequence - Leetcode 1143 - Blind 75 Explained - Dynamic Programming - Python

455 views

3 years ago

PIRATE KING
How to Use LeetCode Effectively

My ULTIMATE LeetCode Cheat Sheet https://piratekingdom.com/leetcode 🎖️ $1500 OFF ANY Online Tech Bootcamps.

8:44
How to Use LeetCode Effectively

365,753 views

4 years ago

Qiqi Impact
How To Get Good At LeetCode

... video: • Blind 75 - https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions • Neetcode Roadmap ...

5:03
How To Get Good At LeetCode

394,545 views

2 years ago

Off By One
Maximum Product Subarray  - Leetcode 152 - Blind 75 Explained - Arrays - Python

In this video, I will be showing you how to solve Maximum Product Subarray, Leetcode 152, in O(n) time and O(1) space in Python.

11:40
Maximum Product Subarray - Leetcode 152 - Blind 75 Explained - Arrays - Python

461 views

3 years ago

Chaz Winter
LeetCode 9 - Palindrome Number (Two Solutions, Integer and String) - Java Solution and Explanation

LeetCode Java solution from Chaz Winter. This one is for the Palindrome Number problem, both the String solution and the ...

15:00
LeetCode 9 - Palindrome Number (Two Solutions, Integer and String) - Java Solution and Explanation

862 views

2 years ago

Fraz
All Leetcode Patterns and OA questions | Zero to Master in DSA with Articles | Fraz's DSA Sheet

Fraz's DSA Sheet https://learnyard.com/practice/dsa/ Don't forget to participate in the contest I'm Fraz, an ex-Google engineer, ...

15:17
All Leetcode Patterns and OA questions | Zero to Master in DSA with Articles | Fraz's DSA Sheet

132,251 views

1 year ago

Gordon Zhu
Two Sum | LeetCode 1 | JavaScript | Easy

In painstaking detail, I go through my entire thought process for solving Two Sum from first principles. We'll start with the essential ...

13:20
Two Sum | LeetCode 1 | JavaScript | Easy

30,308 views

2 years ago

Off By One
Climbing Stairs - Leetcode 70 - Blind 75 Explained - Dynamic Programming - Python

In this video, I will be showing you how to solve Climbing Stairs,Leetcode 70, in O(n) time and O(1) space in Python with Dynamic ...

8:36
Climbing Stairs - Leetcode 70 - Blind 75 Explained - Dynamic Programming - Python

255 views

3 years ago

Chaz Winter
LeetCode 3 - Longest Substring Without Repeating Characters - Java Solution and Explanation

Here's another LeetCode Java solution from Chaz Winter. This one is for the Longest Substring Without Repeating Characters ...

19:53
LeetCode 3 - Longest Substring Without Repeating Characters - Java Solution and Explanation

378 views

2 years ago

Off By One
Combination Sum IV - Leetcode 377 - Blind 75 Explained - Dynamic Programming - Python

In this video, I will be showing you how to solve Combination Sum IV (4), Leetcode 377, in O(n*m) time and O(n) space in Python ...

16:17
Combination Sum IV - Leetcode 377 - Blind 75 Explained - Dynamic Programming - Python

331 views

3 years ago

Off By One
Product of Array Except Self - Leetcode 238 - Blind 75 Explained - Arrays - Python

In this video, I will be showing you how to solve Product of Array Except Self, Leetcode 238, in O(n) time and O(1) space in Python.

10:10
Product of Array Except Self - Leetcode 238 - Blind 75 Explained - Arrays - Python

3,591 views

3 years ago

Off By One
Decode Ways - Leetcode 91 - Blind 75 Explained - Dynamic Programming - Python

In this video, I will be showing you how to solve Decode Ways, Leetcode 91, in Python with Dynamic Programming. Blind 75 ...

15:36
Decode Ways - Leetcode 91 - Blind 75 Explained - Dynamic Programming - Python

1,021 views

3 years ago