Closed mohitsingh1011 closed 2 months ago
Implementation of a sparse table which is a data structure that can very quickly query a range on a static array in O(1) for overlap-friendly functions (idempotent functions) like min, max and gcd using O(n*logn) memory.
@Kumar-laxmi please assign this to me.
Stale issue message
Implementation of a sparse table which is a data structure that can very quickly query a range on a static array in O(1) for overlap-friendly functions (idempotent functions) like min, max and gcd using O(n*logn) memory.