{"id":"circular-distance-formula-no-modulo","text":"The circular distance between two indices in an array of size n is computed as `min(abs(i - j), n - abs(i - j))` without modular arithmetic — a recurring idiom across circular-array problems in this repo.","truth_value":"IN","source":"entries/2026/06/06/shortest-distance-to-target-string-in-a-circular-array-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"circular-distance-formula-no-modulo","truth_value":"IN","reason":"premise"}]}}