30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 50. Pow(x, n)

Compute x raised to the integer power n (n may be negative and within 32-bit bounds), returning a double. The challenge is to handle negative exponents and large magnitude n efficiently using binary/exponentiation-by-squaring in O(log |n|) time while avoiding edge-case overflow (e.g., n = INT_MIN).

Asked at:

Meta

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early November, 2025

Meta

Mid-level

Late October, 2025

Meta

Mid-level

Late October, 2025

Meta

Mid-level

Get Premium to View All 20+ Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 50. Pow(x, n)

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact