← Zoho questions

Least prime number addition for divisibility

Filed under Zoho

Given two arrays of equal length, find the smallest prime number p < 1000 such that for every index i, (arr1[i] + p) is divisible by arr2[i]. For this specific problem, consider 1 as a prime number…

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 Zoho questions

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