theoludwig/programming-challenges
theoludwig/programming-challenges
1
1
Fork 0
mirror of https://github.com/theoludwig/programming-challenges.git synced 2024-10-29 22:17:23 +01:00
Code Issues Releases Activity

style: fix linting

Browse Source
This commit is contained in:
Théo LUDWIG 2023-08-22 00:09:38 +02:00
parent 2a98eab556
commit a081ec8faf
Signed by: theoludwig
GPG Key ID: ADFE5A563D718F3B
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
challenges/single-number/README.md
View File

@ -10,8 +10,8 @@ You must implement a solution with a linear runtime complexity and use only cons
### Constraints
- $$1 <= numbers.length <= 3 * 10^4$$
- $$-3 * 10^4 <= numbers[index] <= 3 * 10^4$$
- $$1 <= numbers.length <= 3 \times 10^4$$
- $$-3 \times 10^4 <= numbers[index] <= 3 \times 10^4$$
- Each element in the array appears twice except for one element which appears only once.
## Source