ViewTube

Learn how to solve the classic Candy Distribution problem (LeetCode 135) using an optimal Two-Pass Greedy approach!

Learn how to solve the Partition Labels problem efficiently using a Greedy approach! ✂️ In this video, we break down the logic ...

Learn how to solve the Jump Game II problem (LeetCode 45) using the Greedy Algorithm! In this video, we break down the ...

Can you reach the last index? ‍♂️ In this video, we break down the classic "Jump Game" coding interview problem ...

Struggling with Unstop POTD – Resilient Towers (3/1/2026)? Don't worry — in this video, I explain the problem step by step in a ...

In this video, We recall what we learned about greedy and take one more example to understand what a greedy algorithm actually ...

in this, we discuss on Dijkstra algorithm, weighted graph, and an example to solve the length of the shortest path by a general ...

In this video, I explain Kruskal's Algorithm in a simple and easy way. Kruskal's Algorithm is a greedy algorithm used to find the ...

Key Concepts Covered: ✓ Array Manipulation ✓ Greedy Algorithms ✓ Time & Space Complexity Analysis Don't forget to like and ...

On this episode of Words of Rizdom which was recorded on 21st November 2025 we are joined by Ted Zhang. We dive into the ...

Learn how to solve the Wiggle Sort coding problem efficiently! In this video, we break down the "Wiggle Sort" problem (often ...

Learn how to solve the 'Minimum Operations to Reduce X to Zero' problem efficiently using the Sliding Window technique!

... Algorithm #Minimum Spanning Tree #Graph Algorithms #Data Structures and Algorithms # MST in Graphs #Greedy Algorithm ...

... Algorithm #Minimum Spanning Tree #Graph Algorithms #Data Structures and Algorithms # MST in Graphs #Greedy Algorithm ...

... Algorithm #Minimum Spanning Tree #Graph Algorithms #Data Structures and Algorithms # MST in Graphs #Greedy Algorithm ...

Complete Playlist Structure:** 00:00 - Introduction to Dynamic Programming 01: Pascal's Triangle - Understanding DP ...

In this video, you'll learn: What is a Decision Tree How a Decision Tree works step-by-step Key concepts: Root Node Decision ...

... Algorithm #Minimum Spanning Tree #Graph Algorithms #Data Structures and Algorithms # MST in Graphs #Greedy Algorithm ...

In this video, we solve one of the most popular Greedy Algorithms: **The Fractional Knapsack Problem.** Unlike the 0/1 Knapsack ...

Maximum Subarray Sum is one of the MOST ASKED interview problems. In this video, we start with the brute force approach and ...