Skip to content
Back to skills

String Algorithm Matcher

ASecurity

Match string problems to appropriate algorithms

  • 1,760 stars
  • 0 votes
  • 0 copies
  • 2 views
  • Added September 2, 2026
ai-agentsgobackend

Security analysis

A100/100

Pro scans all 2 files and shows the line behind each finding

Scanned September 2, 2026

npx -y skills add a5c-ai/babysitter --skill string-algorithm-matcher --agent claude-code

Installs into .claude/skills of the current project.

Are you the author of String Algorithm Matcher?

Add the live security badge to your README. It updates with every re-scan.

Security grade badge for String Algorithm Matcher
[![Security: A — Skills Directory](https://www.skillsdirectory.com/api/skills/a5c-ai-string-algorithm-matcher-babysitter/badge)](https://www.skillsdirectory.com/skills/a5c-ai-string-algorithm-matcher-babysitter)

More formats (shields.io, HTML) on the badges page. Keep it an A: scan every change in CI with Pro.

Download with Pro
SKILL.md
---
name: string-algorithm-matcher
description: Match string problems to appropriate algorithms
allowed-tools:
  - Read
  - Write
  - Grep
  - Glob
graph:
  domains: [domain:computer-science]
  specializations: [specialization:algorithms-optimization]
  skillAreas: [skill-area:string-matching, skill-area:dynamic-programming]
  roles: [role:backend-engineer, role:computational-scientist]
---

# String Algorithm Matcher Skill

## Purpose

Match string processing problems to the most appropriate algorithms based on requirements and constraints.

## Capabilities

- Pattern matching algorithm selection (KMP, Z, Rabin-Karp)
- Suffix structure selection (array vs tree vs automaton)
- Palindrome detection algorithm selection
- Rolling hash implementation guidance
- String DP technique matching

## Target Processes

- pattern-matching-algorithms
- trie-suffix-structures
- string-processing

## Algorithm Selection Guide

### Single Pattern Matching
| Scenario | Algorithm | Complexity |
|----------|-----------|------------|
| Single pattern | KMP | O(n+m) |
| Multiple patterns | Aho-Corasick | O(n+m+z) |
| Approximate match | Rolling Hash | O(n*m) average |

### Suffix Structures
| Need | Structure | Build Time |
|------|-----------|------------|
| Substring search | Suffix Array | O(n log n) |
| Multiple queries | Suffix Tree | O(n) |
| Subsequence counting | Suffix Automaton | O(n) |

### Palindromes
| Problem | Algorithm |
|---------|-----------|
| Longest palindromic substring | Manacher |
| Palindrome partitioning | DP + Manacher |
| Palindrome queries | Hashing |

## Input Schema

```json
{
  "type": "object",
  "properties": {
    "problemDescription": { "type": "string" },
    "problemType": {
      "type": "string",
      "enum": ["patternMatch", "suffixQueries", "palindrome", "subsequence", "dp"]
    },
    "constraints": { "type": "object" }
  },
  "required": ["problemDescription"]
}
```

## Output Schema

```json
{
  "type": "object",
  "properties": {
    "success": { "type": "boolean" },
    "algorithm": { "type": "string" },
    "complexity": { "type": "string" },
    "alternatives": { "type": "array" },
    "implementation": { "type": "string" }
  },
  "required": ["success", "algorithm"]
}
```

Files in this skill

  • README.md738 B
  • SKILL.md2.2 KB

Attribution

Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.

Comments

Loading comments…