AlgorithmsThread 5: Persistent Data Structures

Правка en5, от SecondThread, 2020-07-10 02:32:02

AlgorithmsThread 5: Persistent Data Structures

Hello everyone! I just uploaded Episode 5 of Algorithms Dead in which I talk about persistent data structures. I talk about the ASC problem involving a persistent queue, describe how persistent segment trees work, and provide some interesting problems that can be solved and then optimized with persistent segment trees.

Some problems discussed in this video if you are interested in solving them yourself:

Harder PST problems (not covered in the episode but good practice):

Let me know if you have any questions of suggestions for how I can improve the series!

Теги algorithmsthread

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский SecondThread 2020-07-10 02:32:02 8 Tiny change: 'hmsThread Episode 5: Persis' -> 'hmsThread 5: Persis'
en4 Английский SecondThread 2020-07-10 02:31:30 11 Tiny change: 'hmsThread 5: Persis' -> 'hmsThread Episode 5: Persis'
en3 Английский SecondThread 2020-07-10 01:32:19 5 Tiny change: 'Algorithms Dead 5: Per' -> 'AlgorithmsThread 5: Per'
en2 Английский SecondThread 2020-07-10 01:31:43 5
en1 Английский SecondThread 2020-07-02 20:51:11 1052 Initial revision (published)