ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

73 results

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

0 views

5 hours ago

The Logic Blueprint
The DP Pattern That Solves Every Subsequence Problem | Longest Increasing Subsequence

Dynamic Programming becomes much easier when you stop memorizing solutions and start seeing the pattern behind them. In this ...

2:52
The DP Pattern That Solves Every Subsequence Problem | Longest Increasing Subsequence

8 views

3 days ago

Concepts Fire
DSA Day 36/90: Recursive String Parser Spikes Latency — Interval DP Fix | Concepts Fire

Most developers parse compressed query strings by trying every possible cut combination recursively. Stack frames pile up.

3:03
DSA Day 36/90: Recursive String Parser Spikes Latency — Interval DP Fix | Concepts Fire

0 views

3 days ago

Concepts Fire
DSA Day 37/90: Brute Force Task Scheduling Breaks Systems - Tree DP Fix | Concepts Fire

... Tree DP, DP on Trees, House Robber 3, Tree Dynamic Programming C++, DSA in 90 Days, Concepts Fire DSA, House Robber ...

3:33
DSA Day 37/90: Brute Force Task Scheduling Breaks Systems - Tree DP Fix | Concepts Fire

0 views

2 days ago

Centre for Networked Intelligence, IISc
Day 1 - Static stochastic optimization & Dynamic programming
Upcoming
Day 1 - Static stochastic optimization & Dynamic programming

0 views

0

The Logic Blueprint
Best Time to Buy and Sell Stock IV (K Transactions)

Practice after watching: Start with the exact problem, then move through related dynamic programming problems until the state ...

3:25
Best Time to Buy and Sell Stock IV (K Transactions)

15 views

6 days ago

Leetcode Unlocked
413. Arithmetic Slices | Leetcode Unlocked - Python

Master LeetCode 413 Arithmetic Slices with this quick and easy explanation! In this video, we break down the optimal approach to ...

3:54
413. Arithmetic Slices | Leetcode Unlocked - Python

7 views

1 day 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

4 days ago

The Logic Blueprint
Printing the Longest Increasing Subsequence

... interviews, competitive programming, or trying to build stronger intuition for dynamic programming reconstruction problems.

2:40
Printing the Longest Increasing Subsequence

5 views

2 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

0 views

1 day ago

The Logic Blueprint
Buy and Sell Stock With Fees

Dynamic Programming becomes much easier when you stop memorizing formulas and start seeing the state machine underneath ...

3:34
Buy and Sell Stock With Fees

15 views

4 days ago

The Logic Blueprint
Buy & Sell Stock with Cooldown

Dynamic Programming becomes much easier when you stop memorizing formulas and start tracking what each transition really ...

2:45
Buy & Sell Stock with Cooldown

17 views

5 days ago

DSA Unlocked
LeetCode 3336 | Find the Number of Subsequences With Equal GCD | Hard DP + GCD #python #leetcode3336

LeetCode 3336 – Find the Number of Subsequences With Equal GCD In this video, we solve LeetCode 3336, a Hard-level ...

3:50
LeetCode 3336 | Find the Number of Subsequences With Equal GCD | Hard DP + GCD #python #leetcode3336

18 views

5 days ago

Learn For Free
Master Python Algorithms | 01A

Course: Master Python Algorithms Module 01: Algorithm Foundations Lecture A: Introduction to The Course Link to the ...

2:35
Master Python Algorithms | 01A

0 views

3 days ago

DSAEssentials
DSA Coding challenge: Longest bitonic subarray

In this video, we solve a coding problem on finding the longest bitonic subarray using dynamic programming.

3:33
DSA Coding challenge: Longest bitonic subarray

2 views

3 days ago

DSA Cache
236 AllPathsWithTargetSum DFS Backtracking
1:11
236 AllPathsWithTargetSum DFS Backtracking

1 view

4 days ago

Data Knox
Transit AI Solves DMVPN Issues in Under 1 Minute

DMVPN problems are some of the nastiest to troubleshoot — NHRP registrations failing, tunnels that won't come up, spokes that ...

3:46
Transit AI Solves DMVPN Issues in Under 1 Minute

259 views

5 days ago

CODE WITH ME
Context Engineering Explained in 60 Seconds

Everyone talks about prompt engineering — but the real skill behind reliable AI agents is context engineering. Context ...

1:47
Context Engineering Explained in 60 Seconds

3 views

3 days ago

Krisvik AI
Slash LLM API Costs by 27% | Scaling AI Agents in Production (Playbook)

Are you letting your LLM API calls drain your budget? This is a deep dive into the architectural fixes we made to scale an AI agent ...

3:34
Slash LLM API Costs by 27% | Scaling AI Agents in Production (Playbook)

3 views

6 days ago

AI Vidya
Escaping the Rulebook  How Machines Learned to Think

A calculator can perfectly process astronomical numbers in an instant, yet it is completely blind to a simple, blurry photo of a cat.

3:54
Escaping the Rulebook How Machines Learned to Think

5 views

6 days ago