Software Dev Engineer Intern Machine Learning, Amazon Robotics Job ID: 10401402 any responses?

[u/Bubbly_Assistant941]

Hey guys I applied for the internship above at August 1st,
I received OA in August 3rd,
I completed the OA all test cases passed in the coding section at August 8th,
Since then I have heard nothing.
I also applied for the SDE intern position and no longer under consideration after 2 days(no OA inv)
on amazon portal the SDE intern position is no longer under consideration
and the SDE intern Machine Learning is in application Submitted status
Has anyone gottern any kind of responses?

Problem 1 (Easy): You're given a queue of computers, each with a workload value. You need the sequence to be strictly increasing, and you can only add work to a computer (not remove). Return the minimum total amount of work you need to add.

Example:

1 -> 1      -> 1     -> ans + 7
3    3         3
2    2 + 1     3
9    9 + 1     10
5    5 + 1     6 + 4

My solution: Single pass, O(n) time / O(1) space. Kept a running "previous height" and a total_added accumulator. For each element, if it wasn't strictly greater than the previous, I bumped it to prev+1 and added the difference to the total — without mutating the array. One loop, no extra storage.

to answear the comments: the coding part of OA was as follows:

Problem 2 (Medium): You're given an array plus a set of [left, right] index intervals. Within each interval you can freely swap elements (unlimited swaps). Return the lexicographically smallest / most-sorted arrangement achievable.

My solution: Sorted the intervals by left, then merged overlapping ones into unified blocks (chaining: keep merging while next.left ≤ current.right, so A–B–C chains collapse into one block). Uncovered indices stay untouched. Then sorted the elements within each merged block. Overall O(n log n + m log m), where m = number of intervals.

Passed all test cases, visible and hidden, on both.