AMAZON OA SDE 2

Question 1

Amazon Shopping is running a reward collection event for its customers. There are n customers and the i-th customer has collected initialRewards[i] points so far.

One final tournament is to take place where:

The winner will be awarded n points,

The runner-up gets n - 1 points,

The third place gets n - 2 points,

...

The last place gets 1 point.

Given an integer array initialRewards of length n, representing the initial reward points of the customers before the final tournament:

🔍 Your Task Find the number of customers i (1 ≤ i ≤ n) such that, if the i-th customer wins the final tournament, they would have the highest total points.

🧠 Note: The total points = initialRewards[i] + n (if they win).

Other customers also get points in the tournament depending on their ranks (from n - 1 to 1).

You must check if the i-th customer, upon winning, ends up with the highest total score, regardless of how others place.

🧪 Example: Input: ini Copy Edit n = 3
initialRewards = [1, 3, 4] Output: Copy Edit 2 Explanation: Customer 1: 1 + 3 = 4 → Not highest, since customer 3 can get 4 + 2 = 6.

Customer 2: 3 + 3 = 6 → Yes, highest possible.

Customer 3: 4 + 3 = 7 → Yes, highest possible.

✅ Customers 2 and 3 are valid → Answer: 2

🧪 Another Example: Input: ini Copy Edit n = 3
initialRewards = [8, 10, 9] Output: Copy Edit 2 Explanation: Customer 2: 10 + 3 = 13 → Highest.

Customer 3: 9 + 3 = 12 → Valid, since others can't beat 12 even if placed second.

✅ Again, 2 valid customers.

Question 2

Question 2: Server Selection (AWS Horizontal Scaling) Amazon Web Services (AWS) provides highly scalable solutions for applications hosted on their servers. A company using AWS is planning to scale up horizontally and wants to buy servers from a list of available options.

Goal: Find the maximum number of servers (as a subsequence from the list) that can be rearranged so that the absolute difference between adjacent servers (including circular adjacency) is ≤ 1.

Conditions: A circular sequence is formed → So first and last servers are also considered adjacent.

A subsequence means elements can be removed but the order is preserved.

Formal: Given an array powers[] of n integers:

Find the maximum subsequence length such that it can be rearranged into a circular array where abs(a[i] - a[i+1]) ≤ 1 for all i, and abs(a[m-1] - a[0]) ≤ 1 where m is the length of the subsequence.

Example: text Copy Edit powers = [4, 3, 5, 1, 2, 1]

Valid Candidates:

• [1, 2, 2, 1] → valid circular arrangement
• [3, 1, 2, 2] → can be rearranged to [1, 2, 3, 2] which is valid

Invalid:

• [3, 1, 2] → no rearrangement makes circular adjacent difference ≤ 1

Note : Converted Images to Text, so having long texts, hope it will helps aspriants for recent questions of AMAZON OA