CodingMedium
Array elements at k distance represented as sum of k primes
Filed under Sabre
The question
Given two integer arrays A and B of size m and n, compute the sum of elements at every k distance in A. Check if this sum can be represented as the sum of k prime numbers. If yes, print the union of A and B; otherwise, print the intersection.
No write-up yet. Related questions below have one.
Related Sabre questions
Collected from public candidate posts and coding forums. Updated Nov 2026.