Strings -> Eertree / Palindromic Tree
Append-only palindrome dictionary with one node per distinct palindrome and suffix links over palindromic suffixes.
- Topic slug:
strings/eertree
- Tutorial page: Open tutorial
- Ladder page: Open ladder
- Repo problems currently tagged here:
1
- Repo companion pages:
4
- Curated external problems:
3
Microtopics
- eertree
- palindromic-tree
- distinct-palindromes
- palindromic-suffix-chain
- longest-palindromic-suffix
- append-only-palindrome-structure
Learning Sources
Practice Sources
Repo Companion Material
Curated External Problems
Core
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| Palindromes and Super Abilities |
Timus |
Medium |
Distinct Palindromes |
Online Append; Data Structure; Per-Prefix Counting |
Palindrome Basics; Suffix Links; Append-Only Updates |
Palindromic Tree; Append-Only String; Per-Prefix Output |
The cleanest first exact Eertree problem because each prefix answer is just the number of ordinary nodes after one append update. |
Practice
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| eertree |
Library Checker |
Medium |
- |
Verification; Construction |
Eertree Basics; Suffix-Link Walk; Distinct Palindrome Nodes |
Palindromic Tree; Construction |
Official verifier for the exact family; useful once the basic append-only invariants feel stable. |
Stretch
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| Palindromic characteristics |
Codeforces |
Hard |
DP |
DP; Palindrome Structure |
Eertree Basics; Palindrome DP; Distinct Palindrome Worldview |
Palindrome; Distinct Structure |
A strong stretch problem once the basic tree is trusted and you are ready to layer extra palindrome DP on top. |
Repo Problems
| Code |
Title |
Fit |
Difficulty |
Pattern |
Note |
Solution |
DISTINCTPALINDROMICSUBSTRINGS |
Distinct Palindromic Substrings |
primary |
medium |
- |
Note |
Code |
Regeneration
python3 scripts/generate_problem_catalog.py