about | help | code help+videos | done | prefs |
Given a 2-digit number, return True if it's divisible by 3. Otherwise, return False. Use the divisibility rule for 3, DO NOT mod aNumber by 3. tensThatAreDivisibleBy3(33) → True tensThatAreDivisibleBy3(17) → False tensThatAreDivisibleBy3(98) → False ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 125
Copyright Nick Parlante 2017 - privacy