CodingMedium
Maximize sweetness score in graph game
Filed under Sprinklr
The question
Given a connected undirected graph with node sweetness values, Alice deletes a node and its incident edges. Bob selects a connected component to maximize sweetness, and Alice selects from the remaining components. Compute the optimal scores for both players assuming optimal play.
No write-up yet. Related questions below have one.
Related Sprinklr questions
Collected from public candidate posts and coding forums. Updated Nov 2026.