 <blockquote> <p>What's the easiest method to solve this?</p> </blockquote> <p>Brute force.</p> <p>Compute all products of 3 numbers in N choose 3 time, and then take the maximum.</p> <p>How big is your input? You could reuse products of 2 numbers with a memoizing (dynamic programming) approach.</p>