We need to check whether a number is a perfect square or not without finding its square root.
Input : n = 36
Output : Yes
Input : n = 12
Output : No
We have discussed a method to check if a number is perfect square.
The idea is to run a loop from i = 1 to floor(sqrt(n)) then check if squaring it makes n.
- Check if given number is perfect square
- Check whether the number can be made perfect square after adding 1
- Check perfect square using addition/subtraction
- Check if product of array containing prime numbers is a perfect square
- Euler's criterion (Check if square root under modulo p exists)
- Square root of a number using log
- Largest number that is not a perfect square
- Largest perfect square number in an Array
- Largest factor of a given number which is a perfect square
- Find the Next perfect square greater than a given number
- Largest Divisor of a Number not divisible by a perfect square
- Minimum digits to remove to make a number Perfect Square
- Find minimum number to be divided to make a number a perfect square
- Count numbers upto N which are both perfect square and perfect cube
- Find square root of number upto given precision using binary search
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.