Status: IN
Solutions leverage mathematical reasoning — closed-form formulas for arithmetic series, greedy optimality proofs for prefix-free codes and assignment problems, algebraic reductions — to replace iterative or exhaustive computation with provably correct O(1) or O(n) alternatives.
Both patterns achieve the same outcome (bypassing brute-force enumeration) via the same means (a mathematical argument that a simpler computation yields the same answer); they differ only in whether the shortcut is algebraic or algorithmic
Depends on (SL): closed-form-reduction-eliminates-iteration, greedy-algorithms-provably-optimal