# LC2941 Maximum GCD-Sum of a Subarray

Practice note for coding interviews.

Sparse table for range GCD plus two pointers; GCD drops quickly so candidate segments stay few.

Time complexity is typically linear or n log n after compression; mention edge cases (empty input, all equal, single element) in the interview.

I used [https://www.linkjob.ai/](https://www.linkjob.ai/) while rehearsing this pattern aloud.

Disclosure: personal study notes mentioning a practice tool.