From 142dc9d1ddeb658c1f0323830e70d281d9ed5e2e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Th=C3=A9o=20LUDWIG?= <contact@theoludwig.fr>
Date: Sun, 27 Aug 2023 15:09:31 +0200
Subject: [PATCH] docs(challenges): improvements to Constraints LaTeX/KaTeX
 syntax

---
 challenges/cakes-swerc-2020-2021/README.md | 2 +-
 challenges/offset-arrays/README.md         | 2 +-
 challenges/single-number/README.md         | 4 ++--
 challenges/sorting-algorithms/README.md    | 6 +++---
 4 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/challenges/cakes-swerc-2020-2021/README.md b/challenges/cakes-swerc-2020-2021/README.md
index 3e4b110..fa407fa 100644
--- a/challenges/cakes-swerc-2020-2021/README.md
+++ b/challenges/cakes-swerc-2020-2021/README.md
@@ -27,7 +27,7 @@ available ingredients.
 
 ### Constraints
 
-- $$1 <= N <= 10$$
+- $$1 \leq N \leq 10$$
 - All ingredient quantities will be integers between 1 and 10 000.
 
 ## Source
diff --git a/challenges/offset-arrays/README.md b/challenges/offset-arrays/README.md
index 57b1b4c..7ab2d3e 100644
--- a/challenges/offset-arrays/README.md
+++ b/challenges/offset-arrays/README.md
@@ -24,7 +24,7 @@ You are given a list of `n` array definitions and your job is to figure out what
 
 ### Constraints
 
-- $$1 <= n <= 100$$
+- $$1 \leq n \leq 100$$
 - Array names consist only of uppercase letters A to Z.
 - Array lengths are between 1 and 100 (no empty arrays).
 - Indexing operations have at most 50 levels of nesting.
diff --git a/challenges/single-number/README.md b/challenges/single-number/README.md
index bc10244..e206c39 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 \times 10^4$$
-- $$-3 \times 10^4 <= numbers[index] <= 3 \times 10^4$$
+- $$1 \leq numbers.length \leq 3 \times 10^4$$
+- $$-3 \times 10^4 \leq numbers[index] \leq 3 \times 10^4$$
 - Each element in the array appears twice except for one element which appears only once.
 
 ## Source
diff --git a/challenges/sorting-algorithms/README.md b/challenges/sorting-algorithms/README.md
index 472cecf..4dad7ed 100644
--- a/challenges/sorting-algorithms/README.md
+++ b/challenges/sorting-algorithms/README.md
@@ -11,12 +11,12 @@ Write a function that takes a list of integers and sort them in ascending order.
 
 ## Input
 
-- **Line 1:** An integer `n` for the length of the list of integers
-- **`n` next lines:** the numbers to sort
+- **Line 1:** An integer $n$ for the length of the list of integers
+- **$n$ next lines:** the numbers to sort
 
 ### Constraints
 
-- List of integers length <= 25 000
+- $$n \leq 25 000$$
 
 ## Source