mirror of
https://github.com/multipleof4/lynchmark.git
synced 2026-01-14 08:37:56 +00:00
21 lines
1.1 KiB
JavaScript
21 lines
1.1 KiB
JavaScript
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.
|
|
// - 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.
|
|
`,
|
|
runTest: async (findLISLength) => {
|
|
const assert = {
|
|
strictEqual: (a, e, m) => { if (a !== e) throw new Error(m || `FAIL: ${a} !== ${e}`) },
|
|
};
|
|
const nums = [10, 9, 2, 5, 3, 7, 101, 18, 4, 6];
|
|
const length = await findLISLength(nums);
|
|
assert.strictEqual(length, 5, "Test Failed: LIS length should be 5.");
|
|
}
|
|
};
|