ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

40 results

Go Forward
Priority queues introduction
8:14
Priority queues introduction

5 views

3 weeks ago

Karan Mashru
15.10 Introduction to Priority Queues | What are Priority Queues ?

1. Complete DSA For Placements Playlist - https://www.youtube.com/playlist?list=PLdZWXnW9ILQUM0y3FidPqzcz9NTorALPh 2. Time And ...

9:18
15.10 Introduction to Priority Queues | What are Priority Queues ?

14 views

3 weeks ago

VikhramGuide
Find the Kth largest element (Priority Queue)

Kth largest element.

5:49
Find the Kth largest element (Priority Queue)

1 view

13 days ago

Karan Mashru
15.12 How Max Priority Queue can be Implemented using Max Heap ?

1. Complete DSA For Placements Playlist - https://www.youtube.com/playlist?list=PLdZWXnW9ILQUM0y3FidPqzcz9NTorALPh 2. Time And ...

4:50
15.12 How Max Priority Queue can be Implemented using Max Heap ?

14 views

3 weeks ago

FSPWD
Priority Queue in hindi – Complete Guide with All Operations

In this video, you will learn Priority Queue in Python from absolute beginner level. This tutorial is designed for school students, ...

5:54
Priority Queue in hindi – Complete Guide with All Operations

7 views

2 weeks ago

Dataverse Tutorials
Lecture 31 - Heap Queue (heapq) in Python Explained in Hindi | Heapify Priority Queue | DVT101

Welcome to Dataverse Tutorials – Your Gateway to Artificial Intelligence, Generative AI, and Machine Learning Excellence!

14:14
Lecture 31 - Heap Queue (heapq) in Python Explained in Hindi | Heapify Priority Queue | DVT101

45 views

8 days ago

Dyvin Biju
Binary Heaps & Priority Queues
5:16
Binary Heaps & Priority Queues

3 views

2 weeks ago

Konstantin Shibkov
⬆️ PriorityQueue: Don't forget about it at the interview!

A queue that's often forgotten, but very useful. PriorityQueue is useful for solving problems with task schedulers, graphs ...

12:35
⬆️ PriorityQueue: Don't forget about it at the interview!

149 views

4 days ago

Ramon Nkogo
actividad5
9:53
actividad5

0 views

10 days ago

Leetcode Daily
3510. Minimum Pair Removal to Sort Array II | Leetcode Daily - Python

In this video, we break down how to optimize the simulation process using a Priority Queue and a Doubly Linked List.

8:49
3510. Minimum Pair Removal to Sort Array II | Leetcode Daily - Python

1,622 views

3 weeks ago

Express VTU 4 All
VTU DSA Module 2 | Multiple Stacks and Queues | Sequential & Linked Representation | BCS304

Welcome to Express VTU 4 All In this video, we discuss one of the most important and repeatedly asked questions from ...

6:14
VTU DSA Module 2 | Multiple Stacks and Queues | Sequential & Linked Representation | BCS304

2,563 views

5 days ago

Quick Learner With Sam & Mush
Deletion in Heap Tree With Example | Heap Tree | Min Heap | Max Heap | Data Structures | Algorithms

It's the secret behind why Priority Queues are so efficient. As always 🛠️ What We're Breaking Down: •The Swap Strategy: Why ...

6:29
Deletion in Heap Tree With Example | Heap Tree | Min Heap | Max Heap | Data Structures | Algorithms

31 views

7 days ago

DSA with Unpredictable Guy
🔥 LeetCode 3650 | Minimum Cost Path with Edge Reversals (27-01-2026) | Graph + Dijkstra Explained 🔥

In this video, we dive into LeetCode Problem 3650 – Minimum Cost Path with Edge Reversals — a fascinating graph shortest-path ...

14:55
🔥 LeetCode 3650 | Minimum Cost Path with Edge Reversals (27-01-2026) | Graph + Dijkstra Explained 🔥

39 views

2 weeks ago

MOHAMMAD RIZWAN
TYPES OF LINKLIST OF DATA STRUCTURE (DSA)

... modified binary search topological sort backtracking subsets two pointers sliding window priority queue heaps dfs bfs difference ...

10:32
TYPES OF LINKLIST OF DATA STRUCTURE (DSA)

15 views

2 weeks ago

Leetcode Daily
3650. Minimum Cost Path with Edge Reversals | Leetcode Daily - Python

Master this tricky graph problem involving shortest paths and a unique edge reversal mechanic! In this video, we explore the ...

5:55
3650. Minimum Cost Path with Edge Reversals | Leetcode Daily - Python

1,099 views

2 weeks ago

TechBase
LeetCode Hard | POTD | Minimum Pair Removal to Sort Array II

... How a Min-Heap (Priority Queue) helps us always pick the optimal pair to merge By combining DLL + heap + decrease_count, ...

11:27
LeetCode Hard | POTD | Minimum Pair Removal to Sort Array II

112 views

2 weeks ago

CodingHelp
LeetCode 3835 | Count Subarrays With Cost Less Than or Equal to K | Weekly Contest 488 | Coding Help

In this video, we tackle the most interesting problem from LeetCode Weekly Contest 488: Problem 3835. This "Medium" challenge ...

17:00
LeetCode 3835 | Count Subarrays With Cost Less Than or Equal to K | Weekly Contest 488 | Coding Help

0 views

3 days ago

Karan Mashru
15.13 Find Top K elements of an Array of Size N in O(NlogK) Time Complexity

Question Link : https://www.geeksforgeeks.org/problems/k-largest-elements4206/1 1. Complete DSA For Placements Playlist ...

14:58
15.13 Find Top K elements of an Array of Size N in O(NlogK) Time Complexity

13 views

3 weeks ago

Talent Navigator
Counting Good Nodes in Trees Leetcode Medium 3249🌳📊

To find minimum time, the Dijkstra algorithm will be implemented with a priority queue, considering time flags for movement.

9:35
Counting Good Nodes in Trees Leetcode Medium 3249🌳📊

2 views

4 weeks ago

Karan Mashru
15.7 getMax() and extractMax() on Heap Data Structure

1. Complete DSA For Placements Playlist - https://www.youtube.com/playlist?list=PLdZWXnW9ILQUM0y3FidPqzcz9NTorALPh 2. Time And ...

14:19
15.7 getMax() and extractMax() on Heap Data Structure

26 views

4 weeks ago