Dsa
Math
Easy
Perfect Squares Count
Write a program to count how many perfect squares exist between two given integers inclusive. A perfect square is an integer that is the square of an integer. The program should read two integers, `low` and `high`.
Input format:
Two integers `low` and `high` with 1 <= low <= high <= 100000.
Output format:
Single integer, the count of perfect squares between `low` and `high`.
Example:
Input:
10 30
Output:
4
Key concepts
mathlooping
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now