Leetcode 1819. Number of Different Subsequences GCDs

Count how many distinct integers g exist such that some non-empty subsequence of the given array has GCD equal to g. Input size can be up to 1e5 with values up to 2e5, so you must reason over possible gcds (typically in the range 1..max(nums)) rather than enumerating all subsequences.