- Message Route (CSES)
- Bear and Forgotten Tree 2 (Codeforces)
- Flipping Frustration (UVa)
- Underground Lab (Codeforces)
This is a good way to test the use of parent pointers in your BFS implementation and figuring out the distance between two given vertices in a simple, undirected and unweighted graph.
(More problems to be added soon. Suggestions welcome too!)