Persistent Data Structures || Indian Programming Camp 2020 - Advanced Track || Tanuj Khattar

preview_player
Показать описание
In this lecture, Tanuj will discuss the concept of Persistence in Data Structures. Specifically, we'll look at various methods of making Segment Trees persistent and discuss their implementation.

The Indian Programming Camp is a 3-day programming camp by CodeChef to enable learners to better their programming skills. We will have live classes and problem-solving by some of the top-rated programmers in the country. The Advanced track will focus on Flows, Suffix Structures, Persistent Centroid Decomposition, FFT & Variants, Segment Tree Beats, etc.
Рекомендации по теме
Комментарии
Автор

Amazing content. I think version control systems like Git, GITHUB, Git Lab and other less popular ones are based on this

shreyanshshukla
Автор

Great Content, Where can i find the code ?

arunakshatalukdar