GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Sheets
  3. /Blind 75
  4. /Union-Find / Disjoint Set
←Back to Blind 75
Curated IntersectionSheet: Blind 75Pattern: Union-Find / Disjoint Set

Blind 75 · Union-Find / Disjoint Set

Maintain disjoint sets with union and find operations to detect connectivity or cycles as edges are processed.

Sheet Problems: 2
Category: Graphs
ℹ

Curated selection from Blind 75

This sheet features 2 problems testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the Union-Find / Disjoint Set Pattern Guide.

Featured Problems (2)

1.Graph Valid TreeMedium
Solve↗
2.Number of Connected Components in an Undirected GraphMedium
Solve↗

Explore More Patterns in Blind 75

Track your progress across all 75 problems in this curriculum roadmap.

Back to Blind 75Union-Find / Disjoint Set Pattern Guide
GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy