Available question text
Count the number of length-4 subsequences (p<q<r<s) with q-p, r-q, s-r >= 2 such that nums[p]*nums[r] == nums[q]*nums[s]. The core challenge is efficiently counting equal pairwise products across index splits while respecting the required spacing (n ≤ 1000, nums[i] ≤ 1000).
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 3404. Count Special Subsequences
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source