Pow(x, n)

Asked byFacebookAmazonBloombergLinkedInGoogleMicrosoft

Problem

Implement pow(x, n) — computing x raised to the power n — without using a built-in power function, and correctly handling negative values of n.

Examples

Example 1

Input:x = 2.0, n = 10

Output:1024.0

Example 2

Input:x = 2.0, n = -2

Output:0.25

Constraints

-100 < x < 100
-2^31 <= n <= 2^31 - 1

Solve it in the editor. Sign in free to run your Python or JavaScript against test cases, get a verdict, and track your attempts.

Solve on FeatCode →

How to approach it: the Math & Geometry pattern

A grab-bag of problems solved with numeric or coordinate reasoning rather than a specific data structure — matrix manipulation, simulation, and basic number theory.

Look for this pattern when

The problem operates on a 2-D grid or matrix directly (rotate, transpose, traverse in a pattern).
There's no obvious "textbook" data structure — the problem is really about careful step-by-step simulation.

Read the full Math & Geometry guide →

Video walkthroughs

Original problem on LeetCode ↗