algo-hash-tables-bloom

SKILLWorkflowCommunity
v0.0.0Pavel-KravchenkoUnknownAktualisiert vor 1 Mon.Quelle →

Implement Python hash tables (chaining, open addressing, rehashing) and Bloom filters for set membership. Use when building a hash table from scratch, resolving hash collisions, sizing a Bloom filter, or checking k-mer/key set membership under memory limits.

Community-submitted skill. Not yet reviewed by the Forge team. Full prompt content may not be available.Request review →
4Repo-Sterne
1Clients
1Formate
vor 1 Mon.Letzte Aktualisierung
Skill
AutorPavel-Kravchenko
Version0.0.0
LizenzUnknown
KategorieWorkflow
Formateskill.md
PromptNicht veröffentlicht
Kompatibilität
Claude✓ Unterstützt
Cursor—
Copilot—
ChatGPT—
Gemini—
Über

Implement Python hash tables (chaining, open addressing, rehashing) and Bloom filters for set membership. Use when building a hash table from scratch, resolving hash collisions, sizing a Bloom filter, or checking k-mer/key set membership under memory limits.

Schlagwörter
skillclaude