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

Feat: Update prompt instructions for LLMs

Browse Source
This commit is contained in:
multipleof4
2025-10-13 06:22:59 -07:00
parent 5e06ab3b92
commit 285cf114db
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
tests/3_lis/test.js
View File

@@ -1,5 +1,7 @@
export default { export default {
prompt: ` 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. // 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.