CodingEasy
Find maximum magic number value based on smaller element counts
Filed under Sabre
The question
Given an array of integers, find the maximum value G where G is the maximum prime divisor of x, with x being the number of elements in the array strictly smaller than a given element A[i].
No write-up yet. Related questions below have one.
Related Sabre questions
Collected from public candidate posts and coding forums. Updated Nov 2026.