Online Assessment

Four OA Problems Under a Tight Clock

Capital OneSoftware Engineer · Online Assessment · Sep 2025

The first problem was to figure out how many numbers in an array are a power of some number k. Basically you check whether repeatedly dividing by k eventually gets you to 1, but you have to watch out for the special case where k=1. The second problem was about a planet's lunar calendar: given the moon phase at the start of the year, compute the moon phase on a given date. The phases cycle every 8…

Shared by a candidate · reported Sep 2025. Interview formats change; use it as a guide, not a script.