Sum of array elements which are multiples of a given number Last Updated : 11 Aug, 2022 Comments Improve Suggest changes Like Article Like Report Given an array arr[] consisting of positive integers and an integer N, the task is to find the sum of all array elements which are multiples of N Examples: Input: arr[] = {1, 2, 3, 5, 6}, N = 3Output: 9Explanation: From the given array, 3 and 6 are multiples of 3. Therefore, sum = 3 + 6 = 9. Input: arr[] = {1, 2, 3, 5, 7, 11, 13}, N = 5Output: 5 Approach: The idea is to traverse the array and for each array element, check if it is a multiple of N or not and add those elements. Follow the steps below to solve the problem: Initialize a variable, say sum, to store the required sum.Traverse the given array and for each array element, perform the following operations.Check whether the array element is a multiple of N or not.If the element is a multiple of N, then add the element to sum.Finally, print the value of sum. Below is the implementation of the above approach: C++ // C++ program for the above approach #include <bits/stdc++.h> using namespace std; // Function to find the sum of array // elements which are multiples of N void mulsum(int arr[], int n, int N) { // Stores the sum int sum = 0; // Traverse the given array for (int i = 0; i < n; i++) { // If current element // is a multiple of N if (arr[i] % N == 0) { sum = sum + arr[i]; } } // Print total sum cout << sum; } // Driver Code int main() { // Given arr[] int arr[] = { 1, 2, 3, 5, 6 }; int n = sizeof(arr) / sizeof(arr[0]); int N = 3; mulsum(arr, n, N); return 0; } Java // Java program for the above approach import java.io.*; import java.util.*; class GFG{ // Function to find the sum of array // elements which are multiples of N static void mulsum(int arr[], int n, int N) { // Stores the sum int sum = 0; // Traverse the given array for (int i = 0; i < n; i++) { // If current element // is a multiple of N if (arr[i] % N == 0) { sum = sum + arr[i]; } } // Print total sum System.out.println(sum); } // Driver Code public static void main(String[] args) { // Given arr[] int arr[] = { 1, 2, 3, 5, 6 }; int n = arr.length; int N = 3; mulsum(arr, n, N); } } // This code is contributed by jana_sayantan. Python # Python3 program for the above approach # Function to find the sum of array # elements which are multiples of N def mulsum(arr, n, N): # Stores the sum sums = 0 # Traverse the array for i in range(0, n): if arr[i] % N == 0: sums = sums + arr[i] # Print total sum print(sums) # Driver Code if __name__ == "__main__": # Given arr[] arr = [ 1, 2, 3, 5, 6 ] n = len(arr) N = 3 # Function call mulsum(arr, n, N) C# // C# program for the above approach using System; public class GFG { // Function to find the sum of array // elements which are multiples of N static void mulsum(int[] arr, int n, int N) { // Stores the sum int sum = 0; // Traverse the given array for (int i = 0; i < n; i++) { // If current element // is a multiple of N if (arr[i] % N == 0) { sum = sum + arr[i]; } } // Print total sum Console.Write(sum); } // Driver Code static public void Main () { // Given arr[] int[] arr = { 1, 2, 3, 5, 6 }; int n = arr.Length; int N = 3; mulsum(arr, n, N); } } // This code is contributed by Dharanendra L V. JavaScript <script> // JavaScript program for the above approach // Function to find the sum of array // elements which are multiples of N function mulsum(arr, n, N) { // Stores the sum var sum = 0; // Traverse the given array for(var i = 0; i < n; i++) { // If current element // is a multiple of N if (arr[i] % N == 0) { sum = sum + arr[i]; } } // Print total sum document.write(sum); } // Driver Code // Given arr[] var arr = [ 1, 2, 3, 5, 6 ]; var n = arr.length; var N = 3; mulsum(arr, n, N); // This code is contributed by rdtank </script> Output: 9 Time Complexity: O(N) since one traversal of the array is required to complete all operations hence the overall time required by the algorithm is linearAuxiliary Space: O(1) since no extra array is used so the space taken by the algorithm is constant Comment More infoAdvertise with us Next Article Sum of array elements which are multiples of a given number T thotasravya28 Follow Improve Article Tags : Searching Mathematical Technical Scripter DSA Arrays Technical Scripter 2020 divisibility +3 More Practice Tags : ArraysMathematicalSearching Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example 12 min read Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an 8 min read Like