Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion .github/workflows/daily-leetcode.yml
Original file line number Diff line number Diff line change
Expand Up @@ -114,7 +114,7 @@ jobs:
with:
mode: 'agent'
claude_code_oauth_token: ${{ secrets.CLAUDE_CODE_OAUTH_TOKEN }}
direct_prompt: |
prompt: |
Read the file `prompt.txt` in the repository root. It contains a LeetCode problem
and detailed instructions for generating a DSA-coach analysis with progressive hints,
a Go solution, and Go table-driven tests.
Expand Down
5 changes: 4 additions & 1 deletion scripts/prompt-template.md
Original file line number Diff line number Diff line change
Expand Up @@ -65,6 +65,7 @@ Space Complexity: O(...)
### Output Section 2: solution.go

Write a correct, clean Go solution. Requirements:

- Use `package main`
- Define any needed types (TreeNode, ListNode, etc.) inline in the file
- Include a brief comment at the top explaining the approach
Expand All @@ -81,10 +82,12 @@ Write a correct, clean Go solution. Requirements:
### Output Section 3: solution_test.go

Write table-driven tests in Go. Requirements:

- Use `package main`
- Extract ALL examples from the problem description as test cases
- Add at least 2 additional edge case tests beyond the examples
- Use descriptive test names like "example 1: description", "edge case: empty input"
- Ensure test cases are correct by verifying against your solution
- Follow the testing pattern below
- {{TEST_FILE_NAMING_NOTE}}

Expand All @@ -94,7 +97,7 @@ Write table-driven tests in Go. Requirements:
---TESTS_END---
```

## Important Rules
## **Important Rules**

1. The solution MUST compile and pass all generated tests.
2. Aim for an optimal or near-optimal time complexity solution.
Expand Down
Loading