Time complexity of Sparse table query
I am little confused on time complexity of a query in sparse table. I got conflicting answers from two sources. On hackerearth O(logn) (link) is mentioned and on geeksforgeeks O(1) (link) is mentioned.
Can anyone tell me the correct time complexity?
CF Edu Round 195 Solution Discussion