Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 98

Lesson walkthrough

Pow(x, n)

MediumRecursion & Call Stack

Implement pow(x, n) — x raised to the integer power n — with O(log |n|) recursive calls. Handle negative exponents.

Examples

Example 1

Input: x = 2.00000, n = 10

Output: 1024.00000

Example 2

Input: x = 2.00000, n = -2

Output: 0.25000

Constraints

-100.0 < x < 100.0-2³¹ ≤ n ≤ 2³¹ - 1

Target ComplexityNot required

O(log n) Time · O(log n) Space

Companies (6)

AmazonGoogleMetaMicrosoftAppleAdobe

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputx = 2.00000, n = 10

Expected1024.00000

Output—