{"id":"sort-greedy-positive-only","text":"`max_product_difference` is correct only because all `nums[i]` are positive (per LeetCode constraint 1 <= nums[i] <= 10^4); negative values would invalidate the assumption that the two smallest form the minimum product.","truth_value":"IN","source":"entries/2026/06/06/maximum-product-difference-between-two-pairs-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["greedy-optimality-requires-nonnegative-domain"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sort-greedy-positive-only","truth_value":"IN","reason":"premise"}]}}