LecLabs 3.4 - Search and Heap


Intro to Programming Languages.

[ ← Module List ]

This module covers Breadth-First Search (BFS) and Min Heaps in C++. It includes lectures on BFS, Min Heap insertion, deletion, and array representation.


Challenges

Lecture video on BFS 1

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Lecture video on BFS 2

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Example BFS implementation that you will complete by following the CODE: comments.

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Lecture video on Min Heap 1

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Lecture video on Min Heap Insert

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Lecture video on Min Heap Delete

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Lecture video on Min Heap in Array

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Lecture video on Min Heap in Array doing an Insert

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

30-Day Scoreboard:

This scoreboard reflects solves for challenges in this module after the module launched in this dojo.

7-Day | 30-Day | All-Time

Rank Hacker Badges Score