Sum of all the elements in an array divisible by a given number K
Last Updated :
05 Apr, 2023
Given an array containing N elements and a number K. The task is to find the sum of all such elements which are divisible by K.
Examples:
Input : arr[] = {15, 16, 10, 9, 6, 7, 17}
K = 3
Output : 30
Explanation: As 15, 9, 6 are divisible by 3. So, sum of elements divisible by K = 15 + 9 + 6 = 30.
Input : arr[] = {5, 3, 6, 8, 4, 1, 2, 9}
K = 2
Output : 20
The idea is to traverse the array and check the elements one by one. If an element is divisible by K then add that element's value with the sum so far and continue this process while the end of the array reached.
Below is the implementation of the above approach:
C++
// C++ program to find sum of all the elements
// in an array divisible by a given number K
#include <iostream>
using namespace std;
// Function to find sum of all the elements
// in an array divisible by a given number K
int findSum(int arr[], int n, int k)
{
int sum = 0;
// Traverse the array
for (int i = 0; i < n; i++) {
// If current element is divisible by k
// add it to sum
if (arr[i] % k == 0) {
sum += arr[i];
}
}
// Return calculated sum
return sum;
}
// Driver code
int main()
{
int arr[] = { 15, 16, 10, 9, 6, 7, 17 };
int n = sizeof(arr) / sizeof(arr[0]);
int k = 3;
cout << findSum(arr, n, k);
return 0;
}
// C program to find sum of all the elements
// in an array divisible by a given number K
#include <stdio.h>
// Function to find sum of all the elements
// in an array divisible by a given number K
int findSum(int arr[], int n, int k)
{
int sum = 0;
// Traverse the array
for (int i = 0; i < n; i++) {
// If current element is divisible by k
// add it to sum
if (arr[i] % k == 0) {
sum += arr[i];
}
}
// Return calculated sum
return sum;
}
// Driver code
int main()
{
int arr[] = { 15, 16, 10, 9, 6, 7, 17 };
int n = sizeof(arr) / sizeof(arr[0]);
int k = 3;
printf("%d",findSum(arr, n, k));
return 0;
}
// This code is contributed by kothavvsaakash.
// Java program to find sum of all the elements
// in an array divisible by a given number K
import java.io.*;
class GFG {
// Function to find sum of all the elements
// in an array divisible by a given number K
static int findSum(int arr[], int n, int k)
{
int sum = 0;
// Traverse the array
for (int i = 0; i < n; i++) {
// If current element is divisible by k
// add it to sum
if (arr[i] % k == 0) {
sum += arr[i];
}
}
// Return calculated sum
return sum;
}
// Driver code
public static void main (String[] args) {
int arr[] = { 15, 16, 10, 9, 6, 7, 17 };
int n = arr.length;
int k = 3;
System.out.println( findSum(arr, n, k));
}
}
// this code is contributed by anuj_67..
# Python3 program to find sum of
# all the elements in an array
# divisible by a given number K
# Function to find sum of all
# the elements in an array
# divisible by a given number K
def findSum(arr, n, k) :
sum = 0
# Traverse the array
for i in range(n) :
# If current element is divisible
# by k add it to sum
if arr[i] % k == 0 :
sum += arr[i]
# Return calculated sum
return sum
# Driver code
if __name__ == "__main__" :
arr = [ 15, 16, 10, 9, 6, 7, 17]
n = len(arr)
k = 3
print(findSum(arr, n, k))
# This code is contributed by ANKITRAI1
// C# program to find sum of all the elements
// in an array divisible by a given number K
using System;
public class GFG{
// Function to find sum of all the elements
// in an array divisible by a given number K
static int findSum(int []arr, int n, int k)
{
int sum = 0;
// Traverse the array
for (int i = 0; i < n; i++) {
// If current element is divisible by k
// add it to sum
if (arr[i] % k == 0) {
sum += arr[i];
}
}
// Return calculated sum
return sum;
}
// Driver code
static public void Main (){
int []arr = { 15, 16, 10, 9, 6, 7, 17 };
int n = arr.Length;
int k = 3;
Console.WriteLine( findSum(arr, n, k));
}
}
//This code is contributed by anuj_67..
<?php
// PHP program to find sum of all
// the elements in an array divisible
// by a given number K
// Function to find sum of all
// the elements in an array
// divisible by a given number K
function findSum($arr, $n, $k)
{
$sum = 0;
// Traverse the array
for ($i = 0; $i < $n; $i++)
{
// If current element is divisible
// by k add it to sum
if ($arr[$i] % $k == 0)
{
$sum += $arr[$i];
}
}
// Return calculated sum
return $sum;
}
// Driver code
$arr = array(15, 16, 10, 9, 6, 7, 17);
$n = sizeof($arr);
$k = 3;
echo findSum($arr, $n, $k);
// This code is contributed
// by Akanksha Rai(Abby_akku)
<script>
// Javascript program to find sum of all the elements
// in an array divisible by a given number K
// Function to find sum of all the elements
// in an array divisible by a given number K
function findSum(arr, n, k)
{
let sum = 0;
// Traverse the array
for (let i = 0; i < n; i++) {
// If current element is divisible by k
// add it to sum
if (arr[i] % k == 0) {
sum += arr[i];
}
}
// Return calculated sum
return sum;
}
let arr = [ 15, 16, 10, 9, 6, 7, 17 ];
let n = arr.length;
let k = 3;
document.write(findSum(arr, n, k));
</script>
complexity Analysis:
- Time Complexity: O(N), where N is the number of elements in the array.
- Auxiliary Space: O(1)
Using Recursion :
Start traversing the array using recursion and check if the current element is divisible by K. If yes then update the answer. Print the answer when all the elements get traversed.
Method 1 : (Pass By Reference)
Implementation :
- Make a variable sum and pass that address of that variable
- We passing address of sum variable so that no change occur in it after every another function call.
- We just increment our pointer and make another function call.
- Add the value at pointer into our sum and make another function call until the base condition hits.
C++
#include <iostream>
using namespace std;
void solve(int arr[], int k, int i, int& ans)
{
if (i < 0) { // boundry condition to stop the recurion
return;
}
if (arr[i] % k == 0) { // current element is divisible
// so add that element to our ans
ans += arr[i];
}
solve(arr, k, i - 1,
ans); // further iterate array using recursion
}
int main()
{
int n = 6;
int arr[n] = { 2, 6, 7, 12, 14, 18 };
int k = 2;
int sum = 0;
solve(arr, k, n - 1, sum);
cout << sum << " ";
return 0;
}
//this code is contributed by bhardwajji
import java.util.*;
public class Main {
// function to recursively compute the sum of elements in arr that are divisible by k
public static void solve(int arr[], int k, int i, int[] ans) {
if (i < 0) { // base case to stop recursion
return;
}
if (arr[i] % k == 0) { // current element is divisible by k
ans[0] += arr[i]; // add current element to the sum
}
solve(arr, k, i - 1, ans); // recursively call the function with the previous index
}
public static void main(String[] args) {
int n = 6;
int arr[] = {2, 6, 7, 12, 14, 18};
int k = 2;
int[] sum = new int[1]; // store the sum in an array to avoid pass-by-value
solve(arr, k, n - 1, sum);
System.out.print(sum[0] + " ");
}
}
def solve(arr, k, i, ans):
# Base case to stop recursion
if i < 0:
return
# If the current element is divisible by k, add it to the sum
if arr[i] % k == 0:
ans[0] += arr[i]
# Recursively call the function with the previous index
solve(arr, k, i - 1, ans)
# Main function
if __name__ == '__main__':
n = 6
arr = [2, 6, 7, 12, 14, 18]
k = 2
# Store the sum in an array to avoid pass-by-value
sum_arr = [0]
# Call the recursive function
solve(arr, k, n - 1, sum_arr)
# Print the sum
print(sum_arr[0], end=' ')
using System;
public class Program
{
public static void Solve(int[] arr, int k, int i, ref int ans)
{
if (i < 0) // boundry condition to stop the recursion
return;
if (arr[i] % k == 0) // current element is divisible
{
// so add that element to our ans
ans += arr[i];
}
Solve(arr, k, i - 1, ref ans); // further iterate array using recursion
}
public static void Main()
{
int n = 6;
int[] arr = { 2, 6, 7, 12, 14, 18 };
int k = 2;
int sum = 0;
Solve(arr, k, n - 1, ref sum);
Console.WriteLine(sum);
}
}
function solve(arr, k, i, ans) {
// Base case to stop recursion
if (i < 0) {
return;
}
// If the current element is divisible by k, add it to the sum
if (arr[i] % k === 0) {
ans[0] += arr[i];
}
// Recursively call the function with the previous index
solve(arr, k, i - 1, ans);
}
// Main function
const n = 6;
const arr = [2, 6, 7, 12, 14, 18];
const k = 2;
// Store the sum in an array to avoid pass-by-value
const sum_arr = [0];
// Call the recursive function
solve(arr, k, n - 1, sum_arr);
// Print the sum
console.log(sum_arr[0]);
Method 2 : (Pass By Value)
Implementation :
- Take a sum variable and only pass its value into the function solve.
- Function will return int value and we use that value to find our ans.
- If number is divisible by K then return the number ( arr[i] ) and if not divisible then return 0.
C++
#include <iostream>
using namespace std;
int solve(int arr[], int k, int i)
{ // returning the sum of elements divisible by k
if (i < 0) {
return 0;
}
if (arr[i] % k == 0) {
return arr[i]
+ solve(arr, k,
i - 1); // add current element and
// further call the recursion
}
else {
return 0
+ solve(arr, k,
i - 1); // nothing to add so just
// call the futher recursion
}
}
int main()
{
int n = 6;
int arr[n] = { 2, 6, 7, 12, 14, 18 };
int k = 2;
int sum = solve(arr, k, n - 1);
cout << sum << " ";
return 0;
}
// this code is contributed by bhardwajji
/*package whatever //do not write package name here */
import java.util.*;
public class Main {
// Function to calculate the sum of array elements that
// are divisible by k
static int solve(int[] arr, int k, int i)
{
// Base case: If the index is less than zero, return
// zero
if (i < 0) {
return 0;
}
// If the current element is divisible by k, add it
// to the sum and call the function recursively
if (arr[i] % k == 0) {
return arr[i] + solve(arr, k, i - 1);
}
// If the current element is not divisible by k,
// just call the function recursively without adding
// anything
else {
return 0 + solve(arr, k, i - 1);
}
}
// Main function
public static void main(String[] args)
{
int n = 6;
int[] arr = { 2, 6, 7, 12, 14, 18 };
int k = 2;
// Calculate the sum of array elements that are
// divisible by k
int sum = solve(arr, k, n - 1);
// Print the sum
System.out.println(sum);
}
}
# This function returns the sum of elements divisible by k
def solve(arr, k, i):
if i < 0:
return 0
if arr[i] % k == 0:
# add current element and further call the recursion
return arr[i] + solve(arr, k, i - 1)
else:
# nothing to add so just call the further recursion
return 0 + solve(arr, k, i - 1)
n = 6
arr = [2, 6, 7, 12, 14, 18]
k = 2
sum = solve(arr, k, n - 1)
print(sum)
using System;
public class MainClass {
public static int Solve(int[] arr, int k, int i)
{
// returning the sum of elements divisible by k
if (i < 0) {
return 0;
}
if (arr[i] % k == 0) {
// add current element and further call the
// recursion
return arr[i] + Solve(arr, k, i - 1);
}
else {
// nothing to add so just call the futher
// recursion
return 0 + Solve(arr, k, i - 1);
}
}
public static void Main()
{
int n = 6;
int[] arr = { 2, 6, 7, 12, 14, 18 };
int k = 2;
int sum = Solve(arr, k, n - 1);
Console.WriteLine(sum);
}
}
// JavaScript program to find the sum of array elements
// divisible by a given number k
function solve(arr, k, i) {
// returning the sum of elements divisible by k
if (i < 0) {
return 0;
}
if (arr[i] % k == 0) {
return (
arr[i] +
solve(arr, k, i - 1) // add current element and further call the recursion
);
} else {
return 0 + solve(arr, k, i - 1); // nothing to add so just call the further recursion
}
}
// Driver code
const arr = [2, 6, 7, 12, 14, 18];
const k = 2;
const sum = solve(arr, k, arr.length - 1);
console.log(sum);
Complexity Analysis:
- Time Complexity: O(n)
- Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem