Min Subarray from Each Index Covering All Talents

Phone ScreenCitadelLast reported May 2025Low Frequency
Reported
1× across candidate reports
First seen
May 2025
Last reported
May 2025
Reported outcome
unknown

Problem Overview

Phone interview: the second of two online technical rounds. You are given an array v of length n, where v[i] is the talent of the i-th person. Talents are represented by integers. You are also given talentCount, the total number of distinct talents. For each index i, find the minimum…

  • The rest of the 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 Citadel catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Citadel question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?