ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

177 results

The Logic Blueprint
The DP Trick That Turns n! Into 2^n · n (Bitmask DP)

Dynamic Programming becomes much easier once you learn how to turn “what has already been chosen” into a state.

6:36
The DP Trick That Turns n! Into 2^n · n (Bitmask DP)

9 views

20 hours ago

Vijay Algorithms
Predict the Winner - Leetcode 486 (Medium) | Interval/Range DP | DRY RUN | Episode-04

If you've been struggling with game theory or dynamic programming, this video will break it down for you step-by-step. We will do ...

26:55
Predict the Winner - Leetcode 486 (Medium) | Interval/Range DP | DRY RUN | Episode-04

7 views

7 hours ago

codewithhassann
Build a Secure ATM Simulation in Python | Object-Oriented Programming (OOP) Project for Beginners

Welcome back to the channel! In this tutorial, we are taking your Python skills to the next level by building a fully functional, highly ...

5:27
Build a Secure ATM Simulation in Python | Object-Oriented Programming (OOP) Project for Beginners

2 views

2 hours ago

Nitin Pawar
3 Bottom-Up Tabulation: The Ultimate Dynamic Programming Optimization | Memoization vs Tabulation

You've mastered Memoization, but what if you could eliminate the recursive call stack completely? In this video, we tackle the next ...

11:18
3 Bottom-Up Tabulation: The Ultimate Dynamic Programming Optimization | Memoization vs Tabulation

2 views

22 hours ago

Flock XR
Episode 7 | How to teach physics, forces and particle effects in Flock XR
13:05
Episode 7 | How to teach physics, forces and particle effects in Flock XR

0 views

0

Saiful Alam
Local Alignment & Smith-Waterman Algorithm | DP Matrix, Traceback & Example | Bioinformatics

... Local Alignment — step-by-step problem solving • Smith–Waterman Algorithm • Complete Dynamic Programming (DP) Matrix ...

24:47
Local Alignment & Smith-Waterman Algorithm | DP Matrix, Traceback & Example | Bioinformatics

8 views

12 hours ago

Cakot Coding
LeetCode 1872 - Stone Game VIII | Prefix Sum + DP | Optimal Game Strategy

In this video, I solve LeetCode 1872 - Stone Game VIII, a Hard-level problem based on game theory and dynamic programming.

12:36
LeetCode 1872 - Stone Game VIII | Prefix Sum + DP | Optimal Game Strategy

83 views

1 day ago

blocklyscratch
🎯Dynamic Game FOV: Fog of War

The field of view changes dynamically as it gets blocked by walls or obstacles. - Casts a circular ray from the specified coordinates ...

1:39
🎯Dynamic Game FOV: Fog of War

0 views

23 hours ago

Infomax Computer Academy
Static and Dynamic Data Structures in Data Structure | Static vs Dynamic DS Explained

In this video, we will learn about Static and Dynamic Data Structures in Data Structure and Algorithms. Understanding the ...

8:29
Static and Dynamic Data Structures in Data Structure | Static vs Dynamic DS Explained

0 views

6 hours ago

AI Guy | Average IT Guy
DP50-  Binary Tree Cameras using DP

https://colab.research.google.com/drive/1aLbaALKyTg1ikYrXQIJtLgPJjHmbuekb?usp=sharing #dynamicprogramming # DSA# ...

21:35
DP50- Binary Tree Cameras using DP

33 views

20 hours ago

Black Dot Origin
🔥 LeetCode 10 : Regular Expression Matching in Python 🚀| Day-10 Part - 02 | Space Optimisation | DP

and the zero-or-more quantifier '*', and implement the optimal O(m × n) Bottom-Up Dynamic Programming (DP) table approach ...

43:39
🔥 LeetCode 10 : Regular Expression Matching in Python 🚀| Day-10 Part - 02 | Space Optimisation | DP

6 views

1 day ago

Coding practice
Minimum Moves to Sort Permutation | O(N) Optimal Solution | GFG POTD

Topics: Arrays, Hashing, Dynamic Programming. #gfgalgorithms #POTD #DSA #Arrays #DynamicProgramming #Hashing #Java ...

16:11
Minimum Moves to Sort Permutation | O(N) Optimal Solution | GFG POTD

53 views

12 hours ago

Nitin Pawar
2 Memoization | Recursion vs Memoization: Crack Dynamic Programming with Fibonacci

Ever wonder why standard recursion times out during technical interviews? In this video, we break down the core of Dynamic ...

13:31
2 Memoization | Recursion vs Memoization: Crack Dynamic Programming with Fibonacci

9 views

23 hours ago

Xurrent
Xurrent iPaaS: How to Configure a Dynamic Scheduler in Your Runbooks

Sometimes you don't just need automation — you need automation that runs on your schedule. This video walks through how to ...

5:01
Xurrent iPaaS: How to Configure a Dynamic Scheduler in Your Runbooks

15 views

22 hours ago

Aaj Ka Code
Minimum Moves to Sort Permutation | Longest Consecutive Subsequence | GFG POTD

Concepts Covered * Dynamic Programming * Permutations * Consecutive Increasing Sequence * Greedy Observation ⏱ Time ...

20:57
Minimum Moves to Sort Permutation | Longest Consecutive Subsequence | GFG POTD

22 views

11 hours ago

JobNexusHub
Microsoft Software Engineer Assessment Questions & Answers 2026 | Windows + Devices | C++ & OS

Microsoft Software Engineer Assessment Questions & Answers 2026 | Windows + Devices | C++ & OS Application Link :- https ...

9:05
Microsoft Software Engineer Assessment Questions & Answers 2026 | Windows + Devices | C++ & OS

12 views

8 hours ago

Kumar K [Amazon]
Google SWE Interview(₹60Lakhs CTC) - Hard Graph DSA Solved By FAANG SDE(Kumar K)

... group - https://chat.whatsapp.com/CotPPUlZ9LPF4iKmHQKbQ8?s=cl&p=a&ilr=0 Free Dynamic Programming Course By Kumar ...

42:34
Google SWE Interview(₹60Lakhs CTC) - Hard Graph DSA Solved By FAANG SDE(Kumar K)

978 views

1 day ago

TrumpExcel
Hidden Formula Trick to Make Functions Spill in Excel

Some Excel functions return a #VALUE! error when you give them a range, even though you expect the result to spill. In this video ...

3:37
Hidden Formula Trick to Make Functions Spill in Excel

1,306 views

10 hours ago

Ace The Code
Infosys Round 1 Rejection Mail 2026 | Off Campus Result Update | Not Selected? What Next

... trees, graphs, dynamic programming, OOP, DBMS, SQL, Operating Systems, Computer Networks, and project-based questions.

4:05
Infosys Round 1 Rejection Mail 2026 | Off Campus Result Update | Not Selected? What Next

434 views

2 hours ago

Book & Talks
Lec 23 || Parallel Models ~ Parallel Computing | Analysis & Design of Algorithm | Book_&_talks

... cost spanning tree (Prims and Kruskal algorithm) - single source shortest path-DijkastraAlgorithm. unit 3 Dynamic Programming ...

5:50
Lec 23 || Parallel Models ~ Parallel Computing | Analysis & Design of Algorithm | Book_&_talks

6 views

13 hours ago