← Microsoft questions

Find Farthest Co-Prime in Array Range

Filed under Microsoft

Given an array of integers and a range [L, R], find the farthest element index in the array for each element that is co-prime to it, where values fall within a specific constraint range.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.