OpenParable
Skip to content
← Back to skills

String Algorithm Matcher

Development
string-algorithm-matcher

String Algorithm Matcher is an Agent Skill for development published in the a5c-ai/babysitter repository on GitHub: a SKILL.md instruction file an AI agent can load to do this task.

Match string problems to appropriate algorithms

View on GitHub ↗
QUICK START

How to use this skill

Bring this guide into your coding agent with a prompt tailored to the tool you use.

  1. Open your project in Codex.
  2. Copy and paste the prompt below.
  3. Review files and risks before approving any action.
Prompt to paste
Inspect the Agent Skill at https://github.com/a5c-ai/babysitter/blob/HEAD/library/specializations/algorithms-optimization/skills/string-algorithm-matcher/SKILL.md and all supporting files. Report provenance, permissions, scripts, dependencies, and security risks. Propose an exact installation into .agents/skills/string-algorithm-matcher, but wait for my approval before writing files or running scripts.

Copying this prompt does not install or run the skill. Review third-party files before use.

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

ScenarioAlgorithmComplexity
Single patternKMPO(n+m)
Multiple patternsAho-CorasickO(n+m+z)
Approximate matchRolling HashO(n*m) average

Suffix Structures

NeedStructureBuild Time
Substring searchSuffix ArrayO(n log n)
Multiple queriesSuffix TreeO(n)
Subsequence countingSuffix AutomatonO(n)

Palindromes

ProblemAlgorithm
Longest palindromic substringManacher
Palindrome partitioningDP + Manacher
Palindrome queriesHashing

Input Schema

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

Output Schema

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