ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

105 results

StackOptimist
Dynamic Programming: The Two Signs You Need It

Dynamic programming has two signs that tell you when a problem needs it, and this video draws both of them in just over 7 ...

7:15
Dynamic Programming: The Two Signs You Need It

3 views

1 day ago

Naruto_2005
CSES Dice Combinations | 1D Dynamic Programming Explained | CSES DP #1

CSES Problem Set – Dynamic Programming Series In this video, we solve CSES – Dice Combinations, the first problem in the ...

10:41
CSES Dice Combinations | 1D Dynamic Programming Explained | CSES DP #1

2 views

5 days ago

Naruto_2005
CSES Minimizing Coins | 1D Dynamic Programming Explained | CSES DP #2

CSES Problem Set – Dynamic Programming Series In this video, we solve CSES – Minimizing Coins, the second problem in ...

10:38
CSES Minimizing Coins | 1D Dynamic Programming Explained | CSES DP #2

2 views

5 days ago

Errichto Algorithms
CSES Dynamic Programming problems part 4/4

The last three CSES dynamic programming problems: Counting Tilings, Counting Numbers, Increasing Subsequence II.

1:56:05
CSES Dynamic Programming problems part 4/4

5,845 views

Streamed 6 days ago

The Logic Blueprint
The DP Trick That Turns n! Into 2^n · n (Bitmask DP)

Dynamic Programming becomes much easier once you learn how to turn “what has already been chosen” into a state.

6:36
The DP Trick That Turns n! Into 2^n · n (Bitmask DP)

21 views

4 days ago

LindorCodes
LeetCode 70: Climbing Stairs — Bottom-Up DP From O(N) Space to O(1)

https://leetcode.com/problems/climbing-stairs/ Climbing Stairs (LeetCode 70) looks simple until you have to explain the recurrence ...

16:58
LeetCode 70: Climbing Stairs — Bottom-Up DP From O(N) Space to O(1)

75 views

1 day ago

The Logic Blueprint
The Bitmask DP Trick That Turns 3ⁿ into n·2ⁿ | SOS DP

Dynamic Programming and competitive programming often hide powerful structure behind simple-looking brute force. In this video ...

6:11
The Bitmask DP Trick That Turns 3ⁿ into n·2ⁿ | SOS DP

28 views

1 day ago

OmerVerse
221 | Introduction To Dynamic Programming

Course Files & Resources All the files, notebooks, PDFs, and other resources used in this **Python with DSA** course are ...

10:59
221 | Introduction To Dynamic Programming

0 views

5 days ago

Errichto Algorithms
CSES Dynamic Programming problems part 3

Solving CSES dynamic programming problems, starting from Two Sets II. https://cses.fi/problemset Part 1 ...

2:12:27
CSES Dynamic Programming problems part 3

7,553 views

Streamed 7 days ago

The Logic Blueprint
How Bitmask DP Solves the Travelling Salesman Problem(TSP)

Learn a powerful Dynamic Programming Fundamentals technique: bitmask DP, using the Travelling Salesman Problem as our ...

6:51
How Bitmask DP Solves the Travelling Salesman Problem(TSP)

83 views

3 days ago

CodingNinja
Can You Solve LeetCode 1262? Greatest Sum Divisible by Three | Coding Only

Instead of a brute-force approach, we use Dynamic Programming (DP) to keep track of the maximum possible sum for each ...

1:12
Can You Solve LeetCode 1262? Greatest Sum Divisible by Three | Coding Only

136 views

4 days ago

Mehul(X)CP
Book Shop || Learn Dynamic Programming || CSES || C++ || DP

In this video I have tried to explain solution of CP problem in easiest manner CODE LINK- https://cses.fi/paste ...

16:36
Book Shop || Learn Dynamic Programming || CSES || C++ || DP

142 views

3 days ago

EdgeCaseOffByOne
LeetCode 877: Stone Game 🪨 | The DP Trick That Guarantees Alice Wins!

LeetCode 877 — Stone Game Alice and Bob are playing a game with piles of stones. On every turn, a player can take a pile ...

9:32
LeetCode 877: Stone Game 🪨 | The DP Trick That Guarantees Alice Wins!

17 views

3 days ago

The Logic Blueprint
DP on Trees: The Logic Blueprint for Solving Tree Problems

In this episode of The Logic Blueprint, we build a clear mental model for solving tree dynamic programming problems. You'll learn ...

4:03
DP on Trees: The Logic Blueprint for Solving Tree Problems

37 views

22 hours ago

The Logic Blueprint
Tree DP Explained: The 2-State Trick Behind House Robber III
6:01
Tree DP Explained: The 2-State Trick Behind House Robber III

0 views

0

EdgeCaseOffByOne
LeetCode 3882: Minimum XOR Path in a Grid | DP + Bitwise XOR Explained

In this video, we solve LeetCode 3882 – Minimum XOR Path in a Grid using Dynamic Programming and Bitwise XOR. We'll cover: ...

12:10
LeetCode 3882: Minimum XOR Path in a Grid | DP + Bitwise XOR Explained

18 views

7 days ago

Mehul(X)CP
Array Description || Learn Dynamic Programming ||  CSES Problem Set  || C++ || DP

In this video I have tried to explain solution of CP problem in easiest manner CODE LINK- ...

24:53
Array Description || Learn Dynamic Programming || CSES Problem Set || C++ || DP

79 views

1 day ago

izumicode
Daily LeetCode Problem #1588 | Sum of All Odd Length Subarrays | Dynamic Programming | C++

#DailyLeetCode #LeetCode #LeetCode1588 #SumOfAllOddLengthSubarrays #DynamicProgramming #DP #Subarray ...

32:00
Daily LeetCode Problem #1588 | Sum of All Odd Length Subarrays | Dynamic Programming | C++

9 views

1 day ago

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

... leetcode dynamic programming leetcode dp problems leetcode prefix sum stone game viii stone game 8 stone game 8 leetcode ...

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

153 views

5 days ago

CS Notes
Stone Game VIII | LeetCode 1872 | Prefix Sum + DP Explained Visually

Can Alice maximize her score difference in Stone Game VIII? This LeetCode POTD looks like a game simulation problem, ...

8:11
Stone Game VIII | LeetCode 1872 | Prefix Sum + DP Explained Visually

13 views

5 days ago