Given an array of **n** positive integers. The task is to count the number of Arithmetic Progression subsequence in the array.

**Read this article to understand how to find the number of arithmetic progression subsequences in a given set of numbers 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/number-of-arithmetic-progression-subsequences-in-a-given-set-of-numbers/