Leetcode 1027. Longest Arithmetic Subsequence

Find the length of the longest subsequence of nums whose consecutive elements have the same difference (i.e., form an arithmetic progression). With n up to 1000, this is typically solved by pairwise dynamic programming that tracks, for each index and difference, the longest arithmetic subsequence ending there (O(n^2) time).