Find the Number of Subsequences With Equal GCD: coding question

Available question text

Count the number of ordered pairs of disjoint non-empty subsequences (seq1, seq2) of nums whose elements have the same GCD, returning the result modulo 10^9+7 (n ≤ 200, nums[i] ≤ 200). The core challenge is to aggregate subsequences by their GCD (bounded by 200) and combine those counts efficiently to count disjoint pairs.

Continue with questions that share topics or the same question type.

Number of Subarrays With GCD Equal to K
Coding
Check if All Characters Have Equal Number of Occurrences
Coding
Check if Number Has Equal Digit Count and Digit Value
Coding
Check if There is a Path With Equal Number of 0's And 1's
Coding

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 3336. Find the Number of Subsequences With Equal GCD
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Find the Number of Subsequences With Equal GCD

Available question text

Related questions

Find the Number of Subsequences With Equal GCD

Available question text

Related questions