Oct 7, 2022 · Oct 7, 2022 · Oct 7, 2022 · Oct 7, 2022 · Oct 10, 2022 · Oct 10, 2022
diff --git a/DIRECTORY.md b/DIRECTORY.md
  * [ROT13](Ciphers/ROT13.js)
  * [VigenereCipher](Ciphers/VigenereCipher.js)
  * [XORCipher](Ciphers/XORCipher.js)
 * **Compression**
  * [RLE](Compression/RLE.js)
 * **Conversions**
  * [ArbitraryBase](Conversions/ArbitraryBase.js)
  * [ArrayBufferToBase64](Conversions/ArrayBufferToBase64.js)
  * [Problem016](Project-Euler/Problem016.js)
  * [Problem017](Project-Euler/Problem017.js)
  * [Problem018](Project-Euler/Problem018.js)
  * [Problem019](Project-Euler/Problem019.js)
  * [Problem020](Project-Euler/Problem020.js)
  * [Problem021](Project-Euler/Problem021.js)
  * [Problem023](Project-Euler/Problem023.js)
diff --git a/Project-Euler/Problem015.js b/Project-Euler/Problem015.js
 // A lattice path is composed of horizontal and vertical lines that pass through lattice points.

 export const latticePath = (gridSize) => {
  let paths
  for (let i = 1, paths = 1; i <= gridSize; i++) {
  let paths = 1
  for (let i = 1; i <= gridSize; i++) {
    paths = (paths * (gridSize + i)) / i
  }
  // The total number of paths can be found using the binomial coefficient (b+a)/a.
diff --git a/Project-Euler/test/Problem015.test.js b/Project-Euler/test/Problem015.test.js
 import { expect } from 'vitest'
 import { latticePath } from '../Problem015'

 describe('Finding total numbers of Lattice Paths', () => {
  test.each([
    [2, 6],
    [4, 70],
    [5, 252],
    [10, 184756],
    [20, 137846528820]
  ])('If Grid Size: %i, then Lattice Paths count: %i', (a, expected) => {
    expect(latticePath(a)).toBe(expected)
  })
 })
Original file line number	Diff line number	Diff line change
Expand Up		@@ -35,6 +35,8 @@
		* [ROT13](Ciphers/ROT13.js)
		* [VigenereCipher](Ciphers/VigenereCipher.js)
		* [XORCipher](Ciphers/XORCipher.js)
		* Compression
		* [RLE](Compression/RLE.js)
		* Conversions
		* [ArbitraryBase](Conversions/ArbitraryBase.js)
		* [ArrayBufferToBase64](Conversions/ArrayBufferToBase64.js)
Expand DownExpand Up		@@ -285,6 +287,7 @@
		* [Problem016](Project-Euler/Problem016.js)
		* [Problem017](Project-Euler/Problem017.js)
		* [Problem018](Project-Euler/Problem018.js)
		* [Problem019](Project-Euler/Problem019.js)
		* [Problem020](Project-Euler/Problem020.js)
		* [Problem021](Project-Euler/Problem021.js)
		* [Problem023](Project-Euler/Problem023.js)
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -7,8 +7,8 @@ How many such routes are there through a 20×20 grid?
		// A lattice path is composed of horizontal and vertical lines that pass through lattice points.

		export const latticePath = (gridSize) => {
		let paths
		for (let i = 1, paths = 1; i <= gridSize; i++) {
		let paths = 1
		for (let i = 1; i <= gridSize; i++) {
		paths = (paths * (gridSize + i)) / i
		}
		// The total number of paths can be found using the binomial coefficient (b+a)/a.
Expand Down
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,14 @@
		import { expect } from 'vitest'
		import { latticePath } from '../Problem015'

		describe('Finding total numbers of Lattice Paths', () => {
		test.each([
		[2, 6],
		[4, 70],
		[5, 252],
		[10, 184756],
		[20, 137846528820]
		])('If Grid Size: %i, then Lattice Paths count: %i', (a, expected) => {
		expect(latticePath(a)).toBe(expected)
		})
		})