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.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Sherlock and Squares
  5. Discussions

Sherlock and Squares

Sort by

recency

|

1574 Discussions

|

  • abhijeetmaharan2
     + 0 comments
    def squares(a, b):
    
    # Find the smallest integer whose square is >= a
    start = math.ceil(math.sqrt(a))
    # Find the largest integer whose square is <= b
    end = math.floor(math.sqrt(b))
    # The count of perfect squares is the difference + 1
    return max(0, end - start + 1)

  • weaslypaul923
     + 0 comments

    Sherlock and Squares always bring that unique style, and their discount BJJ rash guards are a steal! Whether you're rolling on the mats or just want some slick gear, this is the spot to check out. Quality, comfort, and savings—what more could you ask for? More Info: https://getagripbjj.com/

  • alban_tyrex
     + 0 comments

    Here are my c++ solutions, you can watch the explanation here : https://youtu.be/LtU0ItsvbMI

    Solution 1 O(√n)

    int squares(int a, int b) {
    int i = ceil(sqrt(a)), result = 0;
    for(; i * i <= b; i++) result++;
    return result;
}

    Solution 2 O(1)

    int squares(int a, int b) {
    int i = ceil(sqrt(a)), j = floor(sqrt(b));
    return j - i + 1;
}

  • willy756_taiwan
     + 0 comments

    python solution with O(1).

    import math
def squares(a, b):
    #pow(a, 0.5) ~ pow(b, 0.5)
    start = math.ceil(pow(a, 0.5))
    end = math.floor(pow(b, 0.5))
    return end-start+1

  • patrickgao2020
     + 0 comments

    Here is my Python solution! The highest and lowest variables are the highest and lowest square root that are between a and b. If the lowest is greater than b, we know that there are no perfect squares. Otherwise, it is simply the difference between the highest and lowest plus 1.

    def squares(a, b):
    highest = math.floor(math.sqrt(b))
    lowest = math.ceil(math.sqrt(a))
    print(lowest, highest)
    if lowest > b:
        return 0
    return highest - lowest + 1