Heaps & Priority Queues Courses and Certifications

Priority Queues with an Interlude on Heaps

Learn priority queues through min-heaps and max-heaps, including element insertion, removal, and code implementation.

• YouTube
• 30 minutes
• Self-Paced
• Free Video

CodeHelp - by Babbar

Heaps in C++ - Heap Sort - Insertion-Deletion in Heap - Priority Queue STL

Implement heaps in C++, covering insertion, deletion, heapify, heap sort, and STL priority queues.

• YouTube
• 1 hour 5 minutes
• Self-Paced
• Free Video

CodeHelp - by Babbar

Heaps Hard Interview Questions - Part 3

Solve challenging binary-heap problems through multiple approaches, code walkthroughs, and homework.

• YouTube
• 1 hour 5 minutes
• Self-Paced
• Free Video

CodeHelp - by Babbar

Heaps in C++ - Interview Questions - Part 2

Solve binary heap problems through multiple approaches and code implementations designed around interview-style questions.

• YouTube
• 50 minutes
• Self-Paced
• Free Video

CodeHelp - by Babbar

Heaps in C++ - Interview Questions - Part 1

Solve binary heap interview problems in C++ using multiple approaches and code implementations.

• YouTube
• 1 hour 8 minutes
• Self-Paced
• Free Video

Career Certificate

Learn Data Structures and Algorithms 2 in Python

144 ratings at Boot.dev

Implement Dijkstra's, Bellman-Ford, A* search and heaps in Python, then solve N Queens, edit distance and linear programming optimization problems.

• Boot.dev
• 22 hours
• Self-Paced
• Paid Course

Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps

7 ratings

Become familiar with nonlinear and hierarchical data structures. Study various tree structures: Binary Trees, BSTs and Heaps. Understand tree operations and algorithms. Learn and implement HashMaps th

• edX
• 5 weeks, 9-10 hours a week
• Self-Paced
• Free Online Course (Audit)

Understanding and Using Trees in Python

Implement binary trees, binary search trees, and heaps in Python, traverse them with DFS and BFS, and solve interview problems like finding the kth largest element.

• CodeSignal
• 3 hours
• Self-Paced
• Free Certificate

Interview Prep - The Last Mile in Python

Advanced Python coding-interview practice centered on hash tables, heaps, graph algorithms, string searching, and bit manipulation.

• CodeSignal
• 3 hours
• Self-Paced
• Free Certificate

Maximizing Efficiency in Problem-Solving Techniques in C++

Turn brute-force solutions into efficient ones in C++ — four-sum searches, prefix medians with heaps, and range queries backed by STL sets and sorted lists.

• CodeSignal
• 3 hours
• Self-Paced
• Free Certificate

Maximizing Efficiency in Problem-Solving Techniques in JavaScript

Optimize JavaScript solutions to combinatorial, subarray, set, and query problems using precalculation, heaps, sorted lists, and efficient algorithms.

• CodeSignal
• 3 hours
• Self-Paced
• Free Certificate

Interview Prep - The Last Mile in Java

Prepare for technical coding interviews in Java by practicing hash tables, heaps, graph algorithms, string searching, and bit manipulation.

• CodeSignal
• 3 hours
• Self-Paced
• Free Certificate

Interview Prep - The Last Mile in JavaScript

Practice advanced JavaScript coding interview problems using hash tables, heaps, graph algorithms, string searching, and bit manipulation.

• CodeSignal
• 3 hours
• Self-Paced
• Free Certificate

Maximizing Efficiency in Problem-Solving Techniques in Go

Solve combinatorial and array problems in Go using brute-force optimization, precalculation, maps, slices, and heaps.

• CodeSignal
• 3 hours
• Self-Paced
• Free Certificate

Interview Prep - The Last Mile in C++

Prepare for technical coding interviews in C++ through advanced hash tables, heaps, graph algorithms, string searching, and bit manipulation.

• CodeSignal
• 3 hours
• Self-Paced
• Free Certificate