//Instead of using the classic recursive approach i.e. x*pow(x, n-1) just have (x*x), i.e., pow(x*x, n/2). //This will make the TC logarithmic instead of linear. //Just take care of the edge cases ...
Leetcode solutions. Contribute to ensonfun/leetcode-neetcode development by creating an account on GitHub.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results