Given an integer n, return whether n = k * k for some integer k.
This should be done without using built-in square root function.
Constraints
0 ≤ n < 2 ** 31https://binarysearch.com/problems/Check-if-Number-Is-Perfect-Square
Input
25Output
TrueExplanation
25 = 5 * 5
Given a non-negative integer n, find a number r such that r * r = n and round down to the nearest integer.
You are given a list of integers piles and an integer k. piles[i] represents the number of bananas on pile i. On each hour, you can choose any pile and eat r...
You are given a list of unique integers nums that is sorted in ascending order and is rotated at some pivot point. Find the maximum number in the rotated list.
You are given a list of integers nums and an integer target. Return the lowest sum of pair of numbers that is greater than target. You can assume that a solu...
Leave a comment