Sparse Table Algorithm Range Minimum Query

https://www.facebook.com/tusharroy25
https://github.com/mission-peace/interview/blob/master/src/com/interview/misc/SparseTableRangeMinimumQuery.java
https://github.com/mission-peace/interview/wiki

In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range minimum queries have several use cases in computer science such as the lowest common ancestor problem or the longest common prefix problem (LCP).

Видео Sparse Table Algorithm Range Minimum Query канала Tushar Roy - Coding Made Simple