-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathCount_Squares.cpp
44 lines (37 loc) · 982 Bytes
/
Count_Squares.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/*
Probelm Statement:
-----------------
Consider a sample space S consisting of all perfect squares starting from 1, 4, 9 and so on. You are given a number N,
you have to output the number of integers less than N in the sample space S.
Example 1:
---------
Input :
N = 9
Output:
2
Explanation:
1 and 4 are the only Perfect Squares less than 9. So, the Output is 2.
Example 2:
---------
Input :
N = 3
Output:
1
Explanation:
1 is the only Perfect Square less than 3. So, the Output is 1.
Your Task:
You don't need to read input or print anything. Your task is to complete the function countSquares() which takes an Integer N as input and returns the answer.
Expected Time Complexity: O(sqrt(N))
Expected Auxiliary Space: O(1)
*/
// Link --> https://practice.geeksforgeeks.org/problems/count-squares3649/1#
// Code:
class Solution
{
public:
int countSquares(int N)
{
return (sqrt(N-1));
}
};
//NOTE : There are sqrt(n) Perfect Squares between 1 and n.