Status: IN
For triplet-constraint problems, precomputing a hash set of valid values for one dimension (e.g., perfect squares up to n^2) reduces an O(n^3) brute force to O(n^2) by replacing the innermost loop with an O(1) set membership check.
Source: entries/2026/06/06/count-square-sum-triples-solution.md