Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Union-Find

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Union-Find

Redundant Connection

advancedlayer A2 · Union-Find5 tests

You start with a tree over n nodes labelled 1 to n and one extra undirected edge is added, creating exactly one cycle. Given the list of edges in the order they were added, return the edge that can be removed so the result is a tree again.

  • If several edges would work, return the one that appears last in the input
  • The returned value must be the edge array itself, e.g. [2, 3]
  • Node labels are 1-based

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen