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 Google 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 Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

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