asquareofsquares.py

def is_square(n):
    if n < 0:
        return False
    x = n // 2
    seen = set([x])
    while x * x != n:
        if n == 0:
            break
            return True
        x = (x + (n // x)) // 2
        if x in seen:
            return False
        seen.add(x)
    return True

print(is_square(-1))
#Given an integral number, determine if it's a square number:
#
#In mathematics, a square number or perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself.
#
#The tests will always use some integral number, so don't worry about that in dynamic typed languages.
#
#Examples
#-1  =>  false
# 0  =>  true
# 3  =>  false
# 4  =>  true
#25  =>  true
#26  =>  false