We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
public static int squares(int a, int b) {
int startVal = (int)Math.sqrt(a);
int endVal = (int)Math.sqrt(b);
int sqrtcount = 0;
for(int i=startVal ; i<=endVal ; i++) {
int square = i*i;
if(square>=a && square<=b) {
sqrtcount++;
}
}
return sqrtcount;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Sherlock and Squares
You are viewing a single comment's thread. Return to all comments →
Java solution :