Longest Arithmetic Subsequence — Solution & Editorial | Jobs at Avian IT

Hiring process8 levels

1 IQ Test
2 Additional Online Test (If Required)
3 Office Interview with Hiring Manager
4 Unpaid Test Task (Motivation Check)
5 Paid Test Task and Follow-Up Interview
6 Iterative Paid Test Tasks
7 Office Verification
8 Final Interview with the Founder

Problems > Longest Arithmetic Subsequence > Editorial

Longest Arithmetic Subsequence — Solution & Editorial

Back to the Problem

dp[i][d] = longest AP ending at i with common difference d; for each pair (j, i) extend dp[j][a_i−a_j]. Store the per-index difference map.

Complexity: O(N²)