Graphs pattern

Union-Find (DSU)

Disjoint sets · find + union. Watch it run step by step, then write your own pseudocode and get it checked by AI.

  • Concept
  • 1 approach
Sign in to open it See plans

Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.

Graphs

Concept lesson

The approach

  1. 01 Disjoint Set Union ~O(α(n)) per opO(n) space
Played step by step, with its time and space.

What you will learn

  • The idea behind Graphs, drawn one step at a time
  • Disjoint Set Union: ~O(α(n)) per op time, O(n) space
  • The pseudocode for each approach, its line lit as the animation runs

More Graphs

See Union-Find (DSU) run, step by step

Sign in and this page opens on the animation, with all 9 Graphs problems beside it.

Sign in to open itSee plans

DSA comes with the all labs plan and every ChaiCode batch.