ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

348 results

Board Infinity
Dynamic Programming Explained | Fibonacci to Coin Change | Advanced DSA Series Part 7

Welcome to Part 7 of our Advanced DSA Masterclass You're in an interview. You write the recursive Fibonacci solution ...

11:30
Dynamic Programming Explained | Fibonacci to Coin Change | Advanced DSA Series Part 7

6 views

5 days ago

Optimization City
Complete Guide to Deterministic Dynamic Programming | Convex & Non‑Convex Problems Solved

Deterministic Dynamic Programming (DDP) is one of the most powerful and widely used optimization techniques in operations ...

49:40
Complete Guide to Deterministic Dynamic Programming | Convex & Non‑Convex Problems Solved

1 view

11 hours ago

RootCSE
Introduction to Dynamic Programming | Memoization (Top-Down) | Tabulation (Bottom-up) Approach | DP

Introduction to Dynamic Programming | Memoization (Top-Down) | Tabulation (Bottom-up) Approach | DP for any inquiry: ...

40:17
Introduction to Dynamic Programming | Memoization (Top-Down) | Tabulation (Bottom-up) Approach | DP

45 views

6 days ago

The Logic Blueprint
The DP Pattern That Solves Matrix Chain Multiplication | Interval DP Explained

Dynamic Programming becomes much easier when you recognize the **pattern** instead of memorizing solutions. In this episode ...

3:13
The DP Pattern That Solves Matrix Chain Multiplication | Interval DP Explained

10 views

1 day ago

VibeEngines
Edit Distance: How a Grid Tames an Exponential Problem (Dynamic Programming)

Your phone corrects "teh" to "the" and "kitteh" to "kitten" — and to do that it first has to measure how different two words are.

3:16
Edit Distance: How a Grid Tames an Exponential Problem (Dynamic Programming)

5 views

4 days ago

Farhad Dubey | Engineering Excellence
Decode Ways | Dynamic Programming Explained Visually | LeetCode Java | Interview DP Pattern

Decode Ways (LeetCode 91) Explained Like Never Before! In this video, we solve one of the most popular Dynamic Programming ...

23:34
Decode Ways | Dynamic Programming Explained Visually | LeetCode Java | Interview DP Pattern

9 views

5 days ago

Multi Atoms
Analysis & Design of Algorithm Unit-3 Dynamic Programming (CS-402)  RGPV BTech 4th Sem

Welcome to the Complete Analysis & Design of Algorithm (CS-402) Unit-3 Series for RGPV Students! Are you preparing for RGPV ...

13:59
Analysis & Design of Algorithm Unit-3 Dynamic Programming (CS-402) RGPV BTech 4th Sem

41 views

1 day ago

Multi Atoms
Analysis & Design of Algorithm Unit-3  0/1 Knapsack Dynamic Programming (CS-402)  RGPV BTech 4th Sem

Welcome to the Complete Analysis & Design of Algorithm (CS-402) Unit-3 Series for RGPV Students Are you preparing for RGPV ...

24:41
Analysis & Design of Algorithm Unit-3 0/1 Knapsack Dynamic Programming (CS-402) RGPV BTech 4th Sem

40 views

1 day ago

Farhad Dubey | Engineering Excellence
LeetCode 72: Edit Distance | Dynamic Programming Explained with Dry Run | Java | DP Masterclass

Dear all, Welcome to the Galaxy of Codes! In this video, we'll master LeetCode 72: Edit Distance, one of the most famous ...

29:10
LeetCode 72: Edit Distance | Dynamic Programming Explained with Dry Run | Java | DP Masterclass

9 views

5 days ago

Farhad Dubey | Engineering Excellence
LeetCode 322: Coin Change | Dynamic Programming Explained with Dry Run | Java | DP Masterclass

Description Welcome to the Galaxy of Codes! In this video, we'll master LeetCode 322: Coin Change, one of the most ...

14:01
LeetCode 322: Coin Change | Dynamic Programming Explained with Dry Run | Java | DP Masterclass

16 views

7 days ago

Save My Interview
Recursion Explained: Why Naive Fibonacci is Slow | DSA in 3 min

... with @functools.cache — exponential becomes linear • The gateway to dynamic programming • When recursion shines (trees, ...

3:20
Recursion Explained: Why Naive Fibonacci is Slow | DSA in 3 min

1 view

2 days ago

Tech With Tim
AI Agents Explained - What Is an AI Agent and how to build one? (Real Examples, Not Hype)

Best courses to learn all about AI agents and AI engineering: DataCamp's Associate AI Engineer for Developers Track ...

21:34
AI Agents Explained - What Is an AI Agent and how to build one? (Real Examples, Not Hype)

43,721 views

4 days ago

SCIENCE IN FRONT OF YOU
Kadane's Algorithm | GFG Solution in C++ | Maximum Subarray Sum Explained

Topics Covered: Kadane's Algorithm Maximum Subarray Sum Dynamic Programming Arrays Greedy Technique Interview ...

0:37
Kadane's Algorithm | GFG Solution in C++ | Maximum Subarray Sum Explained

1 view

5 days ago

Leetcode Unlocked
416. Partition Equal Subset Sum | Leetcode Unlocked - Python

This classic Dynamic Programming problem is a famous variation of the 0/1 Knapsack algorithm and is a must-know for technical ...

5:40
416. Partition Equal Subset Sum | Leetcode Unlocked - Python

4 views

2 days ago

Google Cloud Tech
Context engineering vs prompt engineering: What's the difference

White-paper on context engineering → https://goo.gle/3QiKYbT More info on context engineering → https://goo.gle/43fII8c Context ...

10:05
Context engineering vs prompt engineering: What's the difference

56,543 views

5 days ago

theTwoCubes Learning
Python Programming Explained | What is Programming

Ever wondered how computers understand our commands? This complete guide to Python programming demystifies the ...

8:51
Python Programming Explained | What is Programming

22 views

6 days ago

SysSketch
Static vs Dynamic Compilation: The Real Trade-Off

Every program has to turn source code into instructions a CPU can run — but compilers can do that translation at two completely ...

5:27
Static vs Dynamic Compilation: The Real Trade-Off

5 views

1 day ago

Shaan Labs
LeetCode 3336 Hard Explained: The 4 Fears That Make Everyone Skip This DP Problem | Java

2^200 subsequences. You close the tab. That's fear number one. This video removes the 4 fears that make almost every student ...

11:36
LeetCode 3336 Hard Explained: The 4 Fears That Make Everyone Skip This DP Problem | Java

38 views

6 days ago

Android X-Ray
Dynamic Code Loading Explained | Android Reverse Engineering (Part 1)

In this video, we explore one of the most important concepts in Android reverse engineering: Dynamic Code Loading (DCL).

7:39
Dynamic Code Loading Explained | Android Reverse Engineering (Part 1)

50 views

1 day ago

Sketch Mind
C Programming #11 | Dynamic Memory Allocation in C explained ⭐

Welcome to the final chapter of the Complete C Programming Series! In this chapter, we'll explore Dynamic Memory Allocation, ...

7:52
C Programming #11 | Dynamic Memory Allocation in C explained ⭐

4 views

6 days ago