Z. Extras

Getting Started with Competitive Programming

(an NPTEL course)

Module Z. Extras

  1. Message Route (CSES)
  2. 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.

  3. Bear and Forgotten Tree 2 (Codeforces)
  4. Flipping Frustration (UVa)
  5. Underground Lab (Codeforces)

(More problems to be added soon. Suggestions welcome too!)

super-embed:<div id="hyvor-talk-view"></div><script async defer type="text/javascript" src="//talk.hyvor.com/web-api/embed.js"></script>