Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.