The problem we will solve is that given a set of integers in **sorted order**, find length of **longest arithmetic progression** in that set. This can be solved by brute force in O(N^3) while a dynamic programming approach with take O(N^2) time complexity.

**Read this article to understand how to find the Longest Arithmetic Progression using Dynamic Programming**

**Have a doubt or thought? Join the discussion now**

This is a companion discussion topic for the original entry at http://iq.opengenus.org/longest-arithmetic-progression/