> For the complete documentation index, see [llms.txt](https://abhyas-kanaujia.gitbook.io/lb-dsa-notes-and-homework-abhyas/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://abhyas-kanaujia.gitbook.io/lb-dsa-notes-and-homework-abhyas/08-array-problems-ii/discord-homework-list/03-non-repeating-element.md).

# 03 Non-Repeating Element

{% embed url="<https://practice.geeksforgeeks.org/problems/non-repeating-element3958/1/>" %}

<details>

<summary>Question</summary>

Find the first non-repeating element in a given array **`arr`** of `N` integers.\
**Note:** Array consists of only positive and negative integers and **not zero**.

**Example 1:**

```
Input : arr[] = {-1, 2, -1, 3, 2}
Output : 3
Explanation:
-1 and 2 are repeating whereas 3 is 
the only number occurring once.
Hence, the output is 3. 
```

&#x20;

**Example 2:**

```
Input : arr[] = {1, 1, 1}
Output : 0
```

\
**Expected Time Complexity:** $$O(N)$$\
**Expected Auxiliary Space:** $$O(N)$$

**Constraints:**

$$1 <= N <= 10^7$$

$$-10^{16} <= A\_i <= 10^{16}$$​

$${A\_i \ne0 }$$​

</details>

### Using map

<details>

<summary>Logic</summary>

1. Create a map of frequencies
2. Traverse the array from left to right
   1. If the element has frequency 1 in the map then return the element
3. If no such element is found, return -1

</details>

<details>

<summary>Code</summary>

```cpp
int firstNonRepeating(int arr[], int n) 
{ 
    map<int, int> frequency;
    
    for(int i = 0; i < n; i++)
        frequency[arr[i]]++;
        
    for(int i = 0; i < n; i++)
        if(frequency[arr[i]] == 1)
            return arr[i];
            
    return -1;
} 
```

</details>

<details>

<summary>Complexity</summary>

Time Complexity: $$O(n)$$​

Space Complexity: $$O(n)$$​

</details>


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://abhyas-kanaujia.gitbook.io/lb-dsa-notes-and-homework-abhyas/08-array-problems-ii/discord-homework-list/03-non-repeating-element.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.