ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

19 results

Sajid Saleem
0-1 Knapsack Problem - Dynamic Programming Example

#chamelionpk 0-1 Knapsack Problem - Dynamic Programming Example #Sajid Saleem #KnapsackProblem #DynamicProgramming #DSA ...

8:43
0-1 Knapsack Problem - Dynamic Programming Example

2 views

5 days ago

Y J CODE
I Solved the 0/1 Knapsack Problem in Python (Only 8 Lines, No Libraries!)

The 0/1 Knapsack Problem is one of the most asked Dynamic Programming questions in coding interviews — given items with ...

6:47
I Solved the 0/1 Knapsack Problem in Python (Only 8 Lines, No Libraries!)

16 views

8 days ago

Hemtosh
2.7 Fractional vs 0/1 Knapsack | Why Greedy Fails for 0/1 Knapsack with Examples | DAA Unit 2

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 Course ...

6:19
2.7 Fractional vs 0/1 Knapsack | Why Greedy Fails for 0/1 Knapsack with Examples | DAA Unit 2

0 views

2 weeks ago

Craqit - Crack the interview
Dynamic Programming, Visualized (Why It Feels Impossible)

Computing the 50th Fibonacci number the obvious way makes ~25000000000 function calls. The smart way makes 50.

15:30
Dynamic Programming, Visualized (Why It Feels Impossible)

6 views

3 days ago

Code Clarity DSA
Recursion to DP in 10 Minutes | No Fancy Words

Dynamic Programming finally makes sense — explained visually, step by step. If DP feels scary because of words like ...

9:52
Recursion to DP in 10 Minutes | No Fancy Words

32 views

4 weeks ago

Shradha Khapra
Fractional Knapsack Algorithm | Greedy Method

🔷 New DSA Sheet Link : https://dsa.apnacollege.in Share your progress on Twitter : https://x.com/ShradhaKhapra_ DSA Series ...

16:33
Fractional Knapsack Algorithm | Greedy Method

3,976 views

9 days ago

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

In this video, we tackle LeetCode 416: Partition Equal Subset Sum. This classic Dynamic Programming problem is a famous ...

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

9 views

9 days ago

Vadim Smolyakov
algorithmic paradigms

There are four main algorithmic paradigms: complete search, greedy algorithms, divide and conquer, and dynamic programming.

13:11
algorithmic paradigms

41 views

4 weeks ago

Balmiki Vishwakarma MATHS JEE MAIN
THE BEST METHOD. TO FIND COMMON SEQUENCE

THE BEST METHOD. TO FIND COMMON SEQUENCE BALMIKI VISHWAKARMA MATHS JEE MAINS. #common sequence ...

5:09
THE BEST METHOD. TO FIND COMMON SEQUENCE

67 views

13 days ago

Ana Luiza Fernandes
Programação dinâmica - Knapsack

Ana Luiza Fernandes Alves da Rocha - 211030667 Tales Rodrigues Gonçalves - 211041295.

4:41
Programação dinâmica - Knapsack

6 views

4 weeks 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

110 views

8 days ago

Shivam Gupta
Find the Number of Subsequences With Equal GCD | Leetcode - 3336

Welcome to the explanation of leetcode problem - 3336 (Find the Number of Subsequences With Equal GCD)! In this video, we ...

9:29
Find the Number of Subsequences With Equal GCD | Leetcode - 3336

350 views

13 days ago

BanjaraSmart
DSA from zero to hero | Foundations | Learn every DSA topic from first principles | Comment for Next

DSA from Zero to Hero | Complete Data Structures & Algorithms Course (C++, Java & Python) Master **Data Structures and ...

11:33
DSA from zero to hero | Foundations | Learn every DSA topic from first principles | Comment for Next

52 views

2 weeks ago

Shivam Gupta
Check Subset sum divisible by k | GFG POTD

Welcome to the explanation of GFG POTD ( problem of the day)! In this video, we have discussed the strategies, ideas, and ...

15:48
Check Subset sum divisible by k | GFG POTD

467 views

3 weeks ago

engineering4youguys
ADA (Analysis & Design of Algorithms) Most Important Questions |All Brach |Back Paper BTech 2nd Year

RGPV Analysis & Design of Algorithms (ADA) | Most Important Questions | B.Tech 2nd Year In this video, I have covered the Most ...

12:10
ADA (Analysis & Design of Algorithms) Most Important Questions |All Brach |Back Paper BTech 2nd Year

68 views

2 weeks ago

Shivam Gupta
Max Subarray Sum by Removing At Most One | GFG POTD

Welcome to the explanation of GFG POTD ( problem of the day)! In this video, we have discussed the strategies, ideas, and ...

15:14
Max Subarray Sum by Removing At Most One | GFG POTD

387 views

3 weeks ago

Shivam Gupta
Max Sum Path in Two Arrays | GFG POTD

Welcome to the explanation of GFG POTD ( problem of the day)! In this video, we have discussed the strategies, ideas, and ...

18:26
Max Sum Path in Two Arrays | GFG POTD

151 views

3 weeks ago

Job Updates Bro
Infosys Exam Pattern | Infosys Hiring Update 2026 | Top 50 Most Important Infosys Coding Questions

Welcome to Job Updates Bro — your trusted destination for latest freshers jobs, government & private jobs, off-campus drives, ...

8:49
Infosys Exam Pattern | Infosys Hiring Update 2026 | Top 50 Most Important Infosys Coding Questions

2,785 views

6 days ago

Nam's World
Flipkart GRiD 8.0 Round 2 Guide 🚀 Crack the Online Assessment

Planning to appear for Flipkart GRiD 8.0 Round 2? This video covers everything you need to know to prepare for the Online ...

8:28
Flipkart GRiD 8.0 Round 2 Guide 🚀 Crack the Online Assessment

7,458 views

11 days ago