Challenge: Filtering Numbers in a Loop
Opgave
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
forloop 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
sumafter the loop ends.
Løsning
solution.java
Var alt klart?
Tak for dine kommentarer!
Sektion 3. Kapitel 8
single
Spørg AI
Spørg AI
Spørg om hvad som helst eller prøv et af de foreslåede spørgsmål for at starte vores chat
Awesome!
Completion rate improved to 2.7
Challenge: Filtering Numbers in a Loop
Stryg for at vise menuen
Opgave
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
forloop 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
sumafter the loop ends.
Løsning
solution.java
Var alt klart?
Tak for dine kommentarer!
Sektion 3. Kapitel 8
single