ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

21 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 ...

17:32
Introduction to heaps | heaps series | priority queue | Lecture 1

17 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

10 views

2 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

3 days ago

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

#KthLargest #PriorityQueue #Heap #DSA #CodingInterview #Algorithms #DataStructures #TechExplained.

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

4 views

2 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

4 days ago

SysSketch
What Is Dijkstra's Algorithm? (Explained With Animations)

... tracing tentative distances node by node • Why a min-heap priority queue is what makes it fast enough for real maps • The real ...

5:43
What Is Dijkstra's Algorithm? (Explained With Animations)

36 views

5 days ago

VividCode
Fibonacci Heap: Delay the Cleanup

Explains Fibonacci heaps through root lists, lazy meld, cascading cuts, degree consolidation, and amortized complexity.

4:55
Fibonacci Heap: Delay the Cleanup

0 views

6 days ago

Unique Series - Civil Mantraa
2.2 Binomial Heap, Fibonacci Heap, Tries & Skip List | BCS503 | Design and Analysis of Algorithm

Welcome to Lecture 2.2 of Design and Analysis of Algorithm (BCS503) for AKTU B.Tech Computer Science Engineering students.

19:26
2.2 Binomial Heap, Fibonacci Heap, Tries & Skip List | BCS503 | Design and Analysis of Algorithm

29 views

5 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/ Timestamps: ...

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

32 views

1 day ago

pavanxdcl
Class 1: Birth of DSA | How Data Structures & Algorithms Came Into Existence | DSA by PavanXDCL.IN 🚀

DSA by PavanXDCL.IN Welcome to **PavanXDCL.IN — Learn DSA. Build Logic. Crack Product-Based Companies.** In this ...

19:16
Class 1: Birth of DSA | How Data Structures & Algorithms Came Into Existence | DSA by PavanXDCL.IN 🚀

278 views

1 day ago

Computer Science Brainery
Heaps and B Trees | Data Structures | Unit 7-5 | UGC NET Computer Science | B+ trees | Binary Heaps

00:07 Heaps 01:35 Binary Heaps 03:01 B Trees 12:07 B+ Trees 15:36 B* Trees Unit-7: Data Structures and Algorithms Free PDF ...

18:32
Heaps and B Trees | Data Structures | Unit 7-5 | UGC NET Computer Science | B+ trees | Binary Heaps

20 views

2 days ago

pavanxdcl
Class 3: Array Length Explained 🔥 | Find the Size of an Array | DSA for Beginners | PavanXDCL.IN

DSA by PavanXDCL.IN Welcome to **PavanXDCL.IN — Learn DSA. Build Logic. Crack Product-Based Companies.** In this ...

4:03
Class 3: Array Length Explained 🔥 | Find the Size of an Array | DSA for Beginners | PavanXDCL.IN

28 views

1 day ago

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

Enter the world of Non-Linear Data Structures through a cinematic 3D journey into Trees and Graphs—from absolute beginner ...

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

27 views

2 days ago

pavanxdcl
Class 2: Introduction to Arrays | DSA for Beginners | PavanXDCL.IN 🚀

DSA by PavanXDCL.IN Welcome to **PavanXDCL.IN — Learn DSA. Build Logic. Crack Product-Based Companies.** In this ...

8:04
Class 2: Introduction to Arrays | DSA for Beginners | PavanXDCL.IN 🚀

44 views

1 day 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)

245 views

3 days ago

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

In this video, we explore the fundamentals of Image Compression and understand how digital images can be represented using ...

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

40 views

4 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

49 views

3 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

8 views

10 hours 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

0 views

3 hours 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

15 views

2 days ago