Array Algorithmic Patterns

This skill provides Claude with specialized templates and guidance for executing production-grade array algorithms with optimal time and space complexity. It covers essential patterns such as two-pointer approaches (fast/slow and converging), sliding window techniques (fixed and variable size), and prefix sum calculations for efficient range queries. By using this skill, developers can ensure their array-based logic follows O(n) patterns, includes robust parameter validation, and follows standardized debugging checklists to eliminate common off-by-one errors and infinite loops.

Key Features

Use Cases