Add practice problems for Range Minimum Query article (cp-algorithms#134)

devagentx · tcNickolas · commit a5be96f4e570 · 2016-10-30T19:20:22.000-07:00
diff --git a/src/sequences/rmq.md b/src/sequences/rmq.md
@@ -22,3 +22,7 @@ From the list of data structures described on this site, you can choose:
 Note: Preprocessing is the preliminary processing of the given array by building corresponding data structure for it.
 
 If the array $A$ might change during the runtime (i.e. there will also be queries to change values in some interval), the problem can only be solved by [Sqrt-decomposition]() or [Segment tree]().
+
+## Practise Problems on RMQ
+- [SPOJ: Range Minimum Query](http://www.spoj.com/problems/RMQSQ/)
+- [CODECHEF: Chef And Array](https://www.codechef.com/problems/FRMQ)
