Upload date
All time
Last hour
Today
This week
This month
This year
Type
All
Video
Channel
Playlist
Movie
Duration
Short (< 4 minutes)
Medium (4-20 minutes)
Long (> 20 minutes)
Sort by
Relevance
Rating
View count
Features
HD
Subtitles/CC
Creative Commons
3D
Live
4K
360°
VR180
HDR
86 results
The 0/1 Knapsack problem is the foundation of Dynamic Programming — learn this one pattern and a whole family of DP ...
53 views
3 weeks ago
Dynamic Programming & the 0-1 Knapsack Problem | Understanding the Core Idea Welcome to Part 4 of our 7-video series on the ...
7 views
2 weeks ago
Dynamic Programming is just recursion with memory — and this video shows you how to identify a DP problem before you write a ...
179 views
Every Dynamic Programming Problem Is the Same 5 Patterns Check out my Dynamic Programming course (founders edition ...
10,261 views
0-1 Knapsack Dynamic Programming — Full Worked Example (Step-by-Step Table) Welcome to Part 5 of our 7-video series on ...
5 views
In this video you'll learn the exact 4 steps that turn any Dynamic Programming problem into recursive code, and then you'll watch ...
89 views
Why the 0-1 Knapsack Problem Still Matters | Real-Life Applications You Never Expected!
Topics Covered: ✓ 0-1 Knapsack Problem ✓ Set Method for Knapsack ✓ Dynamic Programming Approach ✓ State Space ...
7,617 views
Greedy Algorithms for the 0-1 Knapsack Problem | Fast… But Sometimes Wrong! Welcome to Part 3 of our 7-video series on the ...
3 views
Ever wondered how a thief decides what to steal? Turns out… he's basically solving a famous computer science problem!
11 views
Why Is the 0-1 Knapsack Problem So Hard? | NP-Completeness Explained! Welcome to Part 2 of our 7-video series on the 0-1 ...
13 views
Is 0-1 Knapsack Polynomial-Time? Nope! | The Truth About Pseudo-Polynomial DP Welcome to Part 6 of our 7-video series on ...
6 views
Full breakdown of every DP pattern: https://algo.monster/problems/dynamic_programming_intro Comment below and tell us which ...
17,353 views
Master the greedy strategy to solve algorithm problems efficiently. Learn when to choose this approach versus dynamic ...
12 views
... https://www.youtube.com/playlist?list=PL2MKEvl7Sd7leuFfXExK3V8vdy37LutSJ #DynamicProgramming #Knapsack ...
44 views
2 days ago
15 views
... #dynamicprogramming #knapsack #dp #leetcode #codinginterview #algorithms #datastructures #softwareengineering #faang.
Computing the 50th Fibonacci number the obvious way makes ~25000000000 function calls. The smart way makes 50.
4 weeks ago
0 views
0
unit 1 Introduction Algorithm definition and specification - Design of Algorithms, and Analysis of Algorithms, Asymptotic Notations, ...
26 views
8 days ago