Status: IN
`find_pivot` reduces the problem to checking whether `n*(n+1)/2` is a perfect square, yielding O(1) time and space with no loops or recursion.
Source: entries/2026/06/06/find-the-pivot-integer-solution.md
JSON