This is with regards to the technical interview I did at Amazon. It was 2 hours for two questions, which were very tough and beyond the scope of anything I'd seen on LeetCode until then, including the hard category of questions.

Code question 1: A new Amazon intern encountered a challenging task. Currently, the intern has n integers, where the value of the ith element is represented by the array values[i]. The intern is curious to play with arrays and subsequences and thus asks you to join him. Given n integers, the array values, and an integer k, the intern needs to find the maximum and minimum median overall subsequences.

Code question 2: The data science team at Amazon is facing a unique challenge. A portion of their data has gone missing from their database. However, they believe they can recover the lost data based on the following instructions:

1. The missing data is a permutation of the characters found in the string firstInfo.
2. The missing data is lexicographically greater than the string secondInfo.
3. The missing data is the lexicographically smallest string that satisfies the above two conditions.