Citadel·Software Engineer·Technical Phone Screen
- Given an integer array, choose three cut points to split it into four contiguous segments. Define a value as (sum of segment 1) minus (sum of segment 2) plus (sum of segment 3) minus (sum of segment 4), where the segments appear in order. Find the maximum possible value over all valid cut choices, including cases where cuts coincide or fall at the boundaries.
- There are n developers each with a unique skill level. Each developer will only join a team if the number of selected teammates with lower skill is within their personal lower-skill tolerance, and the number with higher skill is within their higher-skill tolerance. Find the largest valid team where every selected member's constraints are satisfied simultaneously.
“Spent the first few minutes just trying to understand what the alternating sign pattern was actually doing.”