There are many round but first coding round was probably the toughest you have to do CP to solve this. I would say it was Leetcode hard. Do code chef , codeforces and all. It was on hacker rank platform
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Uber (Bengaluru) nel mese di set 2024
Colloquio
1. Resume Shortlisting(Selected)
2. OA Round, 4 Question need to be done in 1 hour (All done so Selected)
3. Round 1 Interview, Trust Matrix question, able to provide O(n^2) approach but not able to optimise it (So not Selected)
Domande di colloquio [1]
Domanda 1
OA Round Question
There is a matrix Like
[1 0 0]
[1 1 1]
[1 0 1]
this is a trust matrix where 1 represent trust and if matrix[i][j]=1 means rider i trust rider j so we need to find that rider who doesn't trust anybody but other all driver trust him.
Ho sostenuto un colloquio presso Uber (Seattle, WA)
Colloquio
First round: phone screening
I was asked about my previous experience.
Second round: Live coding interview with tech lead.
Problem was mid to hard LT problem. Only had 40 minutes to solve the problem.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Uber (San Francisco, CA) nel mese di feb 2023
Colloquio
I have cleared the initial assessment round and attended the 2nd technical round. The interviewer asked a hard level leet code question and was not interested at all the whole time and did not answer thhe questions that was asked for.
