Skip to main content

Union-Find

1 lessonAbout 6 minutesAdvanced

This part of the DSA Tutorial runs from Union-Find (Disjoint Sets). There is 1 lesson here, and working through them takes about 6 minutes at a steady pace.

It follows on from Graphs, so finish that first if you have not already — the examples below assume you are comfortable with it.

Each lesson below says what it covers before you open it. Read them in order the first time; afterwards this page works as a index you can jump back into when you need to check one thing.

  1. 1Union-Find (Disjoint Sets)Union-Find answers 'are these two connected?' in near-constant time. Learn path compression and union by rank in JavaScript, and the problems it solves that BFS cannot.