algo-basic-algorithms

SKILLFlusso di lavorocommunity
v0.0.0Pavel-KravchenkoUnknownAggiornato 1 mesi faFonte →

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 →
4Stelle del repo
1Client
1Formati
1 mesi faUltimo aggiornamento
Skill
AutorePavel-Kravchenko
Versione0.0.0
LicenzaUnknown
CategoriaFlusso di lavoro
Formatiskill.md
PromptNon pubblicato
Compatibilità
Claude✓ Supportato
Cursor—
Copilot—
ChatGPT—
Gemini—
Descrizione

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.

Parole chiave
skillclaude