{"id":"weakest-rows-ignores-sorted-row-property","text":"The k-weakest-rows solution uses `sum(row)` to count soldiers, ignoring the constraint that 1s always precede 0s — a property that would allow O(log n) binary search per row instead of O(n) summation.","truth_value":"IN","source":"entries/2026/06/06/the-k-weakest-rows-in-a-matrix-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"weakest-rows-ignores-sorted-row-property","truth_value":"IN","reason":"premise"}]}}