Live briefing
Everything about Range minimum query
Minimizing problem in computer programming
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 and the longest common prefix problem (LCP). Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Range minimum queryA 5-minute orientation
- Pick up a classic book: Eloquent JavascriptThe most-reprinted book on the subject
- Read the landmark paper: A simple linear-space data structure for constant-time range minimum queryCited 4 times
- Go sideways: Lowest common ancestorA closely related topic
- Go sideways: Range query (computer science)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
Eloquent JavascriptMarijn Haverbeke · 2009
Algorithm Design and ApplicationsMichael T. Goodrich, Roberto Tamassia · 2014
International Conference on Advances in Pattern RecognitionSameer Singh · 1999
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Lowest common ancestor In graph theory and computer science, the lowest common ancestor (LCA) (also called least common ancestor) of two nodes v and w in a tree or directed acyclic…
- Range query (computer science) In computer science, the range query problem consists of efficiently answering several queries regarding a given interval of elements within an array.…
- LCP array In computer science, the longest common prefix array (LCP array) is an auxiliary data structure to the suffix array. It stores the lengths of the longest…
- Range mode query In data structures, the range mode query problem asks to build a data structure on some input data to efficiently answer queries asking for the mode of…
- Cartesian tree In computer science, a Cartesian tree is a binary tree derived from a sequence of distinct numbers. To construct the Cartesian tree, set its root to be…
- Level ancestor problem In graph theory and theoretical computer science, the level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure…
- Suffix array In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compres…
- Succinct data structure In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound…