I gave the written round so far. The exam was on HackerEarth with two not-so-difficult questions.

Both were medium-level questions from LeetCode. One related to a priority queue, and the other was a basic math-based question.

You are also supposed to answer two subjective questions. In these, you will have to explain the approach you used while solving the question, along with its space and time complexity.

Amazon | OA | Prime Air time

28.0K VIEWS 17 Last Edit: February 23, 2022 6:42 AM

Anonymous User Position: SDE 1 Location: Bengaluru, India. YoE: 1 year 3 months. Platform: Hackerrank

Problem: This problem is a variant of the closest pair sum. You'll be given two arrays:

arr1 = { {1, 2000}, {2, 3000}, {3, 4000} } arr2 = { {1, 5000}, {2, 3000} }

The first element of every pair represents the ID and the second value represents the value.

Target x = 5000

Find pairs from both arrays whose values add up to a sum that is less than the given target and closest to the target.

Output for the above example: { {1, 2} } // Note that the output should be in IDs.