I applied through other source. I interviewed at Uber (San Francisco, CA) in Sep 2016
Interview
I only got chance to speak with an engineer for Telephonic round. Interviewer was really terrible with communication skills, arrived late for interview and then had completely no idea as to how to judge a programming exercise based on C++.
Overall, very terrible experience and I really hope that Uber give a very serious look into it's interview panel.
Interview questions [1]
Question 1
// evalexpr(-4 - 3 * 2 / 2 + 4) -> result (float or double)
//
// [Token(NUM, -4.), Token(SUB), Token(NUM, 3), Token(MUL)…]
//
// input: an array/list of Tokens representing a VALID arithmetic expression
// output: the result as a float or double
//
// Token:
// type: one of NUM, ADD, SUB, MUL, DIV
// value: float or double it's only defined/relevant when the token as type NUM
//
// Todo:
// 1. implement the Token class/struct
// 2. implement evalexpr
I applied through a recruiter. The process took 5 days. I interviewed at Uber (San Jose, CA) in Sep 2016
Interview
Applied online and got a phone call from recruiter to set up a technical screen phone interview. It was a 1 hour long technical phone interview and I asked to code using hacker rank code pair tool.
Interviewer was kind out ok but was interrupting while coding. I asked to compile my program and made it to work for all inputs was given to me to verify the output.
I wrote the recursive solution and it compiled and worked for all his input but he was asking me write Dynamic programming pattern of the code in last 10 min which I did not liked instead I explained him the approach because of time constraint.
After two day I got an email saying that they are not moving forward with my application.
I felt like I did well and within 45 min I wrote correct code and it was giving correct output for all inputs but I could not finish Dynamic version of the code which he wanted to write and again compile in last 10 min.
Interview questions [1]
Question 1
Given an array of Ints find a maximum sum of non adjacent elements.
for ex. arr = [1,0,3,9,2] then ans would be 10 = 1 + 9 (non adjacent element)
I applied through a staffing agency. The process took 2 weeks. I interviewed at Uber (Hyderâbâd) in Jul 2016
Interview
Round 1: video call where I was asked to solve 2 algo questions - one based on binary search and another based on Linked Lists.
Round 2 and 3: onsite. The level of questions increased with every round. Questions based on my current role and a data structure question based on that followed by a design question and a probability question
Interview questions [1]
Question 1
Given a number represented as a linked list, add '1' to it. No extra space, and in liner time.