ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

6,503 results

freeCodeCamp.org
Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges

Learn how to use Dynamic Programming in this course for beginners. It can help you solve complex programming problems, such ...

5:10:02
Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges

4,683,778 views

5 years ago

MIT OpenCourseWare
Lecture 20: Dynamic Programming II: Text Justification, Blackjack

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Erik Demaine ...

52:12
Lecture 20: Dynamic Programming II: Text Justification, Blackjack

557,512 views

13 years ago

GeeksforGeeks
Egg Dropping Problem - Approach to write the code (Dynamic Programming) | GeeksforGeeks

Find Complete Code at GeeksforGeeks Article: ...

14:00
Egg Dropping Problem - Approach to write the code (Dynamic Programming) | GeeksforGeeks

126,456 views

7 years ago

Geekific
What Is Dynamic Programming and How To Use It | Introduction to Dynamic Programming | DP | Geekific

Discord Community: https://discord.gg/dK6cB24ATp GitHub Repository: https://github.com/geekific-official/ Dynamic Programming ...

7:27
What Is Dynamic Programming and How To Use It | Introduction to Dynamic Programming | DP | Geekific

2,712 views

3 years ago

Nikhil Lohia
Dynamic Programming easy to understand real life examples | Study Algorithms

Super helpful resources: https://nikoo28.github.io/all-my-links/ Dynamic programming is probably the trickiest algorithmic ...

13:11
Dynamic Programming easy to understand real life examples | Study Algorithms

32,471 views

5 years ago

HackerRank
Algorithms: Memoization and Dynamic Programming

Learn the basics of memoization and dynamic programming. This video is a part of HackerRank's Cracking The Coding Interview ...

11:17
Algorithms: Memoization and Dynamic Programming

1,000,922 views

9 years ago

Back To Back SWE
The 0/1 Knapsack Problem (Demystifying Dynamic Programming)

Try Our Full Platform: https://nas.io/backtobackswe Intuitive Video Explanations ❓New Unseen Questions Get All Solutions I ...

20:30
The 0/1 Knapsack Problem (Demystifying Dynamic Programming)

228,670 views

7 years ago

Algorithms with Attitude
Dynamic Programming:  the Rod Cutting Problem

Table of Contents: 00:00 - Introduction and Prerequisites 00:19 - Rod Cutting Problem Definition 00:36 - Dynamic Programming ...

9:59
Dynamic Programming: the Rod Cutting Problem

51,724 views

5 years ago

Gaurav Sen
What is Dynamic Programming and how is it done?

You will often find Dynamic Programming in interview and competitive programming questions. They usually rely more on intuition ...

3:07
What is Dynamic Programming and how is it done?

167,760 views

8 years ago

Errichto Algorithms
Dynamic Programming lecture #2 - Coin change, double counting

Part 1: https://youtu.be/YBSt1jYwVfU This is the second of several lectures about Dynamic Programming. I will again go through ...

18:35
Dynamic Programming lecture #2 - Coin change, double counting

187,352 views

7 years ago

Inside code
How to solve (almost) any binary tree coding problem

Learn graph theory algorithms: https://inscod.com/graphalgo ⚙ Learn dynamic programming: https://inscod.com/dp_course ...

4:20
How to solve (almost) any binary tree coding problem

312,786 views

5 years ago

Geekific
Coin Change Problem II | Number of Ways to Produce Amount | Dynamic Programming | Geekific

Discord Community: https://discord.gg/dK6cB24ATp GitHub Repository: https://github.com/geekific-official/ In the previous video of ...

7:58
Coin Change Problem II | Number of Ways to Produce Amount | Dynamic Programming | Geekific

3,824 views

2 years ago

Data Structures and Algorithms
Handshakes That Don't Cross - Leetcode 1259 - Java - Dynamic Programming

Handshakes That Don't Cross is a Leetcode premium problem which asks to count the number of ways to shake hands between ...

21:25
Handshakes That Don't Cross - Leetcode 1259 - Java - Dynamic Programming

37 views

2 months ago

Back To Back SWE
The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms

0/1 Code & Problem Statement ...

13:44
The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms

558,169 views

7 years ago

MIT OpenCourseWare
Recitation 21: Dynamic Programming: Knapsack Problem

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Victor Costan ...

1:09:12
Recitation 21: Dynamic Programming: Knapsack Problem

207,830 views

13 years ago

freeCodeCamp.org
Graph Algorithms for Technical Interviews - Full Course

Learn how to implement graph algorithms and how to use them to solve coding challenges. ✏️ This course was developed by ...

2:12:19
Graph Algorithms for Technical Interviews - Full Course

1,481,695 views

4 years ago

Gate Smashers
L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)

Confused between Greedy Algorithms and Dynamic Programming? In this video, Varun sir will explain the key differences with ...

9:08
L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)

1,135,140 views

6 years ago

Nikhil Lohia
Unique Paths (LeetCode 62) | Full Dynamic Programming method with Memoization

Join this channel to get access to perks: https://www.youtube.com/channel/UCT-S2ngqEBoYCM5UKuNeELg/join Actual Problem: ...

15:48
Unique Paths (LeetCode 62) | Full Dynamic Programming method with Memoization

15,273 views

1 year ago

Abdul Bari
4.9 Longest Common Subsequence (LCS)  - Recursion and Dynamic Programming

Longest Common Subsequence Problem using 1. Recursion 2. Memoization 3. Dynamic Programming PATREON ...

23:35
4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming

1,544,078 views

8 years ago

MIT OpenCourseWare
11. Dynamic Programming: All-Pairs Shortest Paths

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:21:49
11. Dynamic Programming: All-Pairs Shortest Paths

116,616 views

10 years ago