Pow(x n) LeetCode Solution
Implement pow(x, n), which calculates x raised to the power n.
Implement pow(x, n), which calculates x raised to the power n.
You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).
Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.
Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. Return the quotient after dividing dividend by divisor.
Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.
Write an algorithm to determine if a number n is happy. Return true if n is a happy number, and false if not.
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.