algo-basic-algorithms

SKILLFlujo de trabajocomunidad
v0.0.0Pavel-KravchenkoUnknownActualizado hace 1 mFuente →

Compute GCD/LCM via Euclid's algorithm, find roots with Newton's method, and count k-mers using dict/Counter vs O(n^2) list-scan. Use for GCD/LCM math, root-finding, k-mer counting, or Big-O complexity questions.

Community-submitted skill. Not yet reviewed by the Forge team. Full prompt content may not be available.Request review →
4Estrellas del repo
1Clientes
1Formatos
hace 1 mÚltima actualización
Skill
AutorPavel-Kravchenko
Versión0.0.0
LicenciaUnknown
CategoríaFlujo de trabajo
Formatosskill.md
PromptNo publicado
Compatibilidad
Claude✓ Compatible
Cursor—
Copilot—
ChatGPT—
Gemini—
Acerca de

Compute GCD/LCM via Euclid's algorithm, find roots with Newton's method, and count k-mers using dict/Counter vs O(n^2) list-scan. Use for GCD/LCM math, root-finding, k-mer counting, or Big-O complexity questions.

Palabras clave
skillclaude