multipleof4/lynchmark
1
0
Fork 0
mirror of https://github.com/multipleof4/lynchmark.git synced 2026-01-14 08:37:56 +00:00
Code Issues Packages Projects Releases Wiki Activity

Delete: Reorganizing tests into subdirectories

Browse Source
This commit is contained in:
multipleof4
2025-10-13 05:50:35 -07:00
parent 5177658352
commit 3b9298e17a
1 changed files with 0 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
tests/3_lis.js
View File

@@ -1,25 +0,0 @@
module.exports = {
prompt: `
// Write an async JavaScript function 'findLISLength' that finds the length of the Longest Increasing Subsequence (LIS) in an array of numbers.
// - The function must accept an array of numbers.
// - You MUST implement the efficient O(n log n) algorithm.
// - You MUST use a dynamic import() to load the 'd3-array' library from a CDN and use its 'bisectLeft' function to achieve O(n log n) complexity.
// - The function should return a single number: the length of the LIS.
`,
harness: `
const assert = require('assert');
async function runTest() {
const nums = [10, 9, 2, 5, 3, 7, 101, 18, 4, 6];
try {
const length = await findLISLength(nums);
assert.strictEqual(length, 5, "Test Failed: LIS of [10,9,2,5,3,7,101,18,4,6] should be 5 (e.g., 2,3,4,6,18).");
console.log("Test Passed!");
process.exit(0);
} catch (e) {
console.error("Test Execution Error:", e.message);
process.exit(1);
}
}
runTest();
`
};