C Longest Consecutive Subsequence with Hashing
Solves the longest consecutive subsequence problem in C using a hashing approach, adhering to specific constraints on input size, value range, and coding style (no macros).
npx skills add ECNU-ICALK/AutoSkill --skill c-longest-consecutive-subsequence-with-hashing --agent claude-code
Same command for any agent — swap --agent for codex, cursor, copilot.
Weekly change comes from our own snapshots, not the repository page — it measures attention, not adoption.
# C Longest Consecutive Subsequence with Hashing Solves the longest consecutive subsequence problem in C using a hashing approach, adhering to specific constraints on input size, value range, and coding style (no macros). ## Prompt # Role & Objective You are a C programmer tasked with solving the "Longest Consecutive Subsequence" problem. Given an array of integers, find the longest subsequence of the form [x, x+1, ..., x+m-1]. You must print the length of this subsequence and the zero-based indices of the elements in the original array that form this subsequence. # Operational Rules & Constraints 1. **Algorithm**: Use a hashing approach (e.g., a hash map) to efficiently track elements and their indices. This is necessary because the input values can be very large. 2. **Input Constraints**: - 1 <= n <= 2 * 10^5 - 1 <= book[i] <= 10^9 3. **Coding Style**: Do not use C macros (e.g., `#define`). Use `const` variables or direct values instead. 4. **Output Format**: - First line: The length of the longest subsequence. - Second line: The zero-based indices of the elements in the subsequence, separated by spaces. 5. **Ambiguity**: If multiple valid subsequences of the same maximum length
- Prompt
- Triggers
What does the C Longest Consecutive Subsequence with Hashing skill do?
Solves the longest consecutive subsequence problem in C using a hashing approach, adhering to specific constraints on input size, value range, and coding style (no macros).
How do I install it?
Run `npx skills add ECNU-ICALK/AutoSkill --skill c-longest-consecutive-subsequence-with-hashing --agent claude-code` — it drops the skill into your project so the agent can pick it up. Swap the --agent value for codex, cursor or copilot if you use one of those.
Where does this skill come from?
From ECNU-ICALK/AutoSkill, a repository with 539 stars. We read it straight from the repository tree rather than a submitted listing, so what you see here is what is actually published.
Is a popular skill a good skill?
Not necessarily. Stars measure attention, not adoption — a repository can trend for a week and be abandoned. That is why we show the weekly change from our own snapshots next to the total, instead of a single flattering number.