Python BasicsEasy

Finding Non Repeating elements in an Array

Detailed guide and Python implementation for the 'Finding Non Repeating elements in an Array' problem.

Problem Statement

Easy

Write a function find_non_repeating(arr) that takes a list of integers arr and returns a sorted list of all elements that appear exactly once in the array. If no such element exists, return an empty list.

Constraints
  • 0 <= len(arr) <= 10^5
  • -10^6 <= arr[i] <= 10^6

Examples

Example 1
Input
arr = [1, 2, 3, 2, 4, 3]
Output
[1, 4]
Explanation

1 appears once and 4 appears once. 2 and 3 each appear twice.

Example 2
Input
arr = [5, 5, 5]
Output
[]
Explanation

5 appears 3 times. No element appears exactly once.

Example 3
Input
arr = [7, 8, 9]
Output
[7, 8, 9]
Explanation

All elements appear exactly once.

Need a Hint?
Consider using Arrays-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.