Find the number occurring odd number of times in an array

If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions.

In this post, we will see how to find number occurring odd number of times in the array.

Problem:

You are given a array of integer. All numbers occur even number of times except one. You need to find the number which occurs odd number of time. You need to solve it with o(n) time complexity and o(1) space complexity.
For example:

Solution:

Solution 1: Use two for loops and compare elements:

This is brute force solution for this problem but it takes o(n*n) time complexity.

Solution 2 : Use Hashing

You can use key as number and count as value and whenever key is repeated , you can increment counter by 1.

but above solution takes o(n) of space complexity.

Solution 3: Use XOR operation:

You can do bitwise XOR operation for all elements  and it will give you element which occurs odd number of times in the end.

Above algorithms solves the problem with O(n) time complexity and o(1) space complexity and this is best solution for above program.

Java program to find the number occurring odd number of times in an array:

When you run above program, you will get below output:


import_contacts

You may also like:

Related Posts

  • 28 March

    Sort an array of 0s, 1s and 2s

    If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see how to sort an array of 0s, 1s and 2s.We have already seen a post on sort 0s and 1s in an array. Problem Given an array containing zeroes, […]

  • 04 March

    Check if it is possible to reach end of given Array by Jumping

    If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs.   Problem Given an array with positive integers as elements indicating the maximum length of a jump which can be made from any position in the array. Check if it is possible to have […]

  • 17 February

    Check if Array Elements are Consecutive

    If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see how to check if array elements are consecutive. Problem Given an array, we need to check if array contains consecutive elements. For example: Input: array[] = {5, 3, 4, […]

  • 01 November

    Find the local minima in array

    If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see how to find the local minima in the array. Problem An element is local minima if it is less than its neighbors. int [] arr = {10, 5, 3, […]

  • 22 October

    Sliding Window Maximum in java

    In this post, we will see about Sliding Window Maximum in java Problem Given an Array of integers and an Integer k, Find the maximum element of from all the contiguous subarrays of size K. For eg : Input : int[] arr = {2,6,-1,2,4,1,-6,5} int k = 3 output : 6,6,4,4,4,5 for every subarray of […]

  • 20 October

    Count number of occurrences (or frequency) of each element in a sorted array

    If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see how to count number of occurrences (or frequency) of each element in a sorted array Problem Given a Sorted Array of integers containing duplicates. Find the frequency of every […]

Leave a Reply

Your email address will not be published. Required fields are marked *

Subscribe to our newletter

Get quality tutorials to your inbox. Subscribe now.