by

Where communities thrive


  • Join over 1.5M+ people
  • Join over 100K+ communities
  • Free without limits
  • Create your own community
People
Activity
    CamperBot
    @camperbot

    hint [5/7]

    Hint: 3

    If you sort the array from greater to lowest then you can check for the first two numbers as it is more likely to the the smallest common multiple than the lower numbers.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Ettiene Grobler
    @egrobler
    hint
    CamperBot
    @camperbot

    hint [1/7]

    ## :construction: After this are possible spoiler hints.

    Make sure you've tried to hard to solve it yourself before proceeding. :construction:

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    frostmere
    @removed~frostmere
    hint
    CamperBot
    @camperbot

    hint [2/7]

    # Explanation:

    This particular problem can be confusing because most people look for the smallest common multiple of the two number but forget the keyword range. This means that if you get [1,5] then you have to check for the smallest common multiple for all these numbers [1,2,3,4,5] that is evenly divisible by all of them.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    frostmere
    @removed~frostmere
    hint
    CamperBot
    @camperbot

    hint [3/7]

    Hint: 1

    Create an array with all the numbers that are missing from the original array to make it easier to check when having to check for even division.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    frostmere
    @removed~frostmere
    hint
    CamperBot
    @camperbot

    hint [4/7]

    Hint: 2

    You can use modulo % to check if the reminder is 0, which means it is evenly divisible.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    frostmere
    @removed~frostmere
    hint
    CamperBot
    @camperbot

    hint [5/7]

    Hint: 3

    If you sort the array from greater to lowest then you can check for the first two numbers as it is more likely to the the smallest common multiple than the lower numbers.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    frostmere
    @removed~frostmere
    hint
    CamperBot
    @camperbot

    hint [6/7]

    Spoiler Alert!

    687474703a2f2f7777772e796f75726472756d2e636f6d2f796f75726472756d2f696d616765732f323030372f31302f31302f7265645f7761726e696e675f7369676e5f322e676966.gif

    Solution ahead!

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    frostmere
    @removed~frostmere
    hint
    ffs
    hint
    CamperBot
    @camperbot
    These hints depend on people like you! Please add to this :point_right: Bonfire's Wiki Hints Page
    frostmere
    @removed~frostmere
    wtf
    hint
    CamperBot
    @camperbot

    hint [1/7]

    ## :construction: After this are possible spoiler hints.

    Make sure you've tried to hard to solve it yourself before proceeding. :construction:

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    frostmere
    @removed~frostmere
    :facepunch:
    hint
    hint
    hint
    camperbot u mad?
    hint
    hint
    HINT
    H I N T
    dc
    @dcsan
    hint
    CamperBot
    @camperbot

    hint [1/7]

    ## :construction: After this are possible spoiler hints.

    Make sure you've tried to hard to solve it yourself before proceeding. :construction:

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    dc
    @dcsan
    hint
    CamperBot
    @camperbot

    hint [2/7]

    # Explanation:

    This particular problem can be confusing because most people look for the smallest common multiple of the two number but forget the keyword range. This means that if you get [1,5] then you have to check for the smallest common multiple for all these numbers [1,2,3,4,5] that is evenly divisible by all of them.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    dc
    @dcsan
    hint
    CamperBot
    @camperbot

    hint [3/7]

    Hint: 1

    Create an array with all the numbers that are missing from the original array to make it easier to check when having to check for even division.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    dc
    @dcsan
    hint
    CamperBot
    @camperbot

    hint [4/7]

    Hint: 2

    You can use modulo % to check if the reminder is 0, which means it is evenly divisible.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    dc
    @dcsan
    hint
    CamperBot
    @camperbot

    hint [5/7]

    Hint: 3

    If you sort the array from greater to lowest then you can check for the first two numbers as it is more likely to the the smallest common multiple than the lower numbers.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    dc
    @dcsan
    hint
    CamperBot
    @camperbot

    hint [6/7]

    Spoiler Alert!

    687474703a2f2f7777772e796f75726472756d2e636f6d2f796f75726472756d2f696d616765732f323030372f31302f31302f7265645f7761726e696e675f7369676e5f322e676966.gif

    Solution ahead!

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    dc
    @dcsan
    hint
    hint
    CamperBot
    @camperbot
    These hints depend on people like you! Please add to this :point_right: Bonfire's Wiki Hints Page
    duan walker
    @duanwalker
    whisky tango foxtrot?
    wheres the solution?
    OIC...solution is on the wiki page you guys
    Ghost
    @ghost~563399e616b6c7089cb8e11d
    hint
    CamperBot
    @camperbot

    hint [1/7]

    ## :construction: After this are possible spoiler hints.

    Make sure you've tried to hard to solve it yourself before proceeding. :construction:

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Ghost
    @ghost~563399e616b6c7089cb8e11d
    hint