According to Wikipedia, in computing and graph theory, a dynamic connectivity structure is a data structure that dynamically maintains information about the connected components of a graph. Introduction In other words, a Dynamic connectivity Problem is a problem in which ...

Dynamic programming – the one thing that makes every participant in competitive programming scratch their heads. In general, most programming competitions will have one dynamic programming question. It can be referred to as the problem which is there for the ...

Coding Ninja has raised its bars to yet another course, we’ll be launching Eminence the online competitive programming course from 1st October. Registrations are open, the early bird discount lasts till 20th September. Grab it now! Why is Competitive programming ...