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.
defsquares(a,b):# Find the smallest integer whose square is >= astart=math.ceil(math.sqrt(a))# Find the largest integer whose square is <= bend=math.floor(math.sqrt(b))# The count of perfect squares is the difference + 1returnmax(0,end-start+1)
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 →