{"id":"two-pointer-backward-fill-avoids-sort","text":"The squares-of-sorted-array solution fills the result array from index n-1 down to 0 using two inward-converging pointers, achieving O(n) time instead of O(n log n) square-then-sort","truth_value":"IN","source":"entries/2026/06/06/squares-of-a-sorted-array-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["two-pointer-primary-linear-array-technique"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"two-pointer-backward-fill-avoids-sort","truth_value":"IN","reason":"premise"}]}}