Leetcode 970. Powerful Integers

Return all distinct values ≤ bound that can be written as x^i + y^j for nonnegative integers i,j; the core challenge is enumerating pairs of powers up to the bound (noting powers stop growing unless a base equals 1) while avoiding duplicates.