Jobs
Interviews

Uber

We are Uber. The go-getters. The kind of people who are relentless about our mission to help people go anywhere and get anything and earn their way. Movement is what we power. It’s our lifeblood. It runs through our veins. It’s what gets us out of bed each morning. It pushes us to constantly reimagine how we can move better. For you. For all the places you want to go. For all the things you want to get. For all the ways you want to earn. Across the entire world. In real time. At the incredible speed of now. The idea for Uber was born on a snowy night in Paris in 2008, and ever since then our DNA of reimagination and reinvention carries on. We’ve grown into a global platform powering flexible earnings and the movement of people and things in ever expanding ways. We’ve gone from connecting rides on 4 wheels to 2 wheels to 18-wheel freight deliveries. From takeout meals to daily essentials to prescription drugs to just about anything you need at any time and earning your way. From drivers with background checks to real-time verification, safety is a top priority every single day. At Uber, the pursuit of reimagination is never finished, never stops, and is always just beginning.

Interview Questions for Uber

1. Changes on graph structure

2. Describe the architecture of Netflix.

3. How many types of operations are there?

4. Rat In a Maze Problem Statement Given a N * N maze with a rat placed at position MAZE[0][0], find and print all possible paths for the rat to reach its destination at MAZE[N-1][N-1]. The rat is allowed to move in any direction: left, right, up, and down. The value of each cell in the 'MAZE' can either be 0 or 1. Cells with value 0 are blocked (the rat cannot enter), whereas cells with value 1 are open (the rat can move through them). Input: The first line of input contains an integer 'N' indicating the maze's dimension.The next 'N' lines contain 'N' space-separated integers representing the cells of the maze. Output: For each test case, return the path from the start position to the destination. The path should be represented with 1s for cells that are part of the solution, and 0s for others. Output each path for different test cases on separate lines. Example: Input: N = 3MAZE = [[1, 0, 0], [1, 1, 0], [0, 1, 1]] Output: [[1, 0, 0], [1, 1, 0], [0, 1, 1]] Explanation: The rat can move from the start to the destination following open cells marked by 1s. Constraints: 1 ≤ N ≤ 10 0 ≤ MAZE[i][j] ≤ 1 The rat can only move through cells marked as 1. Time Limit: 1 sec

5. Do you know how to use Google Sheets?