Top 150 InterviewEasy

Pow(x, n)

Detailed guide and Python implementation for the 'Pow(x, n)' problem.

Problem Statement

Easy

Implement pow(x, n), which calculates x raised to the power n (i.e., x^n).

Implement a function myPow(x: float, n: int) -> float.

Constraints
  • -100.0 < x < 100.0
  • -2^31 <= n <= 2^31 - 1
  • n is an integer
  • Either x is not zero or n > 0
  • -10^4 <= x^n <= 10^4

Examples

Example 1
Input
2.00000, 10
Output
1024.00000
Explanation

2^10 = 1024.

Example 2
Input
2.10000, 3
Output
9.26100
Explanation

2.1^3 = 9.261.

Example 3
Input
2.00000, -2
Output
0.25000
Explanation

2^(-2) = 1/(2^2) = 1/4 = 0.25.

Need a Hint?
Consider using Math & Geometry-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.