mirror of
https://github.com/multipleof4/lynchmark.git
synced 2026-01-14 08:37:56 +00:00
Refactor: Use shared prompt from README config
This commit is contained in:
@@ -1,14 +1,10 @@
|
|||||||
export default {
|
export default {
|
||||||
functionName: 'findLISLength',
|
functionName: 'findLISLength',
|
||||||
prompt: `
|
prompt: `// Write an async JavaScript function 'findLISLength' that finds the length of the Longest Increasing Subsequence (LIS) in an array of numbers.
|
||||||
// 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.
|
// - The function must accept an array of numbers.
|
||||||
// - You MUST implement the efficient O(n log n) algorithm.
|
// - 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.
|
// - 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) => {
|
runTest: async (findLISLength) => {
|
||||||
const assert = {
|
const assert = {
|
||||||
strictEqual: (a, e, m) => { if (a !== e) throw new Error(m || `FAIL: ${a} !== ${e}`) },
|
strictEqual: (a, e, m) => { if (a !== e) throw new Error(m || `FAIL: ${a} !== ${e}`) },
|
||||||
|
|||||||
Reference in New Issue
Block a user