From 6e27235fb75298833448ba1b23e5178f7eea2290 Mon Sep 17 00:00:00 2001
From: Christian Clauss <cclauss@me.com>
Date: Sun, 5 May 2024 21:22:35 +0200
Subject: [PATCH 01/12] Keep GitHub Actions up to date with GitHub's Dependabot

Fixes software supply chain safety warnings like at the bottom right of
https://github.com/TheAlgorithms/JavaScript/actions/runs/8960545794

* [Keeping your actions up to date with Dependabot](https://docs.github.com/en/code-security/dependabot/working-with-dependabot/keeping-your-actions-up-to-date-with-dependabot)
* [Configuration options for the dependabot.yml file - package-ecosystem](https://docs.github.com/en/code-security/dependabot/dependabot-version-updates/configuration-options-for-the-dependabot.yml-file#package-ecosystem)
---
 .github/dependabot.yml | 8 ++++++++
 1 file changed, 8 insertions(+)
 create mode 100644 .github/dependabot.yml

diff --git a/.github/dependabot.yml b/.github/dependabot.yml
new file mode 100644
index 0000000000..15e494ec86
--- /dev/null
+++ b/.github/dependabot.yml
@@ -0,0 +1,8 @@
+# Keep GitHub Actions up to date with Dependabot...
+# https://docs.github.com/en/code-security/dependabot/working-with-dependabot/keeping-your-actions-up-to-date-with-dependabot
+version: 2
+updates:
+  - package-ecosystem: "github-actions"
+    directory: "/"
+    schedule:
+      interval: "daily"

From 6bb02af09b6d1de02a047b5c4608d2d101984911 Mon Sep 17 00:00:00 2001
From: cclauss <cclauss@users.noreply.github.com>
Date: Sun, 5 May 2024 19:22:50 +0000
Subject: [PATCH 02/12] Updated Documentation in README.md

---
 DIRECTORY.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/DIRECTORY.md b/DIRECTORY.md
index 59f6273bf2..6c1fa7aeb8 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -397,6 +397,7 @@
 * **Timing-Functions**
   * [GetMonthDays](Timing-Functions/GetMonthDays.js)
   * [IntervalTimer](Timing-Functions/IntervalTimer.js)
+  * [ParseDate](Timing-Functions/ParseDate.js)
 * **Trees**
   * [BreadthFirstTreeTraversal](Trees/BreadthFirstTreeTraversal.js)
   * [DepthFirstSearch](Trees/DepthFirstSearch.js)

From cc1e1dc643074f1489aa6ef5a8b7a02d01c7c7f1 Mon Sep 17 00:00:00 2001
From: Christian Clauss <cclauss@me.com>
Date: Fri, 17 May 2024 17:28:38 +0200
Subject: [PATCH 03/12] GitHub Actions: Test on the current version of Node.js
 (#1657)

---
 .github/workflows/Ci.yml                   | 2 +-
 .github/workflows/UpdateDirectory.yml      | 2 +-
 .github/workflows/UploadCoverageReport.yml | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/.github/workflows/Ci.yml b/.github/workflows/Ci.yml
index 571b8a0fa8..99e8f7831f 100644
--- a/.github/workflows/Ci.yml
+++ b/.github/workflows/Ci.yml
@@ -15,7 +15,7 @@ jobs:
 
       - uses: actions/setup-node@v4
         with:
-          node-version: 20
+          node-version: 22
           cache: npm
 
       - name: 📦 Install dependencies
diff --git a/.github/workflows/UpdateDirectory.yml b/.github/workflows/UpdateDirectory.yml
index cb649e1c8b..437ab55b91 100644
--- a/.github/workflows/UpdateDirectory.yml
+++ b/.github/workflows/UpdateDirectory.yml
@@ -14,7 +14,7 @@ jobs:
 
       - uses: actions/setup-node@v4
         with:
-          node-version: 20
+          node-version: 22
           cache: npm
 
       - name: 📦 Install dependencies
diff --git a/.github/workflows/UploadCoverageReport.yml b/.github/workflows/UploadCoverageReport.yml
index 4dcad584bf..eee9d4aec9 100644
--- a/.github/workflows/UploadCoverageReport.yml
+++ b/.github/workflows/UploadCoverageReport.yml
@@ -16,7 +16,7 @@ jobs:
 
       - uses: actions/setup-node@v4
         with:
-          node-version: 20
+          node-version: 22
           cache: npm
 
       - name: Install dependencies

From e2b975486234d07bd732bf290fce8cb28144a814 Mon Sep 17 00:00:00 2001
From: Piotr Idzik <65706193+vil02@users.noreply.github.com>
Date: Thu, 23 May 2024 19:45:08 +0200
Subject: [PATCH 04/12] tests: add tests of `LongestIncreasingSubsequence`
 (#1660)

---
 .../LongestIncreasingSubsequence.js           |  3 +++
 .../LongestIncreasingSubsequence.test.js      | 24 +++++++++++++++++++
 2 files changed, 27 insertions(+)
 create mode 100644 Dynamic-Programming/tests/LongestIncreasingSubsequence.test.js

diff --git a/Dynamic-Programming/LongestIncreasingSubsequence.js b/Dynamic-Programming/LongestIncreasingSubsequence.js
index b9319db586..b8e1847cd8 100644
--- a/Dynamic-Programming/LongestIncreasingSubsequence.js
+++ b/Dynamic-Programming/LongestIncreasingSubsequence.js
@@ -6,6 +6,9 @@
 // Return the length of the Longest Increasing Subsequence, given array x
 function longestIncreasingSubsequence(x) {
   const length = x.length
+  if (length == 0) {
+    return 0
+  }
   const dp = Array(length).fill(1)
 
   let res = 1
diff --git a/Dynamic-Programming/tests/LongestIncreasingSubsequence.test.js b/Dynamic-Programming/tests/LongestIncreasingSubsequence.test.js
new file mode 100644
index 0000000000..9a8024aa95
--- /dev/null
+++ b/Dynamic-Programming/tests/LongestIncreasingSubsequence.test.js
@@ -0,0 +1,24 @@
+import { longestIncreasingSubsequence } from '../LongestIncreasingSubsequence'
+
+describe('Testing longestIncreasingSubsequence', () => {
+  it.each([
+    [[], 0],
+    [[1], 1],
+    [[2, 2], 1],
+    [[3, 3, 3], 1],
+    [[4, 4, 4, 4], 1],
+    [[1, 2], 2],
+    [[1, 2, 2, 2, 2], 2],
+    [[1, 0, 2], 2],
+    [[1, 10, 2, 30], 3],
+    [[5, 8, 3, 7, 9, 1], 3],
+    [[10, 9, 2, 5, 3, 7, 101, 18], 4],
+    [[10, 10, 9, 9, 2, 2, 5, 5, 3, 3, 7, 7, 101, 101, 18, 18], 4],
+    [[0, 1, 0, 3, 2, 3], 4],
+    [[1, 1, 2, 2, 2], 2],
+    [[1, 1, 2, 2, 2, 3, 3, 3, 3], 3],
+    [[0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15], 6]
+  ])('check with %j', (input, expected) => {
+    expect(longestIncreasingSubsequence(input)).toBe(expected)
+  })
+})

From 3623e4270f98d6dd5a1fe6a05cbec3c1a0657fbb Mon Sep 17 00:00:00 2001
From: Piotr Idzik <65706193+vil02@users.noreply.github.com>
Date: Sat, 25 May 2024 13:01:13 +0200
Subject: [PATCH 05/12] tests: add `HexToDecimal.test.js` (#1662)

---
 Conversions/HexToDecimal.js           |  5 ++++-
 Conversions/test/HexToDecimal.test.js | 24 ++++++++++++++++++++++++
 2 files changed, 28 insertions(+), 1 deletion(-)
 create mode 100644 Conversions/test/HexToDecimal.test.js

diff --git a/Conversions/HexToDecimal.js b/Conversions/HexToDecimal.js
index 31ae13932f..e402421399 100644
--- a/Conversions/HexToDecimal.js
+++ b/Conversions/HexToDecimal.js
@@ -1,4 +1,7 @@
 function hexToInt(hexNum) {
+  if (!/^[0-9A-F]+$/.test(hexNum)) {
+    throw new Error('Invalid hex string.')
+  }
   const numArr = hexNum.split('') // converts number to array
   return numArr.map((item, index) => {
     switch (item) {
@@ -29,4 +32,4 @@ function hexToDecimal(hexNum) {
   }, 0)
 }
 
-export { hexToInt, hexToDecimal }
+export { hexToDecimal }
diff --git a/Conversions/test/HexToDecimal.test.js b/Conversions/test/HexToDecimal.test.js
new file mode 100644
index 0000000000..816c70511d
--- /dev/null
+++ b/Conversions/test/HexToDecimal.test.js
@@ -0,0 +1,24 @@
+import { hexToDecimal } from '../HexToDecimal'
+
+describe('Testing HexToDecimal', () => {
+  it.each([
+    ['0', 0],
+    ['1', 1],
+    ['A', 10],
+    ['B', 11],
+    ['C', 12],
+    ['D', 13],
+    ['E', 14],
+    ['F', 15],
+    ['10', 16],
+    ['859', 2137],
+    ['4D2', 1234],
+    ['81323ABD92', 554893491602]
+  ])('check with %s', (hexStr, expected) => {
+    expect(hexToDecimal(hexStr)).toBe(expected)
+  })
+
+  it.each(['a', '-1', 'G', ''])('throws for %s', (hexStr) => {
+    expect(() => hexToDecimal(hexStr)).toThrowError()
+  })
+})

From 1554ba5f9c1bade3e52733a2bf67017b073fbe75 Mon Sep 17 00:00:00 2001
From: Piotr Idzik <65706193+vil02@users.noreply.github.com>
Date: Sat, 25 May 2024 13:01:54 +0200
Subject: [PATCH 06/12] test: add tests for `NumberOfSubsetEqualToGivenSum`
 (#1661)

---
 .../NumberOfSubsetEqualToGivenSum.js          | 15 +++++------
 .../NumberOfSubsetEqualToGivenSum.test.js     | 25 +++++++++++++++++++
 2 files changed, 33 insertions(+), 7 deletions(-)
 create mode 100644 Dynamic-Programming/tests/NumberOfSubsetEqualToGivenSum.test.js

diff --git a/Dynamic-Programming/NumberOfSubsetEqualToGivenSum.js b/Dynamic-Programming/NumberOfSubsetEqualToGivenSum.js
index 48905c39e2..fd8e70c4d6 100644
--- a/Dynamic-Programming/NumberOfSubsetEqualToGivenSum.js
+++ b/Dynamic-Programming/NumberOfSubsetEqualToGivenSum.js
@@ -1,5 +1,5 @@
 /*
-Given an array of non-negative integers and a value sum,
+Given an array of positive integers and a value sum,
 determine the total number of the subset with sum
 equal to the given sum.
 */
@@ -7,6 +7,13 @@ equal to the given sum.
   Given solution is O(n*sum) Time complexity and O(sum) Space complexity
 */
 function NumberOfSubsetSum(array, sum) {
+  if (sum < 0) {
+    throw new Error('The sum must be non-negative.')
+  }
+
+  if (!array.every((num) => num > 0)) {
+    throw new Error('All of the inputs of the array must be positive.')
+  }
   const dp = [] // create an dp array where dp[i] denote number of subset with sum equal to i
   for (let i = 1; i <= sum; i++) {
     dp[i] = 0
@@ -23,10 +30,4 @@ function NumberOfSubsetSum(array, sum) {
   return dp[sum]
 }
 
-// example
-
-// const array = [1, 1, 2, 2, 3, 1, 1]
-// const sum = 4
-// const result = NumberOfSubsetSum(array, sum)
-
 export { NumberOfSubsetSum }
diff --git a/Dynamic-Programming/tests/NumberOfSubsetEqualToGivenSum.test.js b/Dynamic-Programming/tests/NumberOfSubsetEqualToGivenSum.test.js
new file mode 100644
index 0000000000..23eed33ebe
--- /dev/null
+++ b/Dynamic-Programming/tests/NumberOfSubsetEqualToGivenSum.test.js
@@ -0,0 +1,25 @@
+import { NumberOfSubsetSum } from '../NumberOfSubsetEqualToGivenSum'
+
+describe('Testing NumberOfSubsetSum', () => {
+  it.each([
+    [[], 0, 1],
+    [[], 1, 0],
+    [[1], 2, 0],
+    [[1, 2, 3, 4, 5], 0, 1],
+    [[1, 1, 1, 1, 1], 5, 1],
+    [[1, 1, 1, 1, 1], 4, 5],
+    [[1, 2, 3, 3], 6, 3],
+    [[10, 20, 30, 1], 31, 2],
+    [[1, 1, 2, 2, 3, 1, 1], 4, 18]
+  ])('check with %j and %i', (arr, sum, expected) => {
+    expect(NumberOfSubsetSum(arr, sum)).toBe(expected)
+  })
+
+  it.each([
+    [[1, 2], -1],
+    [[0, 2], 2],
+    [[1, -1], 0]
+  ])('throws for %j and %i', (arr, sum) => {
+    expect(() => NumberOfSubsetSum(arr, sum)).toThrowError()
+  })
+})

From 79b93d35b6175fe6364fb16c07520e796a3fddb5 Mon Sep 17 00:00:00 2001
From: Piotr Idzik <65706193+vil02@users.noreply.github.com>
Date: Tue, 11 Jun 2024 22:10:48 +0200
Subject: [PATCH 07/12] style: remove redundant eslint suppressions (#1667)

---
 Backtracking/tests/RatInAMaze.test.js | 4 ----
 Backtracking/tests/Sudoku.test.js     | 1 -
 Data-Structures/Array/QuickSelect.js  | 1 -
 Maths/test/EulerMethod.manual-test.js | 1 -
 Maths/test/FindMinIterator.test.js    | 4 +---
 Recursive/test/FloodFill.test.js      | 1 -
 6 files changed, 1 insertion(+), 11 deletions(-)

diff --git a/Backtracking/tests/RatInAMaze.test.js b/Backtracking/tests/RatInAMaze.test.js
index 6cc5b31aae..52f620027b 100644
--- a/Backtracking/tests/RatInAMaze.test.js
+++ b/Backtracking/tests/RatInAMaze.test.js
@@ -6,7 +6,6 @@ describe('RatInAMaze', () => {
 
     for (const value of values) {
       // we deliberately want to check whether this constructor call fails or not
-      // eslint-disable-next-line no-new
       expect(() => {
         new RatInAMaze(value)
       }).toThrow()
@@ -15,7 +14,6 @@ describe('RatInAMaze', () => {
 
   it('should fail for an empty array', () => {
     // we deliberately want to check whether this constructor call fails or not
-    // eslint-disable-next-line no-new
     expect(() => {
       new RatInAMaze([])
     }).toThrow()
@@ -28,7 +26,6 @@ describe('RatInAMaze', () => {
     ]
 
     // we deliberately want to check whether this constructor call fails or not
-    // eslint-disable-next-line no-new
     expect(() => {
       new RatInAMaze(array)
     }).toThrow()
@@ -39,7 +36,6 @@ describe('RatInAMaze', () => {
 
     for (const value of values) {
       // we deliberately want to check whether this constructor call fails or not
-      // eslint-disable-next-line no-new
       expect(() => {
         new RatInAMaze(value)
       }).toThrow()
diff --git a/Backtracking/tests/Sudoku.test.js b/Backtracking/tests/Sudoku.test.js
index 8cbe187089..c70f7de67a 100644
--- a/Backtracking/tests/Sudoku.test.js
+++ b/Backtracking/tests/Sudoku.test.js
@@ -27,7 +27,6 @@ const solved = [
 describe('Sudoku', () => {
   it('should create a valid board successfully', () => {
     // we deliberately want to check whether this constructor call fails or not
-    // eslint-disable-next-line no-new
     expect(() => {
       new Sudoku(data)
     }).not.toThrow()
diff --git a/Data-Structures/Array/QuickSelect.js b/Data-Structures/Array/QuickSelect.js
index d01555ed95..53c8c8e855 100644
--- a/Data-Structures/Array/QuickSelect.js
+++ b/Data-Structures/Array/QuickSelect.js
@@ -12,7 +12,6 @@
  */
 
 function QuickSelect(items, kth) {
-  // eslint-disable-line no-unused-vars
   if (kth < 1 || kth > items.length) {
     throw new RangeError('Index Out of Bound')
   }
diff --git a/Maths/test/EulerMethod.manual-test.js b/Maths/test/EulerMethod.manual-test.js
index 27b4631a80..e1959280a5 100644
--- a/Maths/test/EulerMethod.manual-test.js
+++ b/Maths/test/EulerMethod.manual-test.js
@@ -15,7 +15,6 @@ function plotLine(label, points, width, height) {
 
   // Chart-class from chartjs
   const chart = new Chart(canvas, {
-    // eslint-disable-line
     type: 'scatter',
     data: {
       datasets: [
diff --git a/Maths/test/FindMinIterator.test.js b/Maths/test/FindMinIterator.test.js
index 7b7229b106..792cb7695e 100644
--- a/Maths/test/FindMinIterator.test.js
+++ b/Maths/test/FindMinIterator.test.js
@@ -22,13 +22,12 @@ describe('FindMinIterator', () => {
   })
 
   test('given empty generator then min is undefined', () => {
-    const src = function* () {} // eslint-disable-line
+    const src = function* () {}
     expect(FindMinIterator(src())).toBeUndefined()
   })
 
   test('given generator then min is found', () => {
     const src = function* () {
-      // eslint-disable-line
       yield 1
       yield -1
       yield 0
@@ -38,7 +37,6 @@ describe('FindMinIterator', () => {
 
   test('given string generator then min string length is found', () => {
     const src = function* () {
-      // eslint-disable-line
       yield 'abc'
       yield 'de'
       yield 'qwerty'
diff --git a/Recursive/test/FloodFill.test.js b/Recursive/test/FloodFill.test.js
index 618692dd97..eb44e75e09 100644
--- a/Recursive/test/FloodFill.test.js
+++ b/Recursive/test/FloodFill.test.js
@@ -69,7 +69,6 @@ function testDepthFirst(
   replacementColor,
   testLocation
 ) {
-  // eslint-disable-line
   const rgbData = generateTestRgbData()
   depthFirstSearch(rgbData, fillLocation, targetColor, replacementColor)
   return rgbData[testLocation[0]][testLocation[1]]

From 0182bcacd0573094452e2130a18e4b947df91e67 Mon Sep 17 00:00:00 2001
From: Piotr Idzik <65706193+vil02@users.noreply.github.com>
Date: Tue, 11 Jun 2024 22:11:12 +0200
Subject: [PATCH 08/12] style: remove `listIn` and `listOut` (#1669)

---
 Data-Structures/Queue/QueueUsing2Stacks.js | 18 ------------------
 1 file changed, 18 deletions(-)

diff --git a/Data-Structures/Queue/QueueUsing2Stacks.js b/Data-Structures/Queue/QueueUsing2Stacks.js
index 256f11060d..9a51ee3a72 100644
--- a/Data-Structures/Queue/QueueUsing2Stacks.js
+++ b/Data-Structures/Queue/QueueUsing2Stacks.js
@@ -29,24 +29,6 @@ class Queue {
       return top
     }
   }
-
-  // display elements of the inputstack
-  listIn(output = (value) => console.log(value)) {
-    let i = 0
-    while (i < this.inputStack.length) {
-      output(this.inputStack[i])
-      i++
-    }
-  }
-
-  // display element of the outputstack
-  listOut(output = (value) => console.log(value)) {
-    let i = 0
-    while (i < this.outputStack.length) {
-      output(this.outputStack[i])
-      i++
-    }
-  }
 }
 
 export { Queue }

From 584424241c61079940d94a5aed1bed583c555098 Mon Sep 17 00:00:00 2001
From: Daniel <67126972+ddaniel27@users.noreply.github.com>
Date: Mon, 17 Jun 2024 23:08:16 -0500
Subject: [PATCH 09/12] [Solution] Project euler challenge 19 with tests
 (#1659)
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

* [Solution] Project euler challenge 19 with tests

* update leap year function

* Remove unnecessary, confusingly placed comments

---------

Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
---
 Project-Euler/Problem019.js           | 48 +++++++++++++++++++++++++++
 Project-Euler/test/Problem019.test.js |  8 +++++
 2 files changed, 56 insertions(+)
 create mode 100644 Project-Euler/Problem019.js
 create mode 100644 Project-Euler/test/Problem019.test.js

diff --git a/Project-Euler/Problem019.js b/Project-Euler/Problem019.js
new file mode 100644
index 0000000000..5b488c7f96
--- /dev/null
+++ b/Project-Euler/Problem019.js
@@ -0,0 +1,48 @@
+/**
+ * Problem 19 - Counting Sundays
+ *
+ * @see {@link https://projecteuler.net/problem=19}
+ *
+ * You are given the following information, but you may prefer to do some research for yourself.
+ * 1 Jan 1900 was a Monday.
+ * Thirty days has September,
+ * April, June and November.
+ * All the rest have thirty-one,
+ * Saving February alone,
+ * Which has twenty-eight, rain or shine.
+ * And on leap years, twenty-nine.
+ * A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.
+ * How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?
+ *
+ * @author ddaniel27
+ */
+import { isLeapYear } from '../Maths/LeapYear'
+
+function problem19() {
+  let sundaysCount = 0 // Count of Sundays
+  let dayOfWeek = 2 // 1st Jan 1900 was a Monday, so 1st Jan 1901 was a Tuesday
+
+  for (let year = 1901; year <= 2000; year++) {
+    for (let month = 1; month <= 12; month++) {
+      if (dayOfWeek === 0) {
+        // If it's a Sunday (0 is Sunday, 1 is Monday, ..., 6 is Saturday)
+        sundaysCount++
+      }
+
+      let daysInMonth = 31
+      if (month === 4 || month === 6 || month === 9 || month === 11) {
+        // April, June, September, November
+        daysInMonth = 30
+      } else if (month === 2) {
+        // February
+        daysInMonth = isLeapYear(year) ? 29 : 28
+      }
+
+      dayOfWeek = (dayOfWeek + daysInMonth) % 7 // Calculate the day of the week
+    }
+  }
+
+  return sundaysCount
+}
+
+export { problem19 }
diff --git a/Project-Euler/test/Problem019.test.js b/Project-Euler/test/Problem019.test.js
new file mode 100644
index 0000000000..8845e5a0ac
--- /dev/null
+++ b/Project-Euler/test/Problem019.test.js
@@ -0,0 +1,8 @@
+import { problem19 } from '../Problem019.js'
+
+describe('checking sundays during the twentieth century', () => {
+  // Project Euler Challenge Check
+  test('result should be 171', () => {
+    expect(problem19()).toBe(171)
+  })
+})

From 5f8d4d447a85fb4aeb065983ab275a582d4ff07b Mon Sep 17 00:00:00 2001
From: Daniel <67126972+ddaniel27@users.noreply.github.com>
Date: Sun, 23 Jun 2024 00:20:25 -0500
Subject: [PATCH 10/12] [Compressor] RLE Compressor implementation (#1671)
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

* [Solution] Project euler challenge 19 with tests

* update leap year function

* Remove unnecessary, confusingly placed comments

* [COMPRESSOR] RLE

* [COMPRESSOR] RLE style fixed

---------

Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
---
 Compression/RLE.js           | 38 ++++++++++++++++++++++++++++++++++++
 Compression/test/RLE.test.js | 13 ++++++++++++
 2 files changed, 51 insertions(+)
 create mode 100644 Compression/RLE.js
 create mode 100644 Compression/test/RLE.test.js

diff --git a/Compression/RLE.js b/Compression/RLE.js
new file mode 100644
index 0000000000..81a1538646
--- /dev/null
+++ b/Compression/RLE.js
@@ -0,0 +1,38 @@
+/*
+ * RLE (Run Length Encoding) is a simple form of data compression.
+ * The basic idea is to represent repeated successive characters as a single count and character.
+ * For example, the string "AAAABBBCCDAA" would be encoded as "4A3B2C1D2A".
+ *
+ * @author - [ddaniel27](https://github.com/ddaniel27)
+ */
+
+function Compress(str) {
+  let compressed = ''
+  let count = 1
+
+  for (let i = 0; i < str.length; i++) {
+    if (str[i] !== str[i + 1]) {
+      compressed += count + str[i]
+      count = 1
+      continue
+    }
+
+    count++
+  }
+
+  return compressed
+}
+
+function Decompress(str) {
+  let decompressed = ''
+  let match = [...str.matchAll(/(\d+)(\D)/g)] // match all groups of digits followed by a non-digit character
+
+  match.forEach((item) => {
+    let [count, char] = [item[1], item[2]]
+    decompressed += char.repeat(count)
+  })
+
+  return decompressed
+}
+
+export { Compress, Decompress }
diff --git a/Compression/test/RLE.test.js b/Compression/test/RLE.test.js
new file mode 100644
index 0000000000..0094b5b7e2
--- /dev/null
+++ b/Compression/test/RLE.test.js
@@ -0,0 +1,13 @@
+import { Compress, Decompress } from '../RLE'
+
+describe('Test RLE Compressor/Decompressor', () => {
+  it('Test - 1, Pass long repetitive strings', () => {
+    expect(Compress('AAAAAAAAAAAAAA')).toBe('14A')
+    expect(Compress('AAABBQQQQQFG')).toBe('3A2B5Q1F1G')
+  })
+
+  it('Test - 2, Pass compressed strings', () => {
+    expect(Decompress('14A')).toBe('AAAAAAAAAAAAAA')
+    expect(Decompress('3A2B5Q1F1G')).toBe('AAABBQQQQQFG')
+  })
+})

From 8ceaa252b9b7aa37f217e1cb0cb65351698b8777 Mon Sep 17 00:00:00 2001
From: "dependabot[bot]" <49699333+dependabot[bot]@users.noreply.github.com>
Date: Sun, 23 Jun 2024 10:51:19 +0530
Subject: [PATCH 11/12] chore(deps-dev): bump braces from 3.0.2 to 3.0.3
 (#1670)

Bumps [braces](https://github.com/micromatch/braces) from 3.0.2 to 3.0.3.
- [Changelog](https://github.com/micromatch/braces/blob/master/CHANGELOG.md)
- [Commits](https://github.com/micromatch/braces/compare/3.0.2...3.0.3)

---
updated-dependencies:
- dependency-name: braces
  dependency-type: indirect
...

Signed-off-by: dependabot[bot] <support@github.com>
Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>
---
 package-lock.json | 18 +++++++++++-------
 1 file changed, 11 insertions(+), 7 deletions(-)

diff --git a/package-lock.json b/package-lock.json
index a4efa09c1b..9a4fd732a9 100644
--- a/package-lock.json
+++ b/package-lock.json
@@ -463,11 +463,12 @@
       }
     },
     "node_modules/braces": {
-      "version": "3.0.2",
+      "version": "3.0.3",
+      "resolved": "https://registry.npmjs.org/braces/-/braces-3.0.3.tgz",
+      "integrity": "sha512-yQbXgO/OSZVD2IsiLlro+7Hf6Q18EJrKSEsdoMzKePKXct3gvD8oLcOQdIzGupr5Fj+EDe8gO/lxc1BzfMpxvA==",
       "dev": true,
-      "license": "MIT",
       "dependencies": {
-        "fill-range": "^7.0.1"
+        "fill-range": "^7.1.1"
       },
       "engines": {
         "node": ">=8"
@@ -634,9 +635,10 @@
       }
     },
     "node_modules/fill-range": {
-      "version": "7.0.1",
+      "version": "7.1.1",
+      "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-7.1.1.tgz",
+      "integrity": "sha512-YsGpe3WHLK8ZYi4tWDg2Jy3ebRz2rXowDxnld4bkQB00cc/1Zw9AWnC0i9ztDJitivtQvaI9KaLyKrc+hBW0yg==",
       "dev": true,
-      "license": "MIT",
       "dependencies": {
         "to-regex-range": "^5.0.1"
       },
@@ -786,8 +788,9 @@
     },
     "node_modules/is-number": {
       "version": "7.0.0",
+      "resolved": "https://registry.npmjs.org/is-number/-/is-number-7.0.0.tgz",
+      "integrity": "sha512-41Cifkg6e8TylSpdtTpeLVMqvSBEVzTttHvERD741+pnZ8ANv0004MRL43QKPDlK9cGvNp6NZWZUBlbGXYxxng==",
       "dev": true,
-      "license": "MIT",
       "engines": {
         "node": ">=0.12.0"
       }
@@ -1319,8 +1322,9 @@
     },
     "node_modules/to-regex-range": {
       "version": "5.0.1",
+      "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-5.0.1.tgz",
+      "integrity": "sha512-65P7iz6X5yEr1cwcgvQxbbIw7Uk3gOy5dIdtZ4rDveLqhrdJP+Li/Hx6tyK0NEb+2GCyneCMJiGqrADCSNk8sQ==",
       "dev": true,
-      "license": "MIT",
       "dependencies": {
         "is-number": "^7.0.0"
       },

From 9010481c2930d65621f18f41c216f29fceaa8807 Mon Sep 17 00:00:00 2001
From: Piotr Idzik <65706193+vil02@users.noreply.github.com>
Date: Sun, 23 Jun 2024 13:40:42 +0200
Subject: [PATCH 12/12] chore: update `codecov-action` to `v4` (#1605)

The token has been added to the repository secrets.
---
 .github/workflows/UploadCoverageReport.yml | 18 +++++++++++++++---
 1 file changed, 15 insertions(+), 3 deletions(-)

diff --git a/.github/workflows/UploadCoverageReport.yml b/.github/workflows/UploadCoverageReport.yml
index eee9d4aec9..3f8fee4256 100644
--- a/.github/workflows/UploadCoverageReport.yml
+++ b/.github/workflows/UploadCoverageReport.yml
@@ -8,6 +8,9 @@ name: UploadCoverageReport
       - master
   pull_request:
 
+env:
+  REPORT_PATH: "coverage/coverage-final.json"
+
 jobs:
   UploadCoverageReport:
     runs-on: ubuntu-latest
@@ -25,9 +28,18 @@ jobs:
       - name: Generate coverage report
         run: npm test -- --coverage
 
-      - name: Upload coverage to codecov
-        uses: codecov/codecov-action@v3
+      - name: Upload coverage to codecov (tokenless)
+        if: github.event_name == 'pull_request' && github.event.pull_request.head.repo.full_name != github.repository
+        uses: codecov/codecov-action@v4
+        with:
+          files: "${{ env.REPORT_PATH }}"
+          fail_ci_if_error: true
+
+      - name: Upload coverage to codecov (with token)
+        if: "! github.event.pull_request.head.repo.fork "
+        uses: codecov/codecov-action@v4
         with:
-          files: "coverage/coverage-final.json"
+          token: ${{ secrets.CODECOV_TOKEN }}
+          files: "${{ env.REPORT_PATH }}"
           fail_ci_if_error: true
 ...