When should I use the Data Structure Architect skill?

Use this skill when you need to choose or implement a data structure that meets specific performance, memory, or concurrency constraints that standard libraries cannot satisfy.

How does it handle hash table implementation?

The skill guides you through selecting optimal load factors and collision strategies such as chaining, open addressing, Robin Hood hashing, or cuckoo hashing based on your specific use case.

Can this skill help with range query performance?

Absolutely. It provides specific patterns for implementing Segment trees with lazy propagation and Fenwick trees for efficient prefix-sum operations.

Does it support probabilistic data structures?

Yes, it includes specialized guidance for implementing Bloom filters, Count-Min Sketch, and HyperLogLog for space-efficient data estimation and membership testing.

Data Structure Architect

Name: Data Structure Architect
Author: rnavarych

byrnavarych

•

開発者ツール

Implements and optimizes high-performance data structures ranging from balanced trees to probabilistic filters for complex algorithmic challenges.

The Data Structure Architect skill empowers Claude to design, implement, and select the most efficient data structures for specialized performance requirements. It covers a vast range of structures including various hash table strategies, balanced BSTs like Red-Black and B-trees, advanced heaps, and specialized trees like Segment and Fenwick trees. Beyond standard collections, it provides expertise in probabilistic structures such as Bloom filters and HyperLogLog for memory-efficient estimations, as well as Union-Find for connectivity problems, ensuring your code achieves optimal memory access patterns and algorithmic complexity.

主な機能

01Expert selection of hash collision strategies including Robin Hood and Cuckoo hashing

0211 GitHub stars

03Range query and prefix operation optimization using Segment and Fenwick trees

04Advanced heap management using Fibonacci and Pairing heaps for priority operations

05Implementation of balanced search trees and disk-optimized B-trees for storage systems

06Memory-efficient data estimation with Bloom filters and HyperLogLog

ユースケース

01Optimizing interleaved range queries and prefix operations in large numerical datasets

02Implementing efficient connectivity tracking and equivalence classes for graph-based logic

03Designing custom high-performance collection libraries or low-level caching mechanisms

What are Skills?·How to Install

Install with 🐟 Skill.Fish

npx skillfish add rnavarych/alpha-engineer data-structures

For use in Claude.ai and ChatGPT

主な機能

01Expert selection of hash collision strategies including Robin Hood and Cuckoo hashing

0211 GitHub stars

03Range query and prefix operation optimization using Segment and Fenwick trees

04Advanced heap management using Fibonacci and Pairing heaps for priority operations

05Implementation of balanced search trees and disk-optimized B-trees for storage systems

06Memory-efficient data estimation with Bloom filters and HyperLogLog

ユースケース

01Optimizing interleaved range queries and prefix operations in large numerical datasets

02Implementing efficient connectivity tracking and equivalence classes for graph-based logic

03Designing custom high-performance collection libraries or low-level caching mechanisms