Amazon Sde 2 interview questions

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 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 id and the second value represents the value. and a target x = 5000 Find the pairs from both the arrays whose vaue add upto a sum which is less than given target and should be closest to the target. Output for the above example: { {1, 2} } // Note that the output should be in id's

Insertion and searching in tries