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

Refactor: Use shared prompt from README config

Browse Source
This commit is contained in:
multipleof4
2025-10-13 10:57:52 -07:00
parent cccda2e484
commit 84f6eed585
1 changed files with 2 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
tests/3_lis/test.js
View File

@@ -1,14 +1,10 @@
export default {
functionName: 'findLISLength',
prompt: `
// Your goal is to write a production-ready and maintainable JavaScript function. Apply code-golfing practices without sacrificing readability by putting everything on one line. Do not include any comments in your code.
//
// Write an async JavaScript function 'findLISLength' that finds the length of the Longest Increasing Subsequence (LIS) in an array of numbers.
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.
`,
// - The function should return a single number: the length of the LIS.`,
runTest: async (findLISLength) => {
const assert = {
strictEqual: (a, e, m) => { if (a !== e) throw new Error(m || `FAIL: ${a} !== ${e}`) },