Multiples of 2 and 3 Problem Statement

Ninja is engaged in a task involving divisors. He is given 'N' numbers, and his objective is to compute the sum of all numbers which are divisible by either 2 or 3.

Example:

Input:

N = 5
Numbers = [1, 2, 3, 5, 6]

Output:

11

Explanation:

For the numbers provided (1, 2, 3, 5, 6), only 2, 3, and 6 are divisible by either 2 or 3. Hence, the sum is 2 + 3 + 6 = 11.

Constraints:

1

Question

Multiples of 2 and 3 Problem Statement

Ninja is engaged in a task involving divisors. He is given 'N' numbers, and his objective is to compute the sum of all numbers which are divisible by either 2 or 3.

Example:

Input:

N = 5
Numbers = [1, 2, 3, 5, 6]

Output:

Explanation:

For the numbers provided (1, 2, 3, 5, 6), only 2, 3, and 6 are divisible by either 2 or 3. Hence, the sum is 2 + 3 + 6 = 11.

Constraints:

1 <= T <= 10
1 <= N <= 10^3
0 <= input[i] <= 10^3

Accepted Answer

Find the sum of numbers divisible by 2 or 3 from a given list of numbers.

Iterate through the list of numbers and check if each number is divisible by 2 or 3.
If a number is divisible by 2 or 3, add it to the sum.
Return the final sum as the output.