ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

18 results

Aman Anand
Introduction to Heaps | Heaps Series | Priority Queue | Lecture 1

HEAP DATA STRUCTURE | DSA SERIES — EPISODE 1 Welcome to my Heap Series, where we’ll learn Heaps from the basics and ...

17:32
Introduction to Heaps | Heaps Series | Priority Queue | Lecture 1

27 views

4 days ago

Hyrum Carroll
Heaps Introduction

This is Dr carol and welcome to a video about heaps so heaps are a natural implementation for a priority queue and heaps have ...

10:47
Heaps Introduction

9 views

1 day ago

Deven Education Hub
Queue, Hashing, Heap, Trie, Sorting, DP, KMP, Advanced Trees & Graph Algorithms Explained

This video covers the remaining major Data Structures and Algorithms topics after Array, Stack, Linked List, Tree and Graph.

4:50
Queue, Hashing, Heap, Trie, Sorting, DP, KMP, Advanced Trees & Graph Algorithms Explained

13 views

5 days ago

Revise Labs
Kth Largest Element Explained: Why a Min Heap Beats Sorting

To find the Kth largest value in an array, you do not have to sort everything. You only need to keep track of the best K values you ...

4:10
Kth Largest Element Explained: Why a Min Heap Beats Sorting

4 views

4 days ago

Glass Box Computing
Graph Algorithms: Labs — Data Structures in C | 16.10

Practice with graph algorithms: work the problems yourself, then check the worked solutions. Hands-on exercises to turn ...

5:56
Graph Algorithms: Labs — Data Structures in C | 16.10

2 views

5 days ago

Glass Box Computing
Graph Algorithms in Memory — Data Structures in C | 16.5

... vertex 2:54 The priority queue is an array of pairs 4:54 The same array, read again — stale copies 6:30 Prim: identical memory, ...

12:14
Graph Algorithms in Memory — Data Structures in C | 16.5

0 views

5 days ago

StackOptimist
Why Dijkstra's Algorithm Never Looks Back - Every Step Drawn Out

Why does Dijkstra's algorithm never look back? Watch the single source shortest path algorithm - the greedy way to find the ...

8:33
Why Dijkstra's Algorithm Never Looks Back - Every Step Drawn Out

1 view

6 days ago

Aman Anand
Sort characters by frequency | Leetcode 451 | heaps series lecture 2

Lecture 2 of the heaps series Problem link : https://leetcode.com/problems/sort-characters-by-frequency/description ...

12:58
Sort characters by frequency | Leetcode 451 | heaps series lecture 2

52 views

4 days ago

Code with Chetan
Every Data Structure Explained Visually — All 12 in 7 Minutes

... ArrayList, LinkedList, ArrayDeque, HashMap, HashSet, TreeSet, PriorityQueue — with the time complexity on every operation.

7:00
Every Data Structure Explained Visually — All 12 in 7 Minutes

13 views

1 day ago

EasyDev
Dijkstra vs Bellman-Ford: Which Shortest Path Algorithm Wins?

... distance arrays, parent tracking, and priority queues. Perfect for backend developers, Python programmers, computer science ...

8:45
Dijkstra vs Bellman-Ford: Which Shortest Path Algorithm Wins?

42 views

2 days ago

Deven Education Hub
Trees & Graphs Explained in 3D | Complete DSA Traversal & Algorithms Masterclass

... Tree and LL/RR/LR/RL rotations Red-Black Trees Heaps and Priority Queues B-Tree / B+ Tree Trie Segment Tree Fenwick Tree ...

6:37
Trees & Graphs Explained in 3D | Complete DSA Traversal & Algorithms Masterclass

31 views

5 days ago

Learning With Chetna
Apple Interview Loop | Round 3 | Coding Round 2 - Median from Data Stream |  SE, SSE, PSE

Apple Interview Loop Round 3 — Coding Round: Median from Data Stream (SWE → Senior → Architect) A full walkthrough of a ...

15:10
Apple Interview Loop | Round 3 | Coding Round 2 - Median from Data Stream | SE, SSE, PSE

80 views

5 days ago

Глеб Михайлов | Алгоритмы и структуры данных
"Hit on the Head with a Stone" Problem — Learning to Use a Heap (LeetCode)

👇 Get the text analysis at this link: https://t.me/leetcode_with_gleb_bot?start=kamen We're analyzing the LeetCode problem ...

10:54
"Hit on the Head with a Stone" Problem — Learning to Use a Heap (LeetCode)

280 views

6 days ago

Ritesh
LeetCode 1584 | Min Cost to Connect All Points | Prim’s Algorithm | MST

Solve LeetCode 1584 – Min Cost to Connect All Points using Prim's Algorithm and Minimum Spanning Tree (MST). In this video ...

15:16
LeetCode 1584 | Min Cost to Connect All Points | Prim’s Algorithm | MST

21 views

5 days ago

Sadman Realm
Image Compression Explained || Lossless vs Lossy, Data Redundancy & Huffman Coding ||

... Huffman Coding Huffman Coding Algorithm Frequency Analysis Min Heap / Priority Queue Huffman Tree Construction Huffman ...

9:28
Image Compression Explained || Lossless vs Lossy, Data Redundancy & Huffman Coding ||

41 views

7 days ago

DrIT_Education
DATA STRUCTURES COMPLETE 🔥 |Linear & Non-Linear Data Structures | BPSC TRE-4 & STET Computer Science

... POP, PEEK, Overflow & Underflow Queue — FIFO, Enqueue, Dequeue, Front & Rear Circular Queue Priority Queue ...

8:15
DATA STRUCTURES COMPLETE 🔥 |Linear & Non-Linear Data Structures | BPSC TRE-4 & STET Computer Science

1,193 views

4 days ago

spiderman
11. STLs — Stack, Queue & Priority Queue

In this video, we continue our STL in C++ series and learn about three important STL container adapters: stack queue ...

8:14
11. STLs — Stack, Queue & Priority Queue

1 view

2 days ago

Syntax solver
Merge K Sorted Lists | LeetCode #23 | Heap + Priority Queue Explained | Day 24

LeetCode #23 Merge K Sorted Lists explained step by step using a Min Heap / Priority Queue in Python. In Day 24 of my ...

16:55
Merge K Sorted Lists | LeetCode #23 | Heap + Priority Queue Explained | Day 24

13 views

2 days ago