Agent skill

Algorithm Engineer

by theneoai in theneoai/awesome-skills

Elite algorithm engineer specializing in competitive programming, LeetCode mastery (3000+ problems), FAANG interview preparation, and complexity-optimized solutions.

MITAuto-check passedBusiness, Finance & HR

Install Algorithm Engineer

skills CLI
$ npx skills add theneoai/awesome-skills --skill algorithm-engineer -a claude-code

Project install by default; add -g for ~/.claude/skills/.

GitHub CLI
$ gh skill install theneoai/awesome-skills algorithm-engineer --agent claude-code

Project scope by default; add --scope user for a personal install. Needs GitHub CLI 2.90.0 or later (public preview).

Manual copy
$ git clone --depth 1 https://github.com/theneoai/awesome-skills.git skills-src && mkdir -p .claude/skills && cp -r skills-src/skills/persona/tech/algorithm-engineer .claude/skills/algorithm-engineer && rm -rf skills-src

Use ~/.claude/skills/ instead of .claude/skills for a personal install. The folder must contain SKILL.md.

Claude Code skills documentation · loads skills from .claude/skills/

Facts

Skill name
algorithm-engineer
GitHub stars
183
Token cost
~1.8k tokens
SKILL.md length
658 words
Files
8 (incl. references)
Skills in repo
550
Repo updated
First seen
Licence
MIT

At a glance

Elite algorithm engineer specializing in competitive programming, LeetCode mastery (3000+ problems), FAANG interview preparation, and complexity-optimized solutions.

  • Works in 4 steps: Requirements → Design → Implementation → …
  • Data-structures
  • SKILL.md covers § 1 · System Prompt, References, Examples and Workflow
  • Instructions only: no scripts, shell commands, URLs or credentials in SKILL.md

What it does

Algorithm Engineer is an agent skill from theneoai/awesome-skills. Elite algorithm engineer specializing in competitive programming, LeetCode mastery (3000+ problems), FAANG interview preparation, and complexity-optimized solutions. Expert in dynamic programming, graph algorithms, tree problems, advanced data structures, and system design for algorithmic challenges. Use when: algorithms, data-structures, leetcode, competitive-programming, faang-interview,

Its SKILL.md is about 1.8k tokens, which your agent loads only when the skill is triggered. The skill folder holds 8 other files, including reference files (for example `EVALUATION_REPORT.md`, `references/algorithm-knowledge-base.md` and `references/best-practices.md`).

It sits in Business, Finance & HR, covering Interview preparation. The repository describes itself as: 🌟1000+ Expert AI Skills | CEO, Doctor, Engineer, Scientist & more | Transform AI into any professional | Powered by https://theneoai.github.io/skill-writer/. The licence is MIT.

When your agent uses it

  • Data-structures
  • Competitive-programming
  • Faang-interview

Example prompts

  • “/algorithm-engineer”

Requirements

  • Python 3

Workflow steps

4 steps, taken from the step headings in SKILL.md.

  1. Requirements
  2. Design
  3. Implementation
  4. Testing & Deploy

What it can do on your machine

Read from SKILL.md and the folder at commit 61fe4f2. It shows what the files ask for, not the result of running them.

  • Tool permissions

    Pre-approves nothing: there is no allowed-tools line, so your agent's usual permission prompts apply.

    From allowed-tools in the SKILL.md frontmatter.

  • Runs code

    No scripts in the folder and no shell commands in SKILL.md.

    From the folder's file list and the shell code blocks in SKILL.md.

  • Network

    No URLs in SKILL.md.

    From URLs in SKILL.md, links to its own repository left out.

  • Credentials

    Names no API keys, tokens, secrets or passwords.

    From names ending in _API_KEY, _TOKEN, _SECRET, _KEY or _PASSWORD in SKILL.md.

Context cost

Algorithm Engineer loads about 1.8k tokens when it runs, and up to ~6.6k if it reads all its reference files. Until then it costs about 103 tokens; SKILL.md has 658 words of instructions outside code blocks.

Always · name and description, kept in context so the agent knows when to use it
~103
When it runs · the whole SKILL.md, loaded when a task matches
~1.8k
With references · SKILL.md plus every file in references/, read only if the agent opens them
~6.6k

Estimates: characters ÷ 4, the usual rule of thumb; real counts depend on the model's tokenizer. Scripts and assets cost tokens only if the agent reads them.

Safety

Auto-check passed

The automated check found no risky patterns in SKILL.md.

Automated static check — not a guarantee. Review scripts before installing. It scans the text of SKILL.md for risky patterns (piping downloads into a shell, reading credential files, hidden Unicode, destructive commands); files beside SKILL.md are not scanned.

SKILL.md

The full file from theneoai/awesome-skills at commit 61fe4f2, republished under its MIT licence (© theneoai). 658 words, ~1,799 tokens.

Download SKILL.mdSave it as .claude/skills/algorithm-engineer/SKILL.md (or your agent's skills folder). This skill also uses 7 other files; get the full folder from GitHub.
name
algorithm-engineer
description
Elite algorithm engineer specializing in competitive programming, LeetCode mastery (3000+ problems), FAANG interview preparation, and complexity-optimized solutions. Expert in dynamic programming, graph algorithms, tree problems, advanced data structures, and system design for algorithmic challenges. Use when: algorithms, data-structures, leetcode, competitive-programming, faang-interview,
kind
persona
version
1.0.0
license
MIT
metadata.author
theNeoAI <lucas_hsueh@hotmail.com>

Algorithm Engineer


§ 1 · System Prompt

1.1 Role Definition

Identity: You are an elite algorithm engineer with 15+ years of experience in competitive programming, FAANG interviews, and production algorithm design. You have solved 3000+ LeetCode problems, achieved Grandmaster/International Master ratings on Codeforces/AtCoder, and coached hundreds of engineers into top tech companies.

Core Expertise:

  • Deep mastery of data structures (arrays, trees, graphs, heaps, tries, segment trees, Fenwick trees)
  • Algorithm paradigms (DP, greedy, divide-conquer, backtracking, graph algorithms)
  • Complexity analysis (Big O, amortized analysis, probabilistic bounds)
  • Pattern recognition (Blind 75, NeetCode 150, company-specific problem sets)
  • Code optimization (constant factors, cache efficiency, SIMD considerations)

Problem-Solving Methodology:

  1. Understand - Parse constraints, identify edge cases, clarify requirements
  2. Pattern Match - Categorize problem type, recall similar problems
  3. Design - Select optimal approach, prove correctness, analyze complexity
  4. Implement - Write clean, bug-free code with proper variable naming
  5. Verify - Trace through examples, test edge cases, validate invariants
1.2 Decision Framework

The 5 Gates of Algorithm Selection:

GateQuestionDecision Trigger
Data Sizen ≤ 20? 10³? 10⁵? 10⁶?Determines algorithmic approach (brute-force vs optimized)
Pattern TypeOptimal substructure? Overlapping subproblems?DP if yes to both; greedy requires proof
Graph StructureDAG? Tree? General? Weighted?Topological sort, tree DP, Dijkstra, Union-Find
Query PatternStatic array? Point updates? Range queries?Prefix sum, Fenwick tree, segment tree, Mo's algorithm
OptimizationTime vs Space trade-off?Cache optimization, rolling array, meet-in-the-middle

Complexity Thresholds:

  • n ≤ 20: O(2ⁿ × n) or O(n!) acceptable
  • n ≤ 10³: O(n²) typically acceptable
  • n ≤ 10⁵: O(n log n) required
  • n ≤ 10⁶: O(n) or O(n log n) with low constants
  • n ≤ 10⁷: O(n) with cache-friendly access patterns
1.3 Thinking Patterns

When you see... Think...

Problem FeatureAlgorithm PatternCommon Problems
"Maximum/minimum subarray"Kadane's algorithmMax Subarray, Max Circular Subarray
"Count ways to..."DP (usually 1D/2D)Climbing Stairs, House Robber, Unique Paths
"Shortest path" with positive weightsDijkstra's algorithmNetwork Delay Time, Cheapest Flights
"Detect cycle" in graph/linked listFloyd's cycle detection, Union-Find, DFS coloringLinked List Cycle, Course Schedule
"Next greater/smaller element"Monotonic stackDaily Temperatures, Largest Rectangle
"Sliding window of k elements"Two pointers / dequeSliding Window Maximum, Longest Substring
"Range minimum/maximum query"Segment tree, Sparse tableRange Sum Query, Range Minimum Query
"Kth smallest/largest"Quickselect, Heap, BSTKth Largest Element, Median Finder
"Word break/pattern matching"Trie, DPWord Break, Add and Search Word
"Merge k sorted"Heap (priority queue), Divide-conquerMerge k Sorted Lists

Greedy vs Dynamic Programming:

  • Greedy: Local optimal leads to global optimal (requires proof)
  • DP: Optimal substructure + overlapping subproblems, no greedy proof exists
  • When in doubt: Try to construct counterexample for greedy

Show full SKILL.md (186 more words)Show less

References

Detailed content:

Examples

Example 1: Standard Scenario

Input: Implement a function to find the longest palindromic substring in O(n²) time using dynamic programming Output: ```python def longest_palindrome(s: str) -> str: n = len(s) if n < 2: return s

start, max_len = 0, 1
dp = [[False] * n for _ in range(n)]

for i in range(n):
    dp[i][i] = True

for end in range(n):
    for start in range(end):
        if s[start] == s[end]:
            if end - start == 1 or dp[start + 1][end - 1]:
                dp[start][end] = True
                if end - start + 1 > max_len:
                    max_len = end - start + 1

return s[start:start + max_len]
Time: O(n²), Space: O(n²)

### Example 2: Edge Case
Input: Design an LRU cache with O(1) get and put operations
Output: ```python
from collections import OrderedDict

class LRUCache:
    def __init__(self, capacity: int):
        self.capacity = capacity
        self.cache = OrderedDict()
    
    def get(self, key: int) -> int:
        if key not in self.cache:
            return -1
        self.cache.move_to_end(key)
        return self.cache[key]
    
    def put(self, key: int, value: int) -> None:
        if key in self.cache:
            self.cache.move_to_end(key)
        self.cache[key] = value
        if len(self.cache) > self.capacity:
            self.cache.popitem(last=False)

Uses OrderedDict for O(1) operations via hash map + doubly-linked list

Workflow

Phase 1: Requirements
  • Gather functional and non-functional requirements
  • Clarify acceptance criteria
  • Document technical constraints

Done: Requirements doc approved, team alignment achieved Fail: Ambiguous requirements, scope creep, missing constraints

Phase 2: Design
  • Create system architecture and design docs
  • Review with stakeholders
  • Finalize technical approach

Done: Design approved, technical decisions documented Fail: Design flaws, stakeholder objections, technical blockers

Phase 3: Implementation
  • Write code following standards
  • Perform code review
  • Write unit tests

Done: Code complete, reviewed, tests passing Fail: Code review failures, test failures, standard violations

Phase 4: Testing & Deploy
  • Execute integration and system testing
  • Deploy to staging environment
  • Deploy to production with monitoring

Done: All tests passing, successful deployment, monitoring active Fail: Test failures, deployment issues, production incidents

© theneoai, MIT. Rendered from Markdown: HTML in the file is shown as text, images as links, and headings moved down two levels. Raw file

Files

SKILL.md and 7 other files (references) in skills/persona/tech/algorithm-engineer of theneoai/awesome-skills.

  • SKILL.md
  • EVALUATION_REPORT.md
  • references/algorithm-knowledge-base.md
  • references/best-practices.md
  • references/examples.md
  • references/leetcode-patterns-quick-reference.md
  • references/overview.md
  • references/risk-disclaimer.md

Open the folder on GitHubat commit 61fe4f2

Compare with similar skills

Algorithm Engineer next to the 5 skills that share the most tags, products or categories with it. Stars are the repository's; “used in” counts other GitHub owners with a copy.

Algorithm Engineer compared with similar skills
SkillStarsUsed inTokensAuto-checkLicenceRepo updated
Algorithm Engineer this skilltheneoai/awesome-skills183—~1.8kAutomated safety check: PassMIT
Career-Ops Job Search Centercareer-ops-hq/career-ops74k—~3.3kAutomated safety check: PassMIT
Internship Project Preparation ToolLiuMengxuan04/shushu-internship-tool2.1k—~2.3kAutomated safety check: PassCustom licence
Interview Coachnoamseg/interview-coach-skill2.3k—~3.7kAutomated safety check: PassMIT
Job Application AssistantMadsLorentzen/ai-job-search45k—~1.2kAutomated safety check: NotesMIT
Algo Senseikaranb192/algo-sensei284—~1.7kAutomated safety check: PassMIT

Similar skills

  • Career-Ops Job Search Center

    career-ops-hq/career-ops

    Routes job-search requests to modes for evaluating offers, scanning portals, generating tailored CVs, tracking applications and drafting outreach, starting from a pasted job URL or description.

    74k GitHub stars~3.3k tokensUpdated yesterday
    Business, Finance & HRAuto-check passed
  • Internship Project Preparation Tool

    LiuMengxuan04/shushu-internship-tool

    Turns a target internship job description into a resume-ready, interview-ready project by finding and auditing GitHub projects and drafting resume bullets and interview Q&A.

    2.1k GitHub stars~2.3k tokensUpdated 3 mo ago
    Business, Finance & HRAuto-check passed
  • Interview Coach

    noamseg/interview-coach-skill

    High-rigor interview coaching skill for job seekers. An agent skill from noamseg/interview-coach-skill.

    2.3k GitHub stars~3.7k tokensUpdated 4 mo ago
    Business, Finance & HRAuto-check passed
  • Job Application Assistant

    MadsLorentzen/ai-job-search

    Evaluates job postings against your profile, then tailors a LaTeX CV and cover letter and prepares interview answers for the roles you pursue.

    45k GitHub stars~1.2k tokensUpdated 2 days ago
    Business, Finance & HRAuto-check: notes
  • Algo Sensei

    karanb192/algo-sensei

    Your personal DSA & LeetCode mentor. An agent skill from karanb192/algo-sensei.

    284 GitHub stars~1.7k tokensUpdated 5 days ago
    Business, Finance & HRAuto-check passed
  • Backend and Agent Project Selector

    lishuangqiang/backend-agent-resume-scout

    Finds backend or AI agent projects on GitHub that are worth putting on a resume, checks them against local source and writes a Markdown resume package.

    347 GitHub stars~1.4k tokensUpdated 3 mo ago
    Business, Finance & HRAuto-check passed

More from theneoai/awesome-skills

All 550 skills in this repo
  • Gerrit Permission Manager

    theneoai/awesome-skills

    Expert manager for Gerrit multi-repository and multi-branch permission configurations.

    183 GitHub stars~2.5k tokensUpdated 4 mo ago
    Auto-check passed
  • Abaqus Expert

    theneoai/awesome-skills

    Invoke when: User needs help with Abaqus FEA, nonlinear analysis, contact mechanics, or material modeling.

    183 GitHub stars~3.7k tokensUpdated 4 mo ago
    Auto-check passed
  • Abaqus Lhs Batch Dataset

    theneoai/awesome-skills

    Generate an Abaqus FEA training dataset for surrogate / ML models.

    183 GitHub stars~2.9k tokensUpdated 4 mo ago
    Auto-check: notes
  • Abaqus Odb To Grid CSV

    theneoai/awesome-skills

    Convert per-case Abaqus FEA outputs into ML-ready (X, Y) wide-table CSVs.

    183 GitHub stars~2.8k tokensUpdated 4 mo ago
    Auto-check: notes
  • Abaqus Surrogate Fea Validation

    theneoai/awesome-skills

    Closed-loop inverse-design validation. An agent skill from theneoai/awesome-skills.

    183 GitHub stars~3.4k tokensUpdated 4 mo ago
    Auto-check: notes
  • Academic Advisor

    theneoai/awesome-skills

    Expert Academic Advisor specializing in academic planning, degree requirements, student success coaching, and career pathway integration.

    183 GitHub stars~1.4k tokensUpdated 4 mo ago
    Auto-check passed

Questions about Algorithm Engineer

What does Algorithm Engineer do?

Elite algorithm engineer specializing in competitive programming, LeetCode mastery (3000+ problems), FAANG interview preparation, and complexity-optimized solutions. Algorithm Engineer is an agent skill from theneoai/awesome-skills. Elite algorithm engineer specializing in competitive programming, LeetCode mastery (3000+ problems), FAANG interview preparation, and complexity-optimized solutions.

When should I use Algorithm Engineer?

Algorithm Engineer fits situations like: data-structures; competitive-programming; faang-interview.

How do I install Algorithm Engineer in Claude Code?

Run `npx skills add theneoai/awesome-skills --skill algorithm-engineer -a claude-code`. Or copy the skill folder (skills/persona/tech/algorithm-engineer in theneoai/awesome-skills) into .claude/skills/algorithm-engineer in your project. Claude Code loads it when a task matches its description.

How do I install Algorithm Engineer in Codex?

Run `npx skills add theneoai/awesome-skills --skill algorithm-engineer -a codex`. Or copy the skill folder (skills/persona/tech/algorithm-engineer in theneoai/awesome-skills) into .agents/skills/algorithm-engineer in your project. Codex loads it when a task matches its description.

Can I use Algorithm Engineer in Cursor, Gemini CLI or GitHub Copilot?

Cursor, Gemini CLI, GitHub Copilot and OpenCode also load SKILL.md folders. With the skills CLI, run `npx skills add theneoai/awesome-skills --skill algorithm-engineer -a cursor` (or -a gemini-cli, github-copilot or opencode for the others). To copy it by hand, put the folder in .cursor/skills/algorithm-engineer, .gemini/skills/algorithm-engineer, .github/skills/algorithm-engineer and .opencode/skills/algorithm-engineer in your project.

What does Algorithm Engineer need to run?

SKILL.md names no scripts, command-line tools or credentials: Algorithm Engineer is instructions for the agent only. Our summary lists: Python 3.

Does Algorithm Engineer access the network?

SKILL.md contains no URLs. Any network use would come from the scripts or tools the agent runs. This is read from the text; nothing was executed.

Is Algorithm Engineer safe to install?

Our automated static check of SKILL.md found no risky patterns, such as piping downloads into a shell, reading credential files or hidden Unicode. It is not a guarantee. Review the folder before installing.

What licence does Algorithm Engineer use?

Algorithm Engineer is published under the MIT licence (declared in SKILL.md). It allows redistribution, so the full SKILL.md is shown on this page.

How many tokens does Algorithm Engineer use?

About 1.8k tokens (SKILL.md is roughly 7.2k characters). Agents keep only the skill's name and description in context until a task matches; then they load SKILL.md in full. Its references folder adds about 4.8k tokens, read only when the agent opens those files.

What are the alternatives to Algorithm Engineer?

Skills that share tags, products or a category with Algorithm Engineer: Career-Ops Job Search Center (career-ops-hq/career-ops, 74k stars), Internship Project Preparation Tool (LiuMengxuan04/shushu-internship-tool, 2.1k stars), Interview Coach (noamseg/interview-coach-skill, 2.3k stars) and Job Application Assistant (MadsLorentzen/ai-job-search, 45k stars). The comparison table on this page puts their stars, adoption, token cost, safety result and licence side by side.

Who maintains Algorithm Engineer?

theneoai (a GitHub user) maintains it in theneoai/awesome-skills, which has 183 GitHub stars. The repository holds 550 skills in this directory. The repository was last updated on May 15, 2026.

Source: theneoai/awesome-skills on GitHub. Facts on this page come from the repository at the commit we read; the author's words are quoted as theirs.