algo-hash-tables-bloom

SKILLWorkflowcommunity
v0.0.0Pavel-KravchenkoUnknownUpdated 1mo agoSource →

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 stars
1Clients
1Formats
1mo agoLast update
Skill
AuthorPavel-Kravchenko
Version0.0.0
LicenseUnknown
CategoryWorkflow
Formatsskill.md
PromptNot published
Compatibility
Claude✓ Supported
Cursor—
Copilot—
ChatGPT—
Gemini—
About

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.

Keywords
skillclaude