algorithms-and-data-structures

What problem does it solve?

This Skill prevents hidden performance traps, incorrect data structure choices, and unexamined algorithmic complexity from slipping into Python code, data pipelines, and ML feature work. It helps you reason about correctness first, then optimize with clear justification instead of guesswork.

Core Features & Use Cases

• Complexity Discipline: Requires explicit time and space complexity thinking before implementation, including justification for any quadratic or recursive approach.
• Data Structure Selection: Pushes the right tool for the job, such as sets for membership tests, dictionaries for lookups, heaps for min or max selection, and deques for efficient double-ended operations.
• Standard Library First: Encourages built-in implementations like sorting, bisect, heapq, itertools, and Counter before custom code is written.
• Performance-Aware Python: Promotes vectorization, profiling, and elimination of expensive loops or repeated work in production code.
• Use Case: Ideal when reviewing an algorithmic function, designing a graph traversal, improving a slow data transformation, or implementing dynamic programming with clear recurrence and memory reasoning.

Quick Start

Ask the assistant to apply the algorithms-and-data-structures skill to your code and produce a corrected implementation with complexity notes, justified data structures, and optimized Python idioms.