Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Sum of all odd frequency elements in an array

  • Difficulty Level : Basic
  • Last Updated : 16 Nov, 2021

Given an array of integers containing duplicate elements. The task is to find the sum of all odd occurring elements in the given array. That is the sum of all such elements whose frequency is odd in the array.

Examples: 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Input : arr[] = {1, 1, 2, 2, 3, 3, 3}
Output : 9
The odd occurring element is 3, and it's number
of occurrence is 3. Therefore sum of all 3's in the 
array = 9.

Input : arr[] = {10, 20, 30, 40, 40}
Output : 60
Elements with odd frequency are 10, 20 and 30.
Sum = 60.

Approach:  



  • Traverse the array and use a map in C++ to store the frequency of elements of the array such that the key of map is the array element and value is its frequency in the array.
  • Then, traverse the map to find the frequency of elements and check if it is odd, if it is odd, then add this element to sum.

Below is the implementation of the above approach: 

C++




// CPP program to find the sum of all odd
// occurring elements in an array
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to find the sum of all odd
// occurring elements in an array
int findSum(int arr[], int N)
{
    // Store frequencies of elements
    // of the array
    unordered_map<int, int> mp;
    for (int i = 0; i < N; i++)
        mp[arr[i]]++;
 
    // variable to store sum of all
    // odd occurring elements
    int sum = 0;
 
    // loop to iterate through map
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
 
        // check if frequency is odd
        if (itr->second % 2 != 0)
            sum += (itr->first) * (itr->second);
    }
 
    return sum;
}
 
// Driver Code
int main()
{
    int arr[] = { 10, 20, 20, 10, 40, 40, 10 };
 
    int N = sizeof(arr) / sizeof(arr[0]);
 
    cout << findSum(arr, N);
 
    return 0;
}
Java



// Java program to find the sum of all odd
// occurring elements in an array
import java.util.*;
 
class GFG
{
 
// Function to find the sum of all odd
// occurring elements in an array
static int findSum(int arr[], int N)
{
    // Store frequencies of elements
    // of the array
    Map<Integer,Integer> mp = new HashMap<>();
    for (int i = 0; i < N; i++)
        mp.put(arr[i],mp.get(arr[i])==null?1:mp.get(arr[i])+1);
 
    // variable to store sum of all
    // odd occurring elements
    int sum = 0;
 
    // loop to iterate through map
    for (Map.Entry<Integer,Integer> entry : mp.entrySet())
    {
 
        // check if frequency is odd
        if (entry.getValue() % 2 != 0)
            sum += (entry.getKey()) * (entry.getValue());
    }
 
    return sum;
}
 
// Driver Code
public static void main(String args[])
{
    int arr[] = { 10, 20, 20, 10, 40, 40, 10 };
 
    int N = arr.length;
 
    System.out.println(findSum(arr, N));
}
}
 
/* This code is contributed by PrinciRaj1992 */
Python3



# Function to find sum of all odd
# occurring elements in an array
import collections
 
def findsum(arr, N):
     
    # Store frequencies of elements
    # of an array in dictionary
    mp = collections.defaultdict(int)
     
    for i in range(N):
        mp[arr[i]] += 1
     
    # Variable to store sum of all
    # odd occurring elements
    sum = 0
     
    # loop to iterate through dictionary
    for i in mp:
         
        # Check if frequency is odd
        if (mp[i] % 2 != 0):
            sum += (i * mp[i])
    return sum
     
# Driver Code
arr = [ 10, 20, 20, 10, 40, 40, 10 ]
 
N = len(arr)
 
print (findsum(arr, N))
             
# This cde is contributed
# by HardeepSingh.            
C#



// C# program to find the sum of all odd
// occurring elements in an array
using System;
using System.Collections.Generic;
 
class GFG
{
    // Function to find the sum of all odd
    // occurring elements in an array
    public static int findSum(int[] arr, int N)
    {
 
        // Store frequencies of elements
        // of the array
        Dictionary<int,
                   int> mp = new Dictionary<int,       
                                            int>();
        for (int i = 0; i < N; i++)
        {
            if (mp.ContainsKey(arr[i]))
                mp[arr[i]]++;
            else
                mp.Add(arr[i], 1);
        }
 
        // variable to store sum of all
        // odd occurring elements
        int sum = 0;
 
        // loop to iterate through map
        foreach (KeyValuePair<int,
                              int> entry in mp)
        {
 
            // check if frequency is odd
            if (entry.Value % 2 != 0)
                sum += entry.Key * entry.Value;
        }
 
        return sum;
    }
 
    // Driver code
    public static void Main(String[] args)
    {
        int[] arr = { 10, 20, 20, 10, 40, 40, 10 };
        int n = arr.Length;
        Console.WriteLine(findSum(arr, n));
    }
}
 
// This code is contributed by
// sanjeev2552
Javascript



<script>
// Javascript program to find the sum of all odd
// occurring elements in an array
 
// Function to find the sum of all odd
// occurring elements in an array
function findSum(arr, N)
{
 
    // Store frequencies of elements
    // of the array
    let mp = new Map();
    for (let i = 0; i < N; i++) {
        if (mp.has(arr[i])) {
            mp.set(arr[i], mp.get(arr[i]) + 1)
        } else {
            mp.set(arr[i], 1)
        }
    }
 
    // variable to store sum of all
    // odd occurring elements
    let sum = 0;
 
    // loop to iterate through map
    for (let itr of mp) {
 
        // check if frequency is odd
        if (itr[1] % 2 != 0)
            sum += (itr[0]) * (itr[1]);
    }
 
    return sum;
}
 
// Driver Code
let arr = [10, 20, 20, 10, 40, 40, 10];
let N = arr.length
document.write(findSum(arr, N));
 
// This code is contributed by gfgking.
</script>
Output: 
30
 
Time Complexity: O(N), where N is the number of elements in the array.
Auxiliary Space: O(N)
Method 2:Using Built in python functions:
  • Count the frequencies of every element using Counter function
  • Traverse the frequency dictionary and sum all the elements with occurrence odd frequency multiplied by its frequency.
Below is the implementation:
Python3



# Python3 implementation of the above approach
from collections import Counter
 
def sumOdd(arr, n):
 
    # Counting frequency of every
    # element using Counter
    freq = Counter(arr)
     
    # Initializing sum 0
    sum = 0
     
    # Traverse the frequency and print all
    # sum all elements with odd frequency
    # multiplied by its frequency
    for it in freq:
        if freq[it] % 2 != 0:
            sum = sum + it*freq[it]
    print(sum)
 
 
# Driver code
arr = [10, 20, 30, 40, 40]
n = len(arr)
 
sumOdd(arr, n)
 
# This code is contributed by vikkycirus
Output:
60
Time Complexity: O(N), where N is the number of elements in the array.
Auxiliary Space: O(N)



My Personal Notes
arrow_drop_up
Next

Find the Number Occurring Odd Number of Times
Recommended Articles
Page :
Make all the elements of array odd by incrementing odd-indexed elements of odd-length subarrays
16, Dec 20
Sum of all odd frequency elements in a Matrix
29, Oct 18
Delete all odd frequency elements from an Array
05, Apr 20
Absolute difference between sum of even elements at even indices & odd elements at odd indices in given Array
04, Dec 21
Maximum difference between frequency of two elements such that element having greater frequency is also greater
13, Feb 17
Sum of all odd frequency nodes of the Linked List
01, May 19
Maximum product from array such that frequency sum of all repeating elements in product is less than or equal to 2 * k
18, Feb 19
Find the Array Permutation having sum of elements at odd indices greater than sum of elements at even indices
07, Jul 21
Construct an Array of size N in which sum of odd elements is equal to sum of even elements
22, Apr 20
Bitwise XOR of elements having odd frequency
04, Oct 19
Minimum number of conversions to make the frequency of all characters odd
16, Nov 21
Generate a number such that the frequency of each digit is digit times the frequency in given number
26, Oct 18
Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
16, Nov 18
Maximum length prefix such that frequency of each character is atmost number of characters with minimum frequency
30, Mar 20
Count of Binary Strings of length N such that frequency of 1's exceeds frequency of 0's
12, Aug 20
Maximize sum of odd-indexed array elements by repeatedly selecting at most 2*M array elements from the beginning
23, May 21
Sum of all even frequency elements in Matrix
30, Oct 18
Sum of all maximum frequency elements in Matrix
31, Oct 18
Sum of all minimum frequency elements in Matrix
30, Oct 18
Rearrange sorted array such that all odd indices elements comes before all even indices element
09, Sep 21
Maximize frequency of an element by at most one increment or decrement of all array elements
08, Dec 20
Minimum removals required to make frequency of all remaining array elements equal
23, Feb 21
Maximize frequency of an element by at most one increment or decrement of all array elements | Set 2
10, Nov 21
Print indices of array elements whose removal makes the sum of odd and even-indexed elements equal
11, Dec 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
barykrg
@barykrg
Vote for difficulty
Current difficulty :
Basic





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!