Challenge: Filtering Numbers in a Loop
Taak
Swipe to start coding
Find the sum of all numbers from 1 to n
, excluding those that are divisible by 3 or 5.
- Create a method called
sumNotDivisibleBy3Or5(int n)
that returns anint
. - Inside this method, create a
for
loop that iterates from 1 ton
(inclusive). - In each iteration, check if the number is not divisible by 3 and not divisible by 5.
- If the number passes the condition, add it to a running total
sum
. - Return the total
sum
after the loop ends.
Oplossing
solution.java
Was alles duidelijk?
Bedankt voor je feedback!
Sectie 3. Hoofdstuk 8
single
Vraag AI
Vraag AI
Vraag wat u wilt of probeer een van de voorgestelde vragen om onze chat te starten.
Awesome!
Completion rate improved to 2.7
Challenge: Filtering Numbers in a Loop
Veeg om het menu te tonen
Taak
Swipe to start coding
Find the sum of all numbers from 1 to n
, excluding those that are divisible by 3 or 5.
- Create a method called
sumNotDivisibleBy3Or5(int n)
that returns anint
. - Inside this method, create a
for
loop that iterates from 1 ton
(inclusive). - In each iteration, check if the number is not divisible by 3 and not divisible by 5.
- If the number passes the condition, add it to a running total
sum
. - Return the total
sum
after the loop ends.
Oplossing
solution.java
Was alles duidelijk?
Bedankt voor je feedback!
Awesome!
Completion rate improved to 2.7Sectie 3. Hoofdstuk 8
single