I've been invited to take a written assessment. There were four problems in total:

• An easy one: parse a short program that moves a robot up or down and report its final position relative to the origin.
• A straightforward array-processing task—the algorithm was already spelled out in the statement, so you just had to copy it verbatim.
• Implement a round-robin load balancer; the only real pitfall is parsing the commands correctly.
• A twist on LeetCode 1248.

Pro tip for C++ users: brush up on substr's syntax beforehand. Once the clock is ticking and your mind goes blank, you'll end up hand-rolling it.

Parse a short program that moves a robot up or down and report its final position relative to the origin.