LecLabs 3.4 - Search and Heap

Intro to Programming Languages.

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

Lecture video on BFS 2

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

Lecture video on Min Heap 1

Lecture video on Min Heap Insert

Lecture video on Min Heap Delete

Lecture video on Min Heap in Array

Lecture video on Min Heap in Array doing an Insert

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

LecLabs 3.4 - Search and Heap

Intro to Programming Languages.

Challenges

Lecture 3.4.1.0 BFS 1

Lecture 3.4.1.1. BFS 2

EzLab 3.4.1.1 BFS in a Matrix

Lecture 3.4.2.0 Min Heap 1

Lecture 3.4.2.1. Min Heap Insert

Lecture 3.4.2.2. Min Heap Delete

Lecture 3.4.2.3. Min Heap in Array

Lecture 3.4.2.4. Min Heap in Arr Insert

30-Day Scoreboard:

LecLabs 3.4 - Search and Heap

Intro to Programming Languages.

Challenges

Lecture 3.4.1.0 BFS 1 2 solves

Lecture 3.4.1.0 BFS 1

Lecture 3.4.1.1. BFS 2 2 solves

Lecture 3.4.1.1. BFS 2

EzLab 3.4.1.1 BFS in a Matrix 2 solves

EzLab 3.4.1.1 BFS in a Matrix

Lecture 3.4.2.0 Min Heap 1 2 solves

Lecture 3.4.2.0 Min Heap 1

Lecture 3.4.2.1. Min Heap Insert 2 solves

Lecture 3.4.2.1. Min Heap Insert

Lecture 3.4.2.2. Min Heap Delete 2 solves

Lecture 3.4.2.2. Min Heap Delete

Lecture 3.4.2.3. Min Heap in Array 2 solves

Lecture 3.4.2.3. Min Heap in Array

Lecture 3.4.2.4. Min Heap in Arr Insert 2 solves

Lecture 3.4.2.4. Min Heap in Arr Insert

30-Day Scoreboard: