human
I found an interesting problem on https://leetcode.com/problems/valid-perfect-square/:
Given a positive integer num, write a function which returns True if num is a perfect square else False.

Note: Do not use any built-in library function such as sqrt.

Example 1:

Input: 16
Returns: True


Example 2:

Input: 14
Returns: False


Credits:Special thanks to @elmirap for adding this problem and creating all test cases.

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python code you requested.

class Solution:
     def isPerfectSquare(self, num):
         sign = True
         i = 1
         while(sign):
             if(num == i * i):
                 return True
             elif(num > i * i):
                 i = i + 1
             else:
                 return False