Microsoft·Software Engineer·Onsite - Coding / Algorithms
- Given a list of tasks labeled A-Z and a cooldown period n, find the minimum number of time units needed to run all tasks (same task type must be separated by at least n intervals, idle slots allowed).
- Remove duplicates from a sorted integer array in-place using O(1) extra space, returning the count of unique elements.
- Rearrange a string so no two adjacent characters are the same. Return an empty string if it's impossible.
“I knew this one.”