Please enter your email address or userHandle.
Given a positive integer N, check if it is a perfect square or not.
Note: Try to solve the question using only addition and subtraction operation.
N = 35
35 is not a perfect
N = 49
49 is a perfect
You don't need to read input or print anything. Your task is to complete the function checkPerfectSquare() which takes an integer N and returns 1 if it is a perfect square, else 0.
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)
1<= N <=105
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.