LeetCode Experience

#50 Pow(x, n)

SWE coding Medium

Sign in to bookmark Original →

Interview Experience

LeetCode #50: Pow(x, n). Difficulty: Medium. Topics: Math, Recursion. Asked at Microsoft in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Math Recursion

More from Microsoft

Reddit I analyzed 11k available dev jobs to find out what skills employers are looking for right now Reddit Best Resources/Materials For FAANG Companies Reddit Is it positive sign ? Reddit Premera’s Software Development Summer Internship Interview Reddit Tips Needed

← All Microsoft questions Microsoft Software Engineer Questions → All Math, Recursion Questions →