Skip to main content
Back to course
Log in
Get started
Someone wanted to learn this too, so Grasp built them a personal learning path.
Create your own
Remote Software Engineering Careers
ยท
Module 2
Advanced Algorithmic Patterns: Heaps and Searching
1
Top K Elements with Heaps
Apply the Top K Elements pattern using Heaps (Priority Queues) to solve frequency and selection problems.
2
K-way Merge: Combining Sorted Lists
Implement the K-way Merge pattern to combine multiple sorted lists.
3
Two Heaps: Solving Data Stream Problems
Solve problems using the Two Heaps pattern, such as finding the median of a data stream.
4
Modified Binary Search for Rotated Arrays
Implement Modified Binary Search for searching in rotated or almost-sorted arrays.
5
Recursive Subset Generation with Backtracking
Solve subset generation problems using recursion and backtracking.
Previous module
Advanced Algorithmic Patterns: Arrays and Lists
Next module
Advanced Algorithmic Patterns: Graphs and Trees