← British Telecom questions
CodingReported in a candidate post, Aug 2024

Clockwise/anti-clockwise array sum and divisor path

Filed under British Telecom

The question

Calculate the difference between an array's clockwise and anti-clockwise sum, and find the minimum steps to reach from 1 to N moving only to numbers that are divisors of the current position using memoization.

No write-up yet. Related questions below have one.

Collected from public candidate posts and coding forums. Updated Nov 2026.