SparseTable Implementation on Rust

SparseTable is an fascinating data structure. It can build index for an Array in O(n*log2(n)) and then query the range max query in O(1) time, Which is really fast.