Closest Perfect Square Problem Statement
Given a positive integer 'N', determine the perfect square number closest to 'N' and the number of steps required to reach that perfect square.
Example:
Input:
N = 21
Output:
[25, 4]
Explanation:
The perfect square closest to 21 is 25, and the distance is 4.
Constraints:
- 1 <= T <= 50
- 1 <= N <= 109
- Time Limit: 1 sec.

AnswerBot
4mo
Given a positive integer 'N', find the closest perfect square number and the steps required to reach it.
Find the square root of N and round it to the nearest integer to get the closest perfect square....read more
Help your peers!
Add answer anonymously...
Nagarro Software Developer interview questions & answers
A Software Developer was asked 8mo agoQ. Explain Kafka and how you would implement it.
A Software Developer was asked 9mo agoQ. Is the directory a file?
A Software Developer was asked 9mo agoQ. What is memory segmentation?
Popular interview questions of Software Developer
A Software Developer was asked 8mo agoQ1. Explain Kafka and how you would implement it.
A Software Developer was asked 9mo agoQ2. Is the directory a file?
A Software Developer was asked 9mo agoQ3. What is memory segmentation?
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

