Advanced Algorithms

Apply greedy algorithms, backtracking, and understand NP-completeness.

advanced ⚡ Algorithms & Data Structures

0%

Confidence · no data yet

Sign in to track

After this skill you can…

Implement backtracking for constraint problems
Apply greedy proofs for correctness
Explain P vs NP and common NP-hard problems

Prerequisites

Dynamic Programming

Learn this skill (10 videos)

Union Find Kruskal's Algorithm

WilliamFiset · beginner

Union Find Introduction

WilliamFiset · beginner

Priority Queue Code

WilliamFiset · beginner

Priority Queue Removing Elements

WilliamFiset · beginner

Priority Queue Inserting Elements

WilliamFiset · beginner

Priority Queue Min Heaps and Max Heaps

WilliamFiset · beginner

Priority Queue Introduction

WilliamFiset · beginner

A challenging puzzle about subset sums

3Blue1Brown · intermediate

Expressing Data Desires through Vectors // Daniel Svonava // MLOps podcast #214 clip

MLOps.community · beginner

Sudoku Solver in Python

NeuralNine · beginner