Challenge: Filtering Numbers in a Loop
Tehtävä
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.
Ratkaisu
solution.java
Oliko kaikki selvää?
Kiitos palautteestasi!
Osio 3. Luku 8
single
Kysy tekoälyä
Kysy tekoälyä
Kysy mitä tahansa tai kokeile jotakin ehdotetuista kysymyksistä aloittaaksesi keskustelumme
Awesome!
Completion rate improved to 2.7
Challenge: Filtering Numbers in a Loop
Pyyhkäise näyttääksesi valikon
Tehtävä
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.
Ratkaisu
solution.java
Oliko kaikki selvää?
Kiitos palautteestasi!
Awesome!
Completion rate improved to 2.7Osio 3. Luku 8
single