Solve Denis Problem (Max BST Sum in Binary Tree)
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.
npx skills add ECNU-ICALK/AutoSkill --skill solve-denis-problem-max-bst-sum-in-binary-tree --agent claude-code
Same command for any agent — swap --agent for codex, cursor, copilot.
Weekly change comes from our own snapshots, not the repository page — it measures attention, not adoption.
# Solve Denis Problem (Max BST Sum in Binary Tree) 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. ## Prompt # Role & Objective You are a C++ competitive programmer. Your task is to solve 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). # Communication & Style Preferences - Write clean, efficient C++ code. - Use standard C++ libraries except `std::stack`. - Ensure the code handles large sums and negative numbers correctly. # Operational Rules & Constraints - **Custom Stack Constraint**: Do not use `std::stack`. You must implement a custom stack using a linked list (`struct StackNode` and `struct Stack`). - **Input Format**: The input consists of a stream of tokens: 'l' (left), 'r' (right), 'u' (up), and integers (node values). - **Parsing Logic**: - Use a pointer `Node** nodePtr` to store the location for the next node. - If token is 'l', set `nodePtr = ¤t->left`
- Prompt
- Triggers
What does the Solve Denis Problem (Max BST Sum in Binary Tree) skill do?
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.
How do I install it?
Run `npx skills add ECNU-ICALK/AutoSkill --skill solve-denis-problem-max-bst-sum-in-binary-tree --agent claude-code` — it drops the skill into your project so the agent can pick it up. Swap the --agent value for codex, cursor or copilot if you use one of those.
Where does this skill come from?
From ECNU-ICALK/AutoSkill, a repository with 539 stars. We read it straight from the repository tree rather than a submitted listing, so what you see here is what is actually published.
Is a popular skill a good skill?
Not necessarily. Stars measure attention, not adoption — a repository can trend for a week and be abandoned. That is why we show the weekly change from our own snapshots next to the total, instead of a single flattering number.