Write a program that checks whether a number is a perfect square. The program should take an integer as input and output a Boolean indicating whether or not the input is a perfect square.
Example:
Input: 16
Output: True
Input: 15
Output: False
A perfect square is an integer that is the square of an integer. For example, 1, 4, 9, and 16 are perfect squares, but 3 and 11 are not. You can check if a number is a perfect square by calculating its square root and checking if it is an integer.
NOTEOwing to browser caching, any code input into the Trinket IDE might carry over across page refreshes or when transitioning between different questions. To commence with a clean slate, either click on the 'Reset Button' found within the IDE's Hamburger icon (☰) menu or resort to using Chrome's Incognito Mode.