Skip to content

Tutorials
- Practice DS & Algo.
  - DSA Topic-wise
  - DSA Company-wise
- Algorithms
- Data Structures
- Interview Corner
- Languages
  - C
  - C++
  - Java
  - Python
  - C#
  - JavaScript
  - jQuery
  - SQL
  - PHP
  - Scala
  - Perl
  - Go Language
  - HTML
  - CSS
  - Kotlin
- ISRO CS
- GATE
- CS Subjects
- Web Technologies
- School Learning
  - School Programming
  - Mathematics
  - Maths Notes (Class 8-11)
  - NCERT Solutions
  - RD Sharma Solutions
- UGC NET CS
Student
Jobs
- Apply for Jobs
- Post a Job
Courses

Write
Come write articles for us and get featured
Practice
Learn and code with the best industry experts
Premium
Get access to ad-free content, doubt assistance and more!
Jobs
Come and find your dream job with us

Related Articles

Related Articles

Find the two repeating elements in a given array

Difficulty Level : Medium
Last Updated : 22 Jun, 2021

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.

My Personal Notes

Find duplicates in O(n) time and O(1) extra space | Set 1

Duplicates in an array in O(n) and by using O(1) extra space | Set-2

Recommended Articles

Page :

Find the two non-repeating elements in an array of repeating elements/ Unique Numbers 2

Find sum of non-repeating (distinct) elements in an array

Find any one of the multiple repeating elements in read only array

Find any one of the multiple repeating elements in read only array | Set 2

Non-Repeating Elements of a given array using Multithreaded program

Count all distinct pairs of repeating elements from the array for every array element

Find the only non-repeating element in a given array

Maximum subarray sum in array formed by repeating the given array k times

Sum of all elements repeating 'k' times in an array

Product of non-repeating (distinct) elements in an Array

Maximum product from array such that frequency sum of all repeating elements in product is less than or equal to 2 * k

Split array into subarrays at minimum cost by minimizing count of repeating elements in each subarray

Count Non-Repeating array elements after inserting absolute difference between all possible pairs

Highest powers of 2 not exceeding non-repeating array elements

Nearest power of 2 of nearest perfect squares of non-repeating array elements

Given a string, find its first non-repeating character

Find the first repeating element in an array of integers

Find the only repeating element in a sorted array of size n

Find the repeating element in an Array of size N consisting of first M natural numbers

Minimize total cost without repeating same task in two consecutive iterations

Replace repeating elements with greater that greatest values

Find the maximum repeating number in O(n) time and O(1) extra space

Find the repeating and the missing | Added 3 new methods

Strings formed from given characters without any consecutive repeating characters

Article Contributed By :

Vote for difficulty

Current difficulty : Medium

Improved By :

Article Tags :

Practice Tags :

Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.