Latest in April Amazon OA with Amazon clearly adding more types of questions that require on-site observation and deduction compared to last year. Memorizing templates alone is no longer sufficient to score full marks. As always, this will come with a standard set: Amazon OA (platform), 2 coding questions + about 70 minutes (with some roles potentially having Work Simulation). I've compiled the most frequently appearing true questions from April and provided them for quick preparation.
April Amazon OA Overall Configuration (Latest)
平台：HackerRank
Number of questions: 2 questions
Duration: 70 minutes (some sessions are 60 minutes)
Common Combinations:
- Mindset While Traveling (Narrowly Cognitive)
- Note: There are virtually no pure simple questions.
Note: There are hardly any pure simple questions.
Minimum number of security groups
Title
A financial services company requested AWS to deploy its private cloud network. Given the sensitive nature of the company's business, AWS also recommended that they add a specific type of security system.
There are total in the network N Server, no. I The security requirements of a server are determined by security[i] Indicates that each element represents the security level of the server.
To ensure the highest level of protection, the AWS security team follows the following rules when designing security systems:
- All servers in the same security group must have the same security level;
- The difference between the number of servers in any two security groups cannot exceed 1.
Given an array of integers security, please calculate the minimum number of security groups required to ensure network security.
Example
Enter:n = 6,security = [2, 3, 3, 3, 2, 1]
The grouping plan is as follows:
- Level 1: 1 server → 1 group
- Level 2: 2 servers → 1 group
- Level 3: 3 servers → 2 groups (1-2 each, difference ≤ 1) eventually requiring 4 groups.
函数要求
Completion function findMinimumGroups(security), the input is an integer array security, returns the minimum required number of security groups (integer).
Ideas
Determine the frequency for each level and enumerate the base group size \( S \) from its minimum value. If all frequencies can be composed of \( S \) and \( S+1 \), add to the count.
Maximum total safety stock
Title
As a logistics manager in a car manufacturing company, you are responsible for storing goods in a secure warehouse.
Given a length of N Array of deliveryLogs, of which the I elements represent the I The number of parts in the batch; also give an even number k, represents the number of available safe warehouses.
Cargo storage rules are as follows:
- Each warehouse can only store parts from the same batch of goods, and goods from different batches cannot be mixed; parts of the same batch of goods can be split into multiple warehouses.
- After storage is completed, the k/2 warehouses with the largest number of goods will be invaded and cannot be counted in the safety stock.
- The remaining k/2 warehouses are safe, and only the goods in these warehouses will be counted as safety stocks.
Your task is: Calculate the maximum achievable total safety stock.
Example
Enter:N equals 4,deliveryLogs = [3, 5, 9, 6],k = 4
If each batch of goods is stored in a separate warehouse, the warehouse inventory is [3,5,9,6].
At this time, the two warehouses (9, 6) with the most goods are invaded, and the remaining safety stock is 3+5=8.
(The optimal solution can obtain higher safety stock, which needs to be achieved by splitting batches)
函数要求
Completion function secureMaximumDeliveries(deliveryLogs, k), the input is an integer array deliveryLogs And integers k, returns the maximum total safety stock (integer).
Ideas
利用贪心策略，通过枚举可能的中位数水位X，计算每个记录能拆出多少个容量为X的块及余数，取前k大块求和S，最大化 S – (k/2)*X 的值
Total revenue from virtual machine rental
Title
In Amazon EC2, there are N Virtual machine (VM) types, with a certain number of available instances of each type.
Each time a VM instance is leased, the customer pays a fee equal to:
Minimum non-zero available quantity of all VM types + Maximum available quantity of all VM types
share m Customers come to rent one after another. Each customer always chooses the VM type with the highest currently available quantity for leasing; after leasing, the available quantity of that VM type is reduced by one.
Please calculate the total revenue earned after completing all rental requests.
Example
Enter:N equals 3,vmStock = [0, 2, 4],m = 4
Simulate the leasing process:
Sheet
| client | Selected VM type | Fee (min non-zero + max) | Inventory remaining after lease |
|---|---|---|---|
| initial | – | – | [0, 2, 4] |
| 1 | No. 3 (4 pieces) | 2 + 4 = 5 | [0, 2, 3] |
| 2 | No. 3 (3 pieces) | 2 + 3 = 4 | [0, 2, 2] |
| 3 | No. 2 / No. 3 (2 pieces) | 2 + 2 = 3 | [0, 1, 2] |
| 4 | No. 3 (2 pieces) | 1 + 2 = 3 | [0, 1, 1] |
Total revenue:5 + 4 + 3 + 3 = 15, so the answer is 15.
函数要求
Complete the corresponding function, the input is the VM inventory array vmStock and number of customers m, returns the total revenue (integer).
Ideas
Maintain inventory and frequency in an ordered structure. Each iteration, add together the inventory for the smallest key and the largest key. Decrease the inventory of the largest key by one; if it reaches zero, delete it. Repeat this process m times.
Maximum number of parcel label splits
Topic
A team at Amazon needs to make sure all packages are sorted correctly by label. The label of each package is an uppercase English letter, and all labels form a string packages, of which the I characters represent the I A package label.
In order to optimize the sorting process, the team needs to analyze each prefix of the string (length from 1 to n) and calculate the maximum number of equal parts that the prefix can be split into. The split needs to satisfy:
- The number of occurrences of each character in each part must be exactly the same as in all other parts.
given string packages, please specify the length of each prefix T(1 ≤ t ≤ n), calculate the maximum number of splits that meet the conditions for this prefix.
Example
Enter:packages = "ABAB"
The calculation results for each prefix are as follows:
Sheet
| prefix length | prefix string | Illustrate | Maximum number of splits |
|---|---|---|---|
| 1 | A | Single characters cannot be split | 1 |
| 2 | AB | A and B each appear once and cannot be split into multiple copies. | 1 |
| 3 | ABA | A appears 2 times, B appears 1 time, cannot be split | 1 |
| 4 | ABAB | A 出现 2 次、B 出现 2 次，可拆分为 2 份（”AB”+”AB”） | 2 |
函数要求
Complete the corresponding function and input it as a string packages, returns an array of length n, where the i-th element represents the maximum number of splits when the prefix length is i+1.
Ideas
Enumerate possible segment lengths (which must be factors of the total length), check if the character frequency is the same for each segment, and maintain a maximum segment count at each position. Output the list afterward.
Suggestions for the Amazon OA and HackerRank Sprint Phase
Once you have thoroughly mastered the high-frequency questions for Amazon SDE1, SDE2, or Intern 2026 OA preparation, your pass rate will significantly increase. April's questions have a clear overall approach but require strong temporary analytical capabilities.
Need detailed approaches and complete Python/Java code for these questions, as well as more variations or other latest OA problems from big companies (Meta, Google, ByteDance, Microsoft, etc.). Alternatively, you can consult Programhelp for such inquiries. OA Support Services Feel free to leave a message or send me a private message. I will provide targeted advice based on your specific situation.
Wish everyone a successful passage through Amazon OA in April and subsequently, and hope you are able to secure the desired Amazon offer as soon as possible. Keep pushing forward!
