From 91e5b1fb93f71b1219f24061778400f32bb87672 Mon Sep 17 00:00:00 2001 From: Gonzalo Diaz Date: Mon, 15 Dec 2025 16:06:30 -0300 Subject: [PATCH 1/3] [CONFIG] [Github Actions] Now use fixed version of markdownlint --- .github/workflows/markdown-lint.yml | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/.github/workflows/markdown-lint.yml b/.github/workflows/markdown-lint.yml index e106928..fc1bde8 100644 --- a/.github/workflows/markdown-lint.yml +++ b/.github/workflows/markdown-lint.yml @@ -32,7 +32,8 @@ jobs: node-version: ${{ matrix.node-version }} - name: Install dependencies - run: npm install -g markdownlint-cli + run: > + npm install -g --ignore-scripts markdownlint-cli@0.47.0 - name: Lint run: > From 6221b4dad4458a0464418396ec86212638bdd207 Mon Sep 17 00:00:00 2001 From: Gonzalo Diaz Date: Mon, 15 Dec 2025 17:19:46 -0300 Subject: [PATCH 2/3] [CONFIG] [Docker] Now use fixed version of markdownlint --- Dockerfile | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Dockerfile b/Dockerfile index 00ac769..2298266 100644 --- a/Dockerfile +++ b/Dockerfile @@ -32,7 +32,7 @@ WORKDIR ${WORKDIR} RUN apk add --update --no-cache make nodejs npm \ && apk add --update --no-cache yamllint \ - && npm install -g --ignore-scripts markdownlint-cli + && npm install -g --ignore-scripts markdownlint-cli@0.47.0 # [!TIP] Use a bind-mount to "/app" to override following "copys" # for lint and test against "current" sources in this stage From 7da40b9f2b32d226901a35e971df480a101c95c9 Mon Sep 17 00:00:00 2001 From: Gonzalo Diaz Date: Mon, 15 Dec 2025 17:14:00 -0300 Subject: [PATCH 3/3] [lint] markdownlint fixes --- README.md | 4 ++-- .../dictionaries_and_hashmaps/ctci-ransom-note.md | 3 ++- .../greedy_algorithms/angry-children.md | 3 ++- .../greedy_algorithms/greedy-florist.md | 3 ++- docs/hackerrank/projecteuler/euler002.md | 3 ++- docs/hackerrank/projecteuler/euler003-solution-notes.md | 6 +++--- 6 files changed, 13 insertions(+), 9 deletions(-) diff --git a/README.md b/README.md index ff257d2..4aa9b05 100644 --- a/README.md +++ b/README.md @@ -80,8 +80,8 @@ You can run tests in the following ways: installed in your SO. - [Install and run with make](#install-and-run-using-make) require runtime tools and "make" installed in your SO. -- [Install and run in Docker](#install-and-running-with-docker-) require Docker and -docker-compose installed. +- [Install and run in Docker](#install-and-running-with-docker-) require Docker +and docker-compose installed. - (⭐️) [Install and in Docker with make](#install-and-running-with-docker--using-make) require docker-compose and make installed. diff --git a/docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci-ransom-note.md b/docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci-ransom-note.md index 1e9df62..6c31572 100644 --- a/docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci-ransom-note.md +++ b/docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci-ransom-note.md @@ -49,7 +49,8 @@ The third line contains `n` space-separated strings, each `node[i]`. - $ 1 \leq m, n \leq 30000 $ - $ 1 \leq $ length of `magazine[i]` and `note[i]` $ \leq 5 $ -- Each word consists of English alphabetic letters (i.e., `a` to `z` and `A` to `Z`). +- Each word consists of English alphabetic letters (i.e., `a` + to `z` and `A` to `Z`). ## Sample Input 0 diff --git a/docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md b/docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md index 1177d8e..c5fe498 100644 --- a/docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md +++ b/docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md @@ -140,4 +140,5 @@ max(1,2,3,4) - min(1,2,3,4) = 4 - 1 = 3 ## Explanation 2 -Here `k = 2`. `arr' = [2, 2]` or `arr' = [1, 1]` give the minimum unfairness of `0`. +Here `k = 2`. `arr' = [2, 2]` or `arr' = [1, 1]` give the minimum +unfairness of `0`. diff --git a/docs/hackerrank/interview_preparation_kit/greedy_algorithms/greedy-florist.md b/docs/hackerrank/interview_preparation_kit/greedy_algorithms/greedy-florist.md index 4cbf097..b64b8ad 100644 --- a/docs/hackerrank/interview_preparation_kit/greedy_algorithms/greedy-florist.md +++ b/docs/hackerrank/interview_preparation_kit/greedy_algorithms/greedy-florist.md @@ -74,7 +74,8 @@ the original price of each flower. ## Explanation 0 -There are `n = 3` flowers with costs `c = [2, 5, ,6]` and `k = 3` people in the group. +There are `n = 3` flowers with costs `c = [2, 5, ,6]` and `k = 3` people +in the group. If each person buys one flower, the total cost of prices paid is `2 + 5 + 6 = 13` dollars. Thus, we print `13` as our answer. diff --git a/docs/hackerrank/projecteuler/euler002.md b/docs/hackerrank/projecteuler/euler002.md index 27c7fb0..a375c7d 100644 --- a/docs/hackerrank/projecteuler/euler002.md +++ b/docs/hackerrank/projecteuler/euler002.md @@ -3,7 +3,8 @@ - Difficulty: #easy - Category: #ProjectEuler+ -Each new term in the Fibonacci sequence is generated by adding the previous two terms. +Each new term in the Fibonacci sequence is generated by adding the previous +two terms. By starting with $ 1 $ and $ 2 $, the first $ 10 $ terms will be: $$ 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 $$ diff --git a/docs/hackerrank/projecteuler/euler003-solution-notes.md b/docs/hackerrank/projecteuler/euler003-solution-notes.md index 24828ec..3a2dfc4 100644 --- a/docs/hackerrank/projecteuler/euler003-solution-notes.md +++ b/docs/hackerrank/projecteuler/euler003-solution-notes.md @@ -33,9 +33,9 @@ The first solution, using the algorithm taught in school, is: > Using some test entries, quickly broke the solution at all. So, don't use it. > This note is just to record the failed idea. -Since by going through and proving the divisibility of a number $ i $ up to $ n $ -there are also "remainder" numbers that are also divisible by their opposite, -let's call it $ j $. +Since by going through and proving the divisibility of a number $ i $ up to +$ n $ there are also "remainder" numbers that are also divisible by their +opposite, let's call it $ j $. At first it seemed attractive to test numbers $ i $ up to half of $ n $ then test whether $ i $ or $ j $ are prime. 2 problems arise: