algorithms

Files (1)

• SKILL.md

SKILL.md (first lines)

## Steps
1. State input size and needed complexity first.
2. Pick data structures for required operations.
3. Implement the solution using the chosen structures.
4. Calculate time and space complexity.
5. Handle edge cases: empty input, single element, duplicates, huge inputs.
6. Write a brute-force reference implementation in `test_brute.py`.
7. Run random test generation against both versions.
8. Compare outputs and fix mismatches.

## Checklist
- [ ] Input size and complexity stated upfront
- [ ] Data structures match operation requirements
- [ ] Time and space complexity explained
- [ ] Edge cases covered (empty, one, duplicates, huge)
- [ ] Brute-force version written and tested
- [ ] Random inputs pass both implementations
- [ ] No external dependencies added
- [ ] Code runs in under target time limit

## Output
- Complexity analysis and chosen data structures
- Optimized implementation with edge case handling
- Test script output showing random match results
- Brief explanation of why the approach fits the constraints

From YauhenBichel/engineering-skills, Apache-2.0.

More from YauhenBichel/engineering-skills