2. Arrays, Sequences, Words

In Chapter 2 we will implement fundamental algorithms for arrays like Most Valuable Subinterval, Next Greater Element, and Longest Increasing Subsequence. We will take the time to implement easy-to-understand but inefficient algorithms first and then proceed to cleverer efficient algorithms. Every implementation is accompanied by writing test cases.