Subsequences, grid treasure path, and road closure optimization
Filed under Blogvault
The question
Solve three problems: count subsequences of form a^i b^j c^k, determine if a treasure in a grid can be reached in k turns, and choose 2 roads to close from M roads between N villages for maximum happiness.
No write-up yet. Related questions below have one.
Related Blogvault questions
Collected from public candidate posts and coding forums. Updated Nov 2026.