This week's missions: Escape and The Greatest Common Divisor
Hello CheckiO users! 🙂
💪 Challenge yourself with our latest missions on the Mine station:
The first one is called Escape and here your task is to estimate whether the fly will succeed in its attempts to fly out of the jar or not.
escape([1000, 500, 200], [0, 0, 100, 0]) == false escape([1000, 500, 200], [450, 50, 0, -100]) == true escape([1000, 1000, 200], [450, 1000, 100, 0]) == false escape([1000, 1000, 200], [250, 250, -10, -50]) == false escape([1000, 2000, 200], [20, 35, 100, 175]) == true
The second mission is The Greatest Common Divisor where you should find the greatest common factor of the given arbitrary number of positive integers.
greatestCommonDivisor(6, 4) == 2 greatestCommonDivisor(2, 4, 8) == 2 greatestCommonDivisor(2, 3, 5, 7, 11) == 1 greatestCommonDivisor(3, 9, 3, 9) == 3
💡 Highlights from the JS world:
- Check out all the ways you can export and import within your modules by checking the ES Modules in Depth. You will definitely learn how to make your imports and exports work the way you need them to!
Welcome to CheckiO - games for coders where you can improve your codings skills.
The main idea behind these games is to give you the opportunity to learn by exchanging experience with the rest of the community. Every day we are trying to find interesting solutions for you to help you become a better coder.Join the Game