From a081ec8faf8d2ef41630dae30a01c0b34346e565 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Th=C3=A9o=20LUDWIG?= Date: Tue, 22 Aug 2023 00:09:38 +0200 Subject: [PATCH] style: fix linting --- challenges/single-number/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/challenges/single-number/README.md b/challenges/single-number/README.md index 756c3de..bc10244 100644 --- a/challenges/single-number/README.md +++ b/challenges/single-number/README.md @@ -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