Nearest Value Replacement
You are given an array A of length N, a starting index cur, and a distance D.
Task
Your task is to iteratively update the array A starting from index cur.
At each step, replace A[cur] with A[cur] + 1, then find the nearest index (left or right, within distance D) where this new value exists in the array.
If multiple indices exist at the same distance, choose the leftmost index.
If no such index exists within distance D, keep the value in the same index and stop updating.
Example 1
A = [1, 2, 3, 4, 5, 2]
cur = 2
D = 2
Output:
[1, 3, 3, 4, 5, 2]
Multiplier Shop Strategy
You are given two integer arrays:
int[] multiples: the multipliers available in the shopint[] prices: the corresponding prices for each multiplier
Both arrays have the same length
n, and the i-th multiplier (multiples[i]) costsprices[i]coins to purchase.
Starting Conditions
You start with:
- 0 coins
- A base gain rate of 1 coin per second
When you purchase a multiplier, your coin gain rate is multiplied by that value. For example:
- Start: gain = 1x
- Buy 3x → gain becomes 3x
- Buy 4x → gain becomes 3 × 4 = 12x
You can only make purchases when you have enough coins to afford the multiplier.
Objective
Your goal is to purchase all the multipliers, in some order, such that the total time taken to finish all purchases is minimized.
I came up with a DFS solution, it worked but the interviewer told me there was another way to solve it. Do you have any idea?
Example
multiples = [3, 100, 30]
prices = [5, 30, 15]
Output:
[0, 2, 1] # Buy 3x, then 30x, then 100x
我们长期稳定承接各大科技公司如TikTok、Google、Amazon等的OA笔试代写服务，确保满分通过。如有需求，请随时联系我们。
We consistently provide professional online assessment services for major tech companies like TikTok, Google, and Amazon, guaranteeing perfect scores. Feel free to contact us if you're interested.
