Uber 2027 SWE Internship OA experience

I have recently given Uber online assessement for 2027 summer internship. Oppurtunity is through my college. This is the pattern of OA:

There are total 3 coding questions with 65 minutes time limit.

Problem-1
There are n cities, where each city has a delivery charge, given by the array deliveryCharge, and there are two possible ways of delivery:

To deliver from city i to city j,

• Deliver with a cost of abs(deliveryCharge[i]-deliveryCharge[j]) or,
• Deliver with a cost of 1 unit iff city j is closest city to city i

Distance between two cities is given by formula abs(deliveryCharge[i]-deliveryCharge[j]). And inputs are given such that each city has a closest city which is unique. (No city can have two closest cities)

Now array of queries is given where each query has [Start, End]. You have to give optimal cost to deliver from Start to End.

I did this in O(N+q) time and O(N) space complexity, and it was accepted.

Problem-2
There is a lane of length laneLength, think of it as a line segment from (0,0) to (laneLength, 0). And there a some trucks initally positioned at different coordinates on this lane and each truck travels with a velcity. Initial coordinates of trucks are given by initial and velocity of trucks by velocity. If velocity is positive, truck moves in right direction, else it moves in left direction. When a truck goes out of lane boundaries, its considered to be left. And when two trucks collide, they exchange their velocities and directions also.

We have to output the time when last truck leaves the lane.

Problem-3
In a company, employees are organized in a hierarchical manner, this is represent in a tree. Root of the tree is boss. Children of a node are employees working under that node. Now when you pass data to a particular node(employee), its transfers to other employees in ascending order of node values who work under this employee.

In this example, if data is given to the root, it gets transferred in this manner, [11, 7, 3, 2, 4, 9, 8, 15, 13, 19]

Now array queries is given where each query has, [StartNode, k].
You have to return who is kth person in order recieving data when data is first given to StartNode.

I was able to do this also. Here direct input of tree is not given, an arry boss is given, where boss[i] is boss of employee i.

So in total I've done 2 questions, only partial testcases were passed for remaining question.

My opinon:
It was a medium-hard level OA, good understanding of DSA is required to solve questions.