Status: 2020 New grad, Bachelors in CS
Prior Experience: 1 Internship
Date of Offer: Aug 2019
Joining Date: Aug 2020
Company: Uber
Title: Software Engineer 1
Online Test:
It consisted of 3 ds algo questions to be solved in 1.5 hours. This round was hosted on hackerrank. Questions were of medium and hard difficulty. I believe this was the toughest round to clear of all.
I don't remember the questions exactly, so the descriptions might be a bit vague.
-
Given the capacities and final desired state of a water jug problem, print the minimum length path showing each intermediate state from empty to final state.
-
There is a particle at (0,0). It needs to reach (20,20). There are several circles given with their radius and centre which can be overlapping. Find whether the particle can reach the final point from its initial position without touching or crossing any or the circles. Particle should not cross axes in its path.
-
There is a fixed size cuboid given. And it has several spherical holes in it. Their centre and radius values are given. These spherical holes can overlap. Problem is to divide the cuboid into k parts with same volume. Find the heights at which the cuboid should be cut parallel to x-axis.
Round 1 (Code pair):
This round was a codepair round on hackerrank. Problem asked in this round to find the nth real root of a numeric. After explaining the logic of the solution, i was required to code the problem and it was executed against some test cases. The interviewer pointed out some of the errors but i was finally able to solve the problem correctly.
Round 2 (Pen Paper):
This round was a pen paper round. 2 problems asked in this round. I was required to write full code on paper for both the problems and discuss time, space complexity and dry run the solution on some test cases.
First problem was to find the longest consecutive subsequence in an unsorted array. I had solved this problem earlier on interviewbit, thus was able to provide an optimal solution of O(n) complexity. Second problem was to find the smallest positive missing integer in an unsorted array. At first, i was only able to provide a O(nlogn) solution but after some subtle hints along the way from the interviewer, i was able to solve the problem optimally in O(n) time and O(1) space complexity.
Round 3 (Hiring manager):
Last F2F interview was taken by a hiring manager. It started with a short introduction about myself. Then there was a discussion about work that i had done in my previous internship. There was a thorough discussion based on my resume relating the past projects. The interviewer based on my projects further asked some questions on databases concepts, nosql and sql. The interview ended with some behavioural questions.
Verdict: Selected
Offer details: https://leetcode.com/discuss/compensation/735347/Uber-or-SE-1-or-Hyderabad