{"id":"parity-ii-linear-time","text":"The parity-II algorithm runs in O(n) time and O(1) extra space via two stride-2 pointers that each traverse at most n/2 elements.","truth_value":"IN","source":"entries/2026/06/06/sort-array-by-parity-ii-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"parity-ii-linear-time","truth_value":"IN","reason":"premise"}]}}