42 lines
747 B
Markdown
42 lines
747 B
Markdown
# Leetcode Single-Number
|
||
|
||
#### 2022-07-22 15:31
|
||
|
||
> ##### Algorithms:
|
||
> #algorithm #bit_manipulation
|
||
> ##### Data structures:
|
||
> #DS #bitset
|
||
> ##### Difficulty:
|
||
> #coding_problem #difficulty-easy
|
||
> ##### Additional tags:
|
||
> #leetcode
|
||
> ##### Revisions:
|
||
> N/A
|
||
|
||
##### Related topics:
|
||
```expander
|
||
tag:#bit_manipulation
|
||
```
|
||
|
||
|
||
|
||
##### Links:
|
||
- [Link to problem](https://leetcode.com/problems/single-number/)
|
||
___
|
||
### Problem
|
||
|
||
Given a **non-empty** array of integers `nums`, every element appears _twice_ except for one. Find that single one.
|
||
|
||
You must implement a solution with a linear runtime complexity and use only constant extra space.
|
||
|
||
#### Examples
|
||
|
||
#### Constraints
|
||
|
||
### Thoughts
|
||
|
||
> [!summary]
|
||
> This is a #template_remove_me
|
||
|
||
### Solution
|