2652. Sum Multiples Poison 2023-10-17 12345678910111213class Solution { public int sumOfMultiples(int n) { int sum = 0; for (int i = 1; i <= n; i++) { if (i % 3 == 0 || i % 5 == 0 || i % 7 == 0) { sum += i; } } return sum; }} References2652. Sum Multiples