developer-roadmap/roadmaps/leetcode/content/powx-n@ea7dib41v61Vz--ewLcF4.md

Pow(x, n)

Implement the power function that raises x to the nth power, including negative exponents, in O(log n). You use fast exponentiation: square the base and halve the exponent at each step, handling odd exponents by multiplying in an extra factor. This problem teaches you recursive divide-and-conquer on a numerical computation, and is the standard way to implement exponentiation efficiently. Visit the question on the LeetCode website.

Visit the following resources to learn more:

• @article@Pow(x, n)
• @video@POW(x,n) | Binary Exponentiation | Leetcode
• @video@Pow(x, n) Python Solution - LeetCode #50