Available question text
Count the number of arithmetic subsequences (length ≥ 3) in an array — subsequences whose consecutive differences are all equal. The typical solution uses DP with a map at each index that tracks counts of subsequences ending there by difference, extending prior pairs in O(n^2) time and O(n^2) space.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 446. Arithmetic Slices II - Subsequence
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source