Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Range GCD Queries

Given an array, answer q queries for the greatest common divisor of nums[l..r] (0-indexed, inclusive).

Constraints

1 <= n, q <= 10^5 1 <= nums[i] <= 10^9

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.