ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

211 results

Mind Facts - Why ?
Computer Science: Dynamic Programming Explained — How to Avoid Repeating Yourself

Learn dynamic programming optimization techniques and how memoization boosts performance. #computerscience ...

8:43
Computer Science: Dynamic Programming Explained — How to Avoid Repeating Yourself

0 views

2 hours ago

Chai aur Code
25. Dynamic Programming 01 Knapsack Problem

for more https://chaicode.com Welcome to chai aur code, a coding/programming dedicated channel in Hindi language. Now you ...

1:38:06
25. Dynamic Programming 01 Knapsack Problem

1,116 views

19 hours ago

codeTips
Minimum Cost to Convert String II | LeetCode 2977 | Graph | Dynamic Programming | Floyd Warshall

LeetCode Problem – Minimum Cost to Convert String II | C++ Solution Explained In this video, we solve the LeetCode Problem ...

36:57
Minimum Cost to Convert String II | LeetCode 2977 | Graph | Dynamic Programming | Floyd Warshall

78 views

6 hours ago

Tech Explainer
Every Computer Algorithm Explained in 8 Minutes

You'll learn about search algorithms, sorting methods, recursion, encryption, dynamic programming, and more, with real-world ...

8:33
Every Computer Algorithm Explained in 8 Minutes

63 views

23 hours ago

Code With Vick
Leetcode 2977 | Minimum Cost to Convert String II | Hard | Graph | Dynamic Programming

In this video i have explained about how to use graph and Flyod Warshall Algorithm in this problem with Dynamic programming.

29:05
Leetcode 2977 | Minimum Cost to Convert String II | Hard | Graph | Dynamic Programming

83 views

10 hours ago

Developer Coder
Minimum Cost to Convert String II | LeetCode 2977 | Trie | DP | Java Code | Developer Coder
56:58
Minimum Cost to Convert String II | LeetCode 2977 | Trie | DP | Java Code | Developer Coder

0 views

0

Abhishek Mishra – Mathematics & TCS
DAA 11 – Dynamic Programming: Fibonacci, 0/1 Knapsack & DP Paradigm | CS F364

This lecture is DAA 11 in the Design and Analysis of Algorithms (DAA) course (CS F364). It introduces the Dynamic Programming ...

47:51
DAA 11 – Dynamic Programming: Fibonacci, 0/1 Knapsack & DP Paradigm | CS F364

12 views

1 day ago

Leetcode Daily
2977. Minimum Cost to Convert String II | Leetcode Daily - Python

... deep dive into Tries, Floyd-Warshall, and Dynamic Programming. We explain how to build a prefix tree for substring mapping, ...

10:05
2977. Minimum Cost to Convert String II | Leetcode Daily - Python

56 views

4 hours ago

Sanyam IIT Guwahati
Minimum Cost to Convert String II | LeetCode 2977 |  DP on Substrings | No Trie Needed

... #GraphTheory #Dijkstra #DynamicProgramming #StringAlgorithms #Substrings #ProblemSolving #LeetCode2977 #Cplusplus ...

41:06
Minimum Cost to Convert String II | LeetCode 2977 | DP on Substrings | No Trie Needed

419 views

7 hours ago

DSA Unlocked
LEETCODE 2977 Explained 🔥 Trie + Floyd Warshall + DP | Hard Problem | #problemoftheday | 30/01/2026

... LeetCode Hard, Trie, Floyd Warshall, String DP, Dynamic Programming, DSA Unlocked, Coding Interview, FAANG Preparation ...

28:24
LEETCODE 2977 Explained 🔥 Trie + Floyd Warshall + DP | Hard Problem | #problemoftheday | 30/01/2026

0 views

14 minutes ago

vHiren
L30 - Multi Dimensional DP | Longest Increasing Path In A Matrix | 2D DP | LeetCode 329

Longest Increasing Path In A Matrix problem using 2D Dynamic Programming. We approach it by exploring directional growth ...

20:02
L30 - Multi Dimensional DP | Longest Increasing Path In A Matrix | 2D DP | LeetCode 329

7 views

9 hours ago

The Structural Econ Guy
Dynamic Discrete Choice Models: Finite Horizon Framework

#Econometrics #DynamicProgramming #DiscreteChoice #StructuralEstimation #DynamicDiscreteChoice #DDC ...

8:34
Dynamic Discrete Choice Models: Finite Horizon Framework

0 views

6 hours ago

Study Placement
Minimum Cost to Convert String II | LeetCode 2977 | Trie + DP + Optimization Explained

3️⃣ Dynamic Programming (Top-Down / Bottom-Up) - dp[i] = minimum cost to convert source[i…n-1] to target[i…n-1]. - For each ...

1:13:18
Minimum Cost to Convert String II | LeetCode 2977 | Trie + DP + Optimization Explained

260 views

7 hours ago

Daily LeetCode
2977  Minimum Cost to Convert String II

... Graph construction for substring transformations Dijkstra for minimum transformation cost Dynamic Programming solution Time ...

8:25
2977 Minimum Cost to Convert String II

0 views

5 hours ago

Code Kage
LeetCode 2977 | Minimum Cost to Convert String II | DP + Floyd Warshall Explained | Java

In this video, we solve LeetCode 2977: Minimum Cost to Convert String II, a tricky string + graph + dynamic programming problem.

22:11
LeetCode 2977 | Minimum Cost to Convert String II | DP + Floyd Warshall Explained | Java

12 views

2 hours ago

Code Maestro Rtj
Leetcode 2977. Minimum Cost to Convert String II

... https://www.youtube.com/watch?v=oMxogjd0wWI&list=PLK4o0GPjECurkKA0KfY3httU8CRf7tAG3 Dynamic Programming: ...

13:25
Leetcode 2977. Minimum Cost to Convert String II

0 views

2 hours ago

SunBeam Institute
Data Structures & Algorithms Using Core Java | Batch DSA-O-12 | Day 1

... Operations ✓ Graph Algorithms ✓ Divide & Conquer ✓ Greedy & Dynamic Programming ‍ Trainer: Mr. Devendra Dhande ...

2:49:37
Data Structures & Algorithms Using Core Java | Batch DSA-O-12 | Day 1

83 views

14 hours ago

codestorywithMIK
Minimum Cost Path with Teleportations | 3 Approaches | Postmortem | Leetcode 3651 | codestorywithMIK

... https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A This is the 131st Video of our Playlist "Dynamic Programming ...

1:22:20
Minimum Cost Path with Teleportations | 3 Approaches | Postmortem | Leetcode 3651 | codestorywithMIK

2,540 views

19 hours ago

Dynamic Coding
🎯 Python Sets Explained | Unique Elements, Fast Lookup & Set Operations 🔥 @dc_1136

Welcome to my youtube channel - Dynamic Coding with Sachin Sets in Python are powerful data structures that store **unique ...

40:05
🎯 Python Sets Explained | Unique Elements, Fast Lookup & Set Operations 🔥 @dc_1136

4 views

14 hours ago

ExpertFunda
LeetCode 2977 Explained | Minimum Cost to Convert String II (DP + Graph)

This beginner-friendly explanation breaks down Minimum Cost to Convert String II using dynamic programming and graph ...

18:08
LeetCode 2977 Explained | Minimum Cost to Convert String II (DP + Graph)

27 views

8 hours ago