# Homework 16 - Datastrukturer Lägg lösningar i ett repo som heter **kth-id**-datastructures Lös minst 2 av följande kattisuppgifter: [Fenwick](https://kth.kattis.com/courses/DD2016/plusplus24/assignments/cxgoe2/problems/fenwick) [Union-Find](https://kth.kattis.com/courses/DD2016/plusplus24/assignments/cxgoe2/problems/unionfind) [Guess the datastructure](https://kth.kattis.com/courses/DD2016/plusplus24/assignments/cxgoe2/problems/guessthedatastructure) [Kötid](https://po.kattis.com/problems/kotid) (segmentträd) [Aladin](https://kth.kattis.com/courses/DD2016/plusplus24/assignments/cxgoe2/problems/aladin) (lata segmentträd, https://github.com/kth-competitive-programming/kactl/blob/master/content/number-theory/ModSum.h) ## resurser [Slides](https://docs.google.com/presentation/d/1mbCnVtq6CPOkgKKgAknysoDlnodhtDczOSHZRu63KoI/edit?usp=sharing) [Lite överkurs om hur man optimerar bloomfilter](https://brilliant.org/wiki/bloom-filter/)