Adding tests for "Longest increasing

subsequence".

Author: cyrilverloop

CHANGELOG.md

@@ -35,6 +35,7 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 - Tests for "1010(1)".
 - Tests for "Vote counting".
 - Tests for "Maze for the champions".
+- Tests for "Longest increasing subsequence".
 
 ## [1.16.0] - 2022-12-31
 ### Added

lib/community/training/medium/longestIncreasingSubsequence/longestIncreasingSubsequence.dist

@@ -0,0 +1,17 @@
+/**
+ * The "Longest increasing subsequence" puzzle.
+ * @see {@link https://www.codingame.com/ide/puzzle/longest-increasing-subsequence}
+ */
+function execute(readline) {
+    const n = parseInt(readline());
+    for (let i = 0; i < n; i++) {
+        const p = parseInt(readline());
+    }
+
+    // Write an answer using console.log()
+    // To debug: console.error('Debug messages...');
+
+    console.log('answer');
+}
+
+export { execute };

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

@@ -0,0 +1,74 @@
+import { assert } from 'chai';
+import sinon from 'sinon';
+import File from '../../../../File.js';
+import { execute } from '../../../../../lib/community/training/medium/longestIncreasingSubsequence/longestIncreasingSubsequence.js';
+
+const __dirname = new URL('.', import.meta.url).pathname;
+
+suite("Longest increasing subsequence", function() {
+    const sandbox = sinon.createSandbox();
+
+    setup(function () {
+        sandbox.stub(console, "log");
+    });
+
+    teardown(function () {
+        sandbox.restore();
+    });
+
+
+    test("Simple", function() {
+        let inputFile = new File(__dirname + 'input/01 - simple.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assert.strictEqual(
+            console.log.getCall(0).args[0],
+            4
+        );
+    });
+
+    test("Still simple", function() {
+        let inputFile = new File(__dirname + 'input/02 - still simple.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assert.strictEqual(
+            console.log.getCall(0).args[0],
+            2
+        );
+    });
+
+    test("Medium", function() {
+        let inputFile = new File(__dirname + 'input/03 - medium.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assert.strictEqual(
+            console.log.getCall(0).args[0],
+            7
+        );
+    });
+
+    test("Getting harder", function() {
+        let inputFile = new File(__dirname + 'input/04 - getting harder.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assert.strictEqual(
+            console.log.getCall(0).args[0],
+            15
+        );
+    });
+
+    test("Lots of numbers!", function() {
+        let inputFile = new File(__dirname + 'input/05 - lots of numbers!.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assert.strictEqual(
+            console.log.getCall(0).args[0],
+            94
+        );
+    });
+});

test/community/training/medium/longestIncreasingSubsequence/input/01 - simple.txt

@@ -0,0 +1,9 @@
+8
+5
+2
+8
+6
+3
+6
+9
+7

test/community/training/medium/longestIncreasingSubsequence/input/02 - still simple.txt

@@ -0,0 +1,6 @@
+5
+9
+2
+9
+8
+8

test/community/training/medium/longestIncreasingSubsequence/input/03 - medium.txt

@@ -0,0 +1,24 @@
+23
+44
+25
+29
+44
+1
+15
+19
+34
+37
+19
+12
+26
+20
+32
+45
+5
+3
+48
+38
+7
+42
+25
+9

test/community/training/medium/longestIncreasingSubsequence/input/04 - getting harder.txt

@@ -0,0 +1,66 @@
+65
+48
+10
+47
+47
+13
+14
+35
+20
+19
+15
+17
+49
+28
+46
+50
+23
+14
+47
+25
+18
+39
+27
+48
+50
+13
+48
+12
+27
+42
+34
+19
+47
+22
+27
+50
+22
+42
+38
+23
+19
+43
+20
+23
+10
+31
+41
+27
+40
+24
+21
+11
+29
+13
+35
+46
+40
+50
+10
+16
+29
+44
+37
+41
+45
+44