Hi EPI,

In the solution, the brute force time complexity is given as O(2^n) where n is the number of bits in the integer type.

Could you please expand on this? I was under the impression that multiplying two integers of n bits would give O(n^2) time complexity and since the brute method does this y-1 multiplications, we have y-1 * O(n^2) = O(n^2).