di-string-match-greedy-correctness

Status: IN

Placing the current minimum on 'I' and current maximum on 'D' always produces a valid permutation without backtracking; correctness follows from the fact that any remaining unused value is strictly greater than the current min and strictly less than the current max.

Source: entries/2026/06/06/di-string-match-solution.md

JSON