Leetcode 2438. Range Product Queries of Powers
Decompose n into the minimal sorted list of powers of two that sum to it (equivalently the powers corresponding to its set bits). For each query [l,r], return the product of powers[l..r] modulo 10^9+7.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.