Adding tests for "Number of paths between 2

points".

Author: cyrilverloop

CHANGELOG.md

@@ -30,6 +30,7 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 - Tests for "Chained matrix products".
 - Tests for "Fun with set theory".
 - Tests for "Huffman code".
+- Tests for "Number of paths between 2 points".
 
 ## [1.12.0] - 2022-09-01
 ### Added

lib/community/training/medium/numberOfPathsBetween2Points/numberOfPathsBetween2Points.dist

@@ -0,0 +1,18 @@
+/**
+ * The "Number of paths between 2 points" puzzle.
+ * @see {@link https://www.codingame.com/ide/puzzle/number-of-paths-between-2-points}
+ */
+function execute(readline) {
+    const M = parseInt(readline());
+    const N = parseInt(readline());
+    for (let i = 0; i < M; i++) {
+        const ROW = readline();
+    }
+
+    // Write an answer using console.log()
+    // To debug: console.error('Debug messages...');
+
+    console.log('answer');
+}
+
+export { execute };

test/community/training/medium/numberOfPathsBetween2Points/CGTest.js

@@ -0,0 +1,66 @@
+import { assert } from 'chai';
+import sinon from 'sinon';
+import File from '../../../../File.js';
+import { execute } from '../../../../../lib/community/training/medium/numberOfPathsBetween2Points/numberOfPathsBetween2Points.js';
+
+const __dirname = new URL('.', import.meta.url).pathname;
+
+suite("Number of paths between 2 points", function() {
+    const sandbox = sinon.createSandbox();
+
+    setup(function () {
+        sandbox.stub(console, "log");
+    });
+
+    teardown(function () {
+        sandbox.restore();
+    });
+
+
+    test("Test 1", function() {
+        let inputFile = new File(__dirname + 'input/01 - test 1.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assert.strictEqual(
+            console.log.getCall(0).args[0],
+            2
+        );
+    });
+
+
+    test("Test 2", function() {
+        let inputFile = new File(__dirname + 'input/02 - test 2.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assert.strictEqual(
+            console.log.getCall(0).args[0],
+            1
+        );
+    });
+
+
+    test("Test 3", function() {
+        let inputFile = new File(__dirname + 'input/03 - test 3.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assert.strictEqual(
+            console.log.getCall(0).args[0],
+            2716
+        );
+    });
+
+
+    test("Test 4", function() {
+        let inputFile = new File(__dirname + 'input/04 - test 4.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assert.strictEqual(
+            console.log.getCall(0).args[0],
+            0
+        );
+    });
+});

test/community/training/medium/numberOfPathsBetween2Points/input/01 - test 1.txt

@@ -0,0 +1,4 @@
+2
+2
+00
+00

test/community/training/medium/numberOfPathsBetween2Points/input/02 - test 2.txt

@@ -0,0 +1,4 @@
+2
+2
+00
+10

test/community/training/medium/numberOfPathsBetween2Points/input/03 - test 3.txt

@@ -0,0 +1,12 @@
+10
+10
+0000001000
+0000000000
+0000000000
+0010001000
+0000000000
+0000100000
+0000100010
+0000000000
+0000000100
+0000000010

test/community/training/medium/numberOfPathsBetween2Points/input/04 - test 4.txt

@@ -0,0 +1,12 @@
+10
+10
+0010001000
+0010000000
+0010000000
+1110001000
+0000000000
+0000100000
+0000100010
+0000000000
+0000000101
+0000000010