CodingEasy
Maximum Index Difference
Filed under Samsung
The question
Given an integer array of length n, find the maximum index difference j - k such that array[j] meets the specified condition relative to array[k]. Return -1 if no such pair exists.
No write-up yet. Related questions below have one.
Related Samsung questions
Collected from public candidate posts and coding forums. Updated Nov 2026.