Uniform Random Spanning Tree from Node Groups

Also reported as Random Edge Set to Connect Graphs

Phone ScreenDatabricksLast reported May 2026Low Frequency
Reported
2× across candidate reports
First seen
April 2026
Last reported
May 2026
Reported outcome
pass

Problem Overview

Databricks phone-screen question, reconstructed from 2 candidate reports (April 2026 to May 2026). Tests: DFS and connected components. The write-up includes a Python solution that passes 6 test cases.

  • The full problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full Databricks catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Databricks question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Follow-ups candidates reported, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The follow-ups candidates reported, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?