ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

143 results

CodeLucky
Maximum Path Sum in a Grid - Dynamic Programming | Coding Interview Problem

Learn how to solve the Maximum Path Sum in a Grid problem using Dynamic Programming! In this video, we break down one ...

4:47
Maximum Path Sum in a Grid - Dynamic Programming | Coding Interview Problem

1 view

1 day ago

CodeLucky
Minimum Platforms Problem - Greedy Algorithm & Sorting (LeetCode/GeeksforGeeks)

Learn how to solve the Minimum Platforms problem efficiently using the Greedy approach and Sorting! In this video, we break ...

4:59
Minimum Platforms Problem - Greedy Algorithm & Sorting (LeetCode/GeeksforGeeks)

2 views

1 day ago

CodeLucky
Matrix Chain Multiplication - Dynamic Programming (Made Easy)

Learn the Matrix Chain Multiplication problem using Dynamic Programming! In this video, we break down one of the most ...

4:10
Matrix Chain Multiplication - Dynamic Programming (Made Easy)

0 views

1 day ago

CodeLucky
Coin Change Problem - Dynamic Programming (Minimum Coins)

Learn how to solve the classic Coin Change Problem (Minimum Coins) using Dynamic Programming! In this video, we break ...

5:00
Coin Change Problem - Dynamic Programming (Minimum Coins)

0 views

1 day ago

CodeLucky
0/1 Knapsack Problem - Dynamic Programming Visualized 🎒

Learn the 0/1 Knapsack Problem, a classic Dynamic Programming challenge often asked in coding interviews at Google, Amazon, ...

4:12
0/1 Knapsack Problem - Dynamic Programming Visualized 🎒

0 views

1 day ago

CodeLucky
Fast Exponentiation Algorithm Explained | Power in O(log N) Time

Learn how to calculate powers of numbers efficiently using the Fast Exponentiation algorithm (also known as Exponentiation by ...

4:54
Fast Exponentiation Algorithm Explained | Power in O(log N) Time

0 views

2 minutes ago

CodeLucky
Satisfiability of Equality Equations - LeetCode 990 Explained (Union Find)

Can logic exist without contradiction? In this video, we break down the "Satisfiability of Equality Equations" problem (LeetCode ...

4:53
Satisfiability of Equality Equations - LeetCode 990 Explained (Union Find)

1 view

1 day ago

CodeLucky
Queue Reconstruction By Height - LeetCode 406 Greedy Algorithm Explanation

Learn how to solve the 'Queue Reconstruction By Height' problem (LeetCode 406) using a clever Greedy strategy! ✨ In this ...

4:59
Queue Reconstruction By Height - LeetCode 406 Greedy Algorithm Explanation

2 views

1 day ago

CodeLucky
Power Set Algorithm Using Bit Manipulation | Data Structures & Algorithms

Learn how to generate a Power Set (all possible subsets) using Bit Manipulation! ⚡ This is a classic algorithmic problem often ...

4:10
Power Set Algorithm Using Bit Manipulation | Data Structures & Algorithms

0 views

20 minutes ago

CodeLucky
Longest Palindromic Subsequence - Dynamic Programming Algorithm Tutorial

Learn how to solve the Longest Palindromic Subsequence (LPS) problem using Dynamic Programming! In this video, we break ...

5:42
Longest Palindromic Subsequence - Dynamic Programming Algorithm Tutorial

1 view

1 day ago

CodeLucky
Find Single Non-Repeating Element: The XOR Trick Explained (O(N) Time, O(1) Space)

Learn how to solve the classic "Find the Single Number" coding interview problem efficiently using the Bitwise XOR operator!

4:25
Find Single Non-Repeating Element: The XOR Trick Explained (O(N) Time, O(1) Space)

0 views

26 minutes ago

CodeLucky
Count Primes: Sieve of Eratosthenes Algorithm Explained (LeetCode 204)

Learn how to solve the Count Primes problem efficiently using the Sieve of Eratosthenes algorithm! In this video, we break ...

4:04
Count Primes: Sieve of Eratosthenes Algorithm Explained (LeetCode 204)

0 views

5 minutes ago

CodeLucky
Maximum XOR of Two Numbers in an Array - LeetCode 421 - Trie & Bit Manipulation

Learn how to solve the Maximum XOR of Two Numbers in an Array problem (LeetCode 421) using the Trie data structure and Bit ...

4:57
Maximum XOR of Two Numbers in an Array - LeetCode 421 - Trie & Bit Manipulation

0 views

1 day ago

CodeLucky
Modular Exponentiation Explained | Binary Exponentiation Algorithm

Learn how to compute (x^n) % m efficiently using Modular Exponentiation (Binary Exponentiation)! In this video, we break ...

4:47
Modular Exponentiation Explained | Binary Exponentiation Algorithm

0 views

3 minutes ago

CodeLucky
Last Stone Weight II - Minimize Difference DP (LeetCode 1049)

Learn how to solve the Last Stone Weight II problem (LeetCode 1049) using Dynamic Programming! In this video, we break ...

4:04
Last Stone Weight II - Minimize Difference DP (LeetCode 1049)

0 views

1 day ago

CodeLucky
Number of Connected Components - Union Find (DSU) Algorithm Explained

Learn how to solve the 'Number of Connected Components' graph problem using the efficient Union-Find (Disjoint Set Union) ...

4:33
Number of Connected Components - Union Find (DSU) Algorithm Explained

0 views

13 hours ago

CodeLucky
Combination Sum - Backtracking Algorithm Explained (LeetCode 39)

Learn how to solve the Combination Sum problem using the Backtracking pattern! In this video, we break down the logic ...

4:52
Combination Sum - Backtracking Algorithm Explained (LeetCode 39)

0 views

17 minutes ago

CodeLucky
Minimum Number of Arrows to Burst Balloons - Greedy Algorithm Explained

Learn how to solve the 'Minimum Number of Arrows to Burst Balloons' problem using a Greedy Algorithm approach! In this ...

4:13
Minimum Number of Arrows to Burst Balloons - Greedy Algorithm Explained

0 views

1 day ago

CodeLucky
Cherry Pickup Algorithm - Hard Dynamic Programming Problem Explained

Master the Cherry Pickup problem (LeetCode 741) with this step-by-step visual guide! In this video, we break down one of the ...

4:37
Cherry Pickup Algorithm - Hard Dynamic Programming Problem Explained

5 views

1 day ago

CodeLucky
Longest Bitonic Subsequence - Dynamic Programming Explained

Learn how to solve the Longest Bitonic Subsequence problem using Dynamic Programming! In this video, we break down one ...

4:05
Longest Bitonic Subsequence - Dynamic Programming Explained

0 views

1 day ago