numbers

given 3 numbers {1, 3, 5}, we need to tell the total number of ways we can form a number 'n' using the sum of the given three numbers.

provided is a list of numbers. for each of the numbers in the list, determine whether they are even. if the number is even, add true to a new list called is_even. if the number is odd, then add false.

find the two non-repeating elements in an array of repeating elements/ unique numbers 2

7 numbers specify year, month, day, hour, minute, second, and millisecond (in that order):

given a set of candidate numbers a and a target number b, find all unique combinations in a where the candidate numbers sums to b. the same repeated number may be chosen from a unlimited number of times.

write n lines with m numbers each that describe the layout of the second layer in the way shown above

which block of code will sum the numbers from 1 to n (including n) and store it in the variable "sum"?

write a program to match a no. which is entered by user with random number .if both numbers are matched then you win otherwise you lose

given two integers a and b, which can be positive or negative, find the sum of all the integers between including them too and return it. if the two numbers are equal return a or b.

swap two numbers without using a third variable ( all possible ways ).