NeetCode #22LC-624MediumArrays & HashingNC Algo100
← Back to All Problems#22 · #624 · Maximum Distance in Arrays(数组列表中的最大距离)
📌 Problem Statement & Constraints
You are given
m arrays, each sorted in ascending order. Pick exactly one integer from two different arrays and maximise |a - b|. Return the maximum possible distance. Constraints: 2 <= m <= 10^5, 1 <= arrays[i].length <= 500, each array is sorted ascending.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!