A. Prerequisites

Getting Started with Competitive Programming

(an NPTEL course)

Module A. Prerequisites

The presentations in this week are largely self-contained.

If you are curious, especially about the theoretical aspects of DSU, then you can read up on the chapter Disjoint Sets from Erickson's Algorithms, or go through the notes here.

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