Solve Denis Problem (Max BST Sum in Binary Tree)
100 / 100 · Low risk
Fine to try.
Solves the 'Denis' problem: finding the maximum sum of a Binary Search Tree (BST) subtree in a binary tree constructed from a sequence of commands ('l', 'r', 'u', and integers), using a custom stack implementation and handling negative numbers.
What this skill can do
We found nothing in the files we read that matches our rules. That does not prove the skill is safe: see the limits of static scanning.
Install
Paste this into your terminal. It downloads exactly the version we scanned, not whatever is newest.
if [ -e ~/.agents/skills/'solve-denis-problem-max-bst-sum-in-binary-tree' ] || [ -L ~/.agents/skills/'solve-denis-problem-max-bst-sum-in-binary-tree' ]; then echo 'A skill folder named solve-denis-problem-max-bst-sum-in-binary-tree already exists — not replacing it' >&2; false; else d=$(mktemp -d) && git clone --quiet --filter=blob:none --no-checkout 'https://github.com/ECNU-ICALK/AutoSkill' "$d" && git -C "$d" checkout --quiet '94c47ca488d4ba4117d20272e66d49b9877e68cf' -- 'SkillBank/ConvSkill/english_gpt4_8/solve-denis-problem-max-bst-sum-in-binary-tree' && mkdir -p ~/.agents/skills && cp -R "$d"/'SkillBank/ConvSkill/english_gpt4_8/solve-denis-problem-max-bst-sum-in-binary-tree' ~/.agents/skills/'solve-denis-problem-max-bst-sum-in-binary-tree' && rm -rf "$d"; fi
Codex reads ~/.agents/skills directly. For Claude Code, Cursor, Copilot, Gemini CLI, Antigravity or OpenCode, also link it. For Claude Code: ln -s ~/.agents/skills/'solve-denis-problem-max-bst-sum-in-binary-tree' ~/.claude/skills/'solve-denis-problem-max-bst-sum-in-binary-tree' (other agents: ~/.cursor/skills, ~/.copilot/skills, ~/.gemini/skills, ~/.gemini/config/skills, ~/.config/opencode/skills). Or install through the finder skill, which does both.
Badge for your README
[](https://zalavijaysinh.github.io/skilltrust/repos/ECNU-ICALK/AutoSkill/)
Score history
| Date | Version | Score |
|---|---|---|
| 2026-11-08 | 94c47ca | 100 |
| 2026-11-07 | 94c47ca | 100 |