{"id":"well-spaced-exclusive-distance","text":"The distance formula `i - first_seen[c] - 1` counts characters *strictly between* the two occurrences, excluding both endpoints — matching the LeetCode problem's definition.","truth_value":"IN","source":"entries/2026/06/06/check-distances-between-same-letters-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"well-spaced-exclusive-distance","truth_value":"IN","reason":"premise"}]}}