Leetcode 2447. Number of Subarrays With GCD Equal to K

Count the number of contiguous subarrays whose greatest common divisor equals k. Exploit that the running GCD of a subarray only decreases, so for each start index you can extend while maintaining/updating the GCD and stop early when it drops below or is no longer a multiple of k (O(n^2) viable for n ≤ 1000).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2447. Number of Subarrays With GCD Equal to K

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact