teger k Find how many of them are divisible without remainder to the given integer k. • Array contains n elements (array = [array [0], array [1],…, array [n-1]]). K is a positive integer • Sum of consecutive elements for any (first, next) pair array [first] + array [next] if o first
An array containing the given n-element integers and the sum of the consecutive elements in the array with the integer k
Find how many of them are divisible without remainder to the given integer k.
• Array contains n elements (array = [array [0], array [1],…, array [n-1]]).
K is a positive integer
• Sum of consecutive elements for any (first, next) pair
array [first] + array [next] if o first <next
Write the Java code that returns the result for the integer array (array) and integer (k) entered in this context.
ü Define the section to be calculated as Java object (Question2).
ü Question2; Take the note string as input.
public Question2 (int [] input)
ü Take the value of "k" as input in the "countSumPairs" method to be calculated and how many
return the sum of the pairs is divided by the value "k" without any remainder.
o public int countSumPairs (int k)
Code sample:
public class Question2 {
public Question2 (int [] input) {
}
// Complete the countSumPairs function below
public int countSumPairs (int k) (
}
}
Step by step
Solved in 2 steps with 2 images
