Design algorithms with formal modeling, strategy selection, and complexity analysis.
npx skills add https://github.com/truongnat/skills --skill algorithm-pro
Please help me install this Agent Skill. Skill: algorithm-pro Source: https://github.com/truongnat/skills/tree/main/skills/algorithm-pro Command: npx skills add https://github.com/truongnat/skills --skill algorithm-pro
Professional algorithm design and correctness reasoning guidance for tackling hard coding interview style problems, formal modeling, and performance trade-offs.
Provide an end-to-end algorithm design solution for a given problem, including modeling, strategy, and complexity trade-offs.
High-intent search queries and answers about installing and using this skill.
Algorithm design requires formal problem modeling, strategy selection among DP, greedy, or graph approaches, and invariant proofs to ensure correctness. This yields an end-to-end solution with explicit complexity and resource usage derivations for rigorous performance analysis.
Choosing between DP and greedy strategies requires analyzing problem constraints and optimal substructure. This analysis identifies whether local optimal choices guarantee global optimality, providing a formal strategy selection with rigorous complexity reasoning and trade-offs.
Modeling graph search algorithms involves formal problem definition and explicit complexity derivation. This process evaluates resource usage and performance trade-offs, ensuring the algorithmic solution integrates efficiently into production systems.
Formal algorithm modeling and invariant proofs are highly effective for coding interview preparation. They guide strategy selection and rigorous performance analysis, helping you solve deep algorithm design and correctness reasoning tasks.
Rigorous performance analysis requires explicit complexity derivation and formal resource usage modeling. Without these derivations, algorithmic solutions lack the formal trade-off evaluation needed for production contexts and correctness verification.
yfyang86Generate a probabilistic primality test using Rabin's randomness with standard Python libraries.
rainoftimeGenerate type checkers from formal type system specifications with soundness proofs.
pluginagentmarketplaceDesign and implement efficient C++ algorithms and data structures.
ArabelaTsoGenerate executable code with formal proofs in Isabelle/HOL or Coq.
