leetcode Reverse String
Write a function that takes a string as input and returns the string reversed.
Given s = “hello”, return “olleh”.
leetcode Integer Break
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.
For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4).
Note: you may assume that n is not less than 2.
leetcode Power of Four
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.
Given num = 16, return true. Given num = 5, return false.
Follow up: Could you solve it without loops/recursion?