Skip to content
Programming101
Programming101

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programming101

Learn everything about programming

Leetcode Valid Perfect Square problem solution

YASH PAL, 31 July 2024

In this Leetcode Valid Perfect Square problem solution, You are given a positive integer num, write a function which returns True if num is a perfect square else False. Follow up: Do not use any built-in library function such as sqrt.

Leetcode Valid Perfect Square problem solution

Problem solution in Python.

class Solution:
    def isPerfectSquare(self, num: int) -> bool:
        x = 0
        while x*x < num:
            x += 1
        return x*x == num

Problem solution in Java.

class Solution {
    public boolean isPerfectSquare(int num) {
         for (int i = 1; i * i <= num; i++) {
            if ((num % i == 0) && (num / i == i)) {
                return true;
            }
        }
        return false; 
    }
}

Problem solution in C++.

class Solution {
public:
    bool isPerfectSquare(int x) {
        int l=1,r=x;
        if(x<1)
        {
            return false;
        }
        if(x==1)
        {
            return true;
        }
        while(l<=r)
        {
           long long int mid=l+ floor((r-l)/2);
            if((mid*mid)==x)
            {
                return true;
            }
            if(mid>x/mid)//mid*mid>x
            {
                r=mid-1;
            }
            else
            {
                l=mid+1;
            }
        }
        return false;
    }
};

Problem solution in C.

bool isPerfectSquare(int num){

long int i=1,squareroot=0;
for(i=1;i<=num;i++)
{
    squareroot=i*i;
    if(squareroot==num)
        return true;
    if(squareroot>num)
        return false;
}
return false;
}

coding problems

Post navigation

Previous post
Next post
  • HackerRank Separate the Numbers solution
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
  • Hackerrank Day 6 Lets Review 30 days of code solution
How to download udemy paid courses for free

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
©2025 Programming101 | WordPress Theme by SuperbThemes