LeetCode Question · Jan 2021 · Bangalore

Amazon | OA | Prime Air time

17 upvotes 30,596 views 28 replies

Question Details

Position: SDE 1 Location: Bengaluru, India. YoE: 1 year 3 months. Platform: Hackerrank Problem: This problem is a variant of closest pair sum. You\'ll be given two arrays arr1 = { {1, 2000}, {2, 3000},...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Math