ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

86 results

Visualcoders
2. Types of knapsack | Dynamic Programming Series

The 0/1 Knapsack problem is the foundation of Dynamic Programming — learn this one pattern and a whole family of DP ...

5:58
2. Types of knapsack | Dynamic Programming Series

53 views

3 weeks ago

Recess with Researchers
Dynamic Programming + Knapsack: Understanding Overlapping Subproblems (The Easy Way)

Dynamic Programming & the 0-1 Knapsack Problem | Understanding the Core Idea Welcome to Part 4 of our 7-video series on the ...

13:45
Dynamic Programming + Knapsack: Understanding Overlapping Subproblems (The Easy Way)

7 views

2 weeks ago

Visualcoders
Best Way To Understand Dynamic Programming  - Follow This Approach

Dynamic Programming is just recursion with memory — and this video shows you how to identify a DP problem before you write a ...

7:23
Best Way To Understand Dynamic Programming - Follow This Approach

179 views

3 weeks ago

Tech With Nikola
Every Dynamic Programming Problem Is the Same 5 Patterns

Every Dynamic Programming Problem Is the Same 5 Patterns Check out my Dynamic Programming course (founders edition ...

19:52
Every Dynamic Programming Problem Is the Same 5 Patterns

10,261 views

3 weeks ago

Recess with Researchers
Solving 0-1 Knapsack with Dynamic Programming: A Complete Walkthrough

0-1 Knapsack Dynamic Programming — Full Worked Example (Step-by-Step Table) Welcome to Part 5 of our 7-video series on ...

7:56
Solving 0-1 Knapsack with Dynamic Programming: A Complete Walkthrough

5 views

2 weeks ago

Visualcoders
3. Knapsack Recursive: The Two Cases That Solve Everything

In this video you'll learn the exact 4 steps that turn any Dynamic Programming problem into recursive code, and then you'll watch ...

8:47
3. Knapsack Recursive: The Two Cases That Solve Everything

89 views

2 weeks ago

Recess with Researchers
Why the 0 1 Knapsack Problem Still Matters

Why the 0-1 Knapsack Problem Still Matters | Real-Life Applications You Never Expected!

8:48
Why the 0 1 Knapsack Problem Still Matters

5 views

2 weeks ago

Engineer dude learning
Complete O/1 Knapsack Using Table Method And Set Method Explained Easily 😍

Topics Covered: ✓ 0-1 Knapsack Problem ✓ Set Method for Knapsack ✓ Dynamic Programming Approach ✓ State Space ...

32:08
Complete O/1 Knapsack Using Table Method And Set Method Explained Easily 😍

7,617 views

3 weeks ago

Recess with Researchers
Greedy Algorithms for Knapsack: Fast, Fun… and Sometimes Wrong!

Greedy Algorithms for the 0-1 Knapsack Problem | Fast… But Sometimes Wrong! Welcome to Part 3 of our 7-video series on the ...

14:07
Greedy Algorithms for Knapsack: Fast, Fun… and Sometimes Wrong!

3 views

2 weeks ago

Recess with Researchers
The 0-1 Knapsack Problem Explained: What a Thief Can Teach Us About Algorithms!

Ever wondered how a thief decides what to steal? Turns out… he's basically solving a famous computer science problem!

9:28
The 0-1 Knapsack Problem Explained: What a Thief Can Teach Us About Algorithms!

11 views

2 weeks ago

Recess with Researchers
Why 0 1 Knapsack Is Hard NP Completeness

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 ...

14:34
Why 0 1 Knapsack Is Hard NP Completeness

13 views

2 weeks ago

Recess with Researchers
Is Knapsack Really Polynomial? The Truth About Pseudo-Polynomial Time!

Is 0-1 Knapsack Polynomial-Time? Nope! | The Truth About Pseudo-Polynomial DP Welcome to Part 6 of our 7-video series on ...

5:30
Is Knapsack Really Polynomial? The Truth About Pseudo-Polynomial Time!

6 views

2 weeks ago

AlgoMonster
Dynamic Programming is not difficult

Full breakdown of every DP pattern: https://algo.monster/problems/dynamic_programming_intro Comment below and tell us which ...

10:28
Dynamic Programming is not difficult

17,353 views

3 weeks ago

SP Learning Labs
When Greedy Works and When It Doesn't

Master the greedy strategy to solve algorithm problems efficiently. Learn when to choose this approach versus dynamic ...

16:26
When Greedy Works and When It Doesn't

12 views

2 weeks ago

Visualcoders
5. One DP Table Replaces Every Recursive Call — Tabulation Explained

... https://www.youtube.com/playlist?list=PL2MKEvl7Sd7leuFfXExK3V8vdy37LutSJ #DynamicProgramming #Knapsack ...

13:29
5. One DP Table Replaces Every Recursive Call — Tabulation Explained

44 views

2 days ago

SAIMON NEUPANE
0/1 Knapsack Problem(Algorithms and Complexity Presentation)
19:54
0/1 Knapsack Problem(Algorithms and Complexity Presentation)

15 views

3 weeks ago

Craqit - Crack the interview
Coin Change & the Knapsack Family — the DP Masterclass (322, 518, 0/1 vs Unbounded)

... #dynamicprogramming #knapsack #dp #leetcode #codinginterview #algorithms #datastructures #softwareengineering #faang.

16:33
Coin Change & the Knapsack Family — the DP Masterclass (322, 518, 0/1 vs Unbounded)

5 views

2 weeks ago

Craqit - Crack the interview
Dynamic Programming, Visualized (Why It Feels Impossible)

Computing the 50th Fibonacci number the obvious way makes ~25000000000 function calls. The smart way makes 50.

15:30
Dynamic Programming, Visualized (Why It Feels Impossible)

13 views

4 weeks ago

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

0 views

0

Book & Talks
Lec 13 || Dynamic Programming ~ 0/1 Knapsack Problem | Analysis & Design of Algorithm | Book_&_talks

unit 1 Introduction Algorithm definition and specification - Design of Algorithms, and Analysis of Algorithms, Asymptotic Notations, ...

4:37
Lec 13 || Dynamic Programming ~ 0/1 Knapsack Problem | Analysis & Design of Algorithm | Book_&_talks

26 views

8 days ago