{"id":"heapify-over-repeated-push","text":"Solutions prefer `heapq.heapify()` (O(n)) for initial heap construction rather than n individual `heappush` calls (O(n log n)).","truth_value":"IN","source":"entries/2026/06/06/last-stone-weight-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"heapify-over-repeated-push","truth_value":"IN","reason":"premise"}]}}