ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

219 results

Mastering Programming
This Question Is Amazon Hardest Dynamic Coding Question

"Combinations," is a problem that involves generating all possible combinations of k numbers out of a given range 1 to n. The goal ...

1:08
This Question Is Amazon Hardest Dynamic Coding Question

0 views

20 hours ago

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

0 views

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

7 views

25 minutes ago

Bishal
Decode Ways - Dynamic Programming

dsa #datastructureandalgorithm.

36:17
Decode Ways - Dynamic Programming

0 views

6 hours ago

Dave Ebbelaar
Pydantic Crash Course - Build Reliable Python & AI Applications

Learn Pydantic in this complete 90-minute crash course covering type hints, data validation, nested models, and structured output ...

1:22:22
Pydantic Crash Course - Build Reliable Python & AI Applications

1,657 views

20 hours ago

vHiren
L29 - Multi Dimensional DP | Knight Dialer | 3D DP | LeetCode 935 | Memoization | Tabulation

Knight Dialer problem using 3D Dynamic Programming. We'll be mapping knight movements into matrix and do valid digit ...

18:48
L29 - Multi Dimensional DP | Knight Dialer | 3D DP | LeetCode 935 | Memoization | Tabulation

0 views

10 hours ago

Pavel Mavrin
JetBrains Youth Coding Club 2025-2026, Contest 11

PLEASE DON'T WATCH THIS VIDEO BEFORE YOU SOLVE THE CONTEST! Join the group to solve the contests: ...

1:02:28
JetBrains Youth Coding Club 2025-2026, Contest 11

77 views

16 hours ago

Snowflake Developers
[LIVE] Build Autonomous Lakehouse Pipelines with Dynamic Tables & Apache Iceberg

In this 30-minute livestream, Gilberto Hernandez hosts Parag Jain to break down a key component to modern data engineering: ...

44:20
[LIVE] Build Autonomous Lakehouse Pipelines with Dynamic Tables & Apache Iceberg

121 views

Streamed 15 hours ago

Recurse Center
Tomo: The Language of Tomorrow (and the next day, and the next)

Bruce Hill presents Tomo as part the Recurse Center's Localhost talk series. Tomo is a fast, simple, and safe programming ...

12:03
Tomo: The Language of Tomorrow (and the next day, and the next)

1,453 views

14 hours ago

Parikh Jain
Tech Placements in 2026 Are DIFFERENT — Don’t Miss This!

In this video, I have covered 5 things that can get you hired in 2026. I have discovered modern things which are very ...

8:40
Tech Placements in 2026 Are DIFFERENT — Don’t Miss This!

1,723 views

20 hours ago

The Structural Econ Guy
Dynamic Discrete Choice Models: Introduction to Optimal Stopping

... Mathematical frameworks for optimal stopping - Solution methods: dynamic programming with recursive methods - Discrete vs.

4:56
Dynamic Discrete Choice Models: Introduction to Optimal Stopping

0 views

7 hours ago

MRU e-Learning
Object Oriented Programming in Java | OOP Concepts Explained | MRU E-Learning

Object Oriented Programming (OOP) is a fundamental paradigm used in modern software development. In this MRU E-Learning ...

23:01
Object Oriented Programming in Java | OOP Concepts Explained | MRU E-Learning

284 views

23 hours ago

CodeiiiShiv
Leetcode 2976 | Minimum Cost To convert String 1 | Step by step solution build , explained each line

... for beginners optimized solution for leetcode problem leetcode brute force vs optimized dynamic programming leetcode tutorial ...

25:11
Leetcode 2976 | Minimum Cost To convert String 1 | Step by step solution build , explained each line

0 views

2 hours ago

Fogy Free
3651 Minimum Cost Path with Teleportations

3651 Minimum Cost Path with Teleportations. Approach: Compute the minimum cost using dynamic programming across teleport ...

0:51
3651 Minimum Cost Path with Teleportations

0 views

19 hours ago

Skillavya
DSA Interview Fear Topics 🔥 Geometry, DP, Trees & Graphs Explained Live

Like | Comment | Subscribe Let's remove the fear from DSA #DSA #InterviewPreparation #DynamicProgramming ...

2:57:20
DSA Interview Fear Topics 🔥 Geometry, DP, Trees & Graphs Explained Live

31 views

Streamed 3 hours ago

EmergenTeck
How to Master Dynamic Selectors, SQL Database Automation, & API Integration in Power Automate?

Are you looking to advance your Power Automate Desktop (PAD) skills beyond basic recording? In this detailed tutorial, we dive ...

1:14:24
How to Master Dynamic Selectors, SQL Database Automation, & API Integration in Power Automate?

14 views

1 day ago

Techpile
Introduction to Web Development & JavaScript Fundamentals | DOM, BOM, Frontend & Backend Explained

In this lecture, we begin our journey into Web Development with a strong foundation in JavaScript Fundamentals. This session ...

2:04:50
Introduction to Web Development & JavaScript Fundamentals | DOM, BOM, Frontend & Backend Explained

911 views

Streamed 22 hours ago

CALOP-POSTECH
[2025/26 Winter Lecture] 2-1. Introduction (Prof. Taewoo Lee)

Lecture 2. Optimization + AI: Theory and Application (January 27, 2026) (Lecture 2-1: Introduction to Optimization, Data-Driven ...

1:11:39
[2025/26 Winter Lecture] 2-1. Introduction (Prof. Taewoo Lee)

15 views

21 hours ago

CALOP-POSTECH
[2025/26 Winter Lecture] 2-2. Optimization under Uncertainty (Prof. Taewoo Lee)

Lecture 2. Optimization + AI: Theory and Application (January 27, 2026) (Lecture 2-2: Optimization under Uncertainty) Instructor: ...

1:37:09
[2025/26 Winter Lecture] 2-2. Optimization under Uncertainty (Prof. Taewoo Lee)

10 views

21 hours ago

Nikhil Kamath
17 Young Founders | 8 Startups | 20 Lakh Grants | Third WTFund Cohort

Spent a few hours with young bright founders below the age of 25 from the 3rd WTFund cohort. WTFund is a non-dilutive ₹20 ...

1:24:04
17 Young Founders | 8 Startups | 20 Lakh Grants | Third WTFund Cohort

99,377 views

19 hours ago