Como se preparar para entrevistas na Uber

+15

Tell me about a time you had a conflict with a coworker. How did you resolve it?

+14

What project are you most proud of?

+8

Design a Chat/Messaging System

Design a real-time messaging system like WhatsApp or Facebook Messenger that supports 1:1 and group conversations, message delivery status tracking, user presence features, conversation history, and can scale to handle millions of users.

+7

Tell me about a project where the requirements were not clear or kept changing. How did you adapt and maintain productivity?

+7

Give me an example of a tough or critical piece of feedback you received.

+6

Design a Top-K System

Design a system that efficiently retrieves top-k items (songs, videos, hashtags, etc.) based on user activity or engagement metrics within specified time windows. The system should handle real-time data aggregation and support queries like "top 10 songs in the last 7 days" or "trending hashtags in the past 24 hours."

+5

Describe experience working on a complex project

+5

Design a Rate Limiter

Design a rate limiting system that can control and throttle API requests to prevent system overload and ensure fair resource allocation. The system should be able to handle distributed scenarios, track requests across multiple servers, and enforce limits per user/client or between internal services to prevent abuse and maintain system performance.

+5

Leetcode 146. LRU Cache

Implement an LRUCache that supports O(1) average-time get(key) returning the value or -1 and put(key, value) which inserts or updates a key and, if capacity is exceeded, evicts the least-recently-used key. The core challenge is maintaining key-value storage together with recency ordering to enable constant-time access, updates, and eviction.

+4

What was a situation where you didn't agree with your manager or superior's decision?

+4

Give an example of a situation where you had to overcome a significant setback or obstacle to achieve a goal

+4

Describe a time you failed and how you managed the situation

+4

Design a Notification System

Design a scalable notification system that supports both individual and bulk notifications to multiple users. The system should handle different types of notifications including critical time-sensitive messages (like 1:1 chat) and promotional content (like system-generated recommendations) with appropriate delivery mechanisms. Consider scalability requirements (up to 1M notifications/second), expiration logic for different notification types, and the typical 80/20 distribution between critical and promotional notifications where promotional messages can target thousands of users simultaneously.

+4

Design Instagram

Design a photo-sharing social media platform where users can upload photos, follow other users, and view a chronological feed of posts from people they follow.

+3

Tell me about a time where you mentored a colleague

+2

Can you share an example where you resolved a significant conflict between different teams or departments in your organization?

+2

Leetcode 200. Number of Islands

Count the number of islands (4-directionally connected components of '1's) in an m×n binary grid. This is a connected-components/flood-fill problem typically solved with DFS/BFS or Union-Find in O(mn) time (m,n ≤ 300).

+1

Describe your current role

+1

Leetcode 347. Top K Frequent Elements

Given an integer array and k, return the k most frequent elements — the core challenge is to count element frequencies and extract the top-k efficiently (better than O(n log n)), typically using a frequency map combined with a min-heap (O(n log k)) or bucket sort (O(n)).

+1

Design an e-commerce platform

Design an eBay-like e-commerce platform that allows users to view products, manage shopping carts, place orders, complete checkout, and process purchases.

+1

Leetcode 207. Course Schedule

Given courses as nodes and prerequisite pairs as directed edges, determine whether the directed graph is acyclic — return true if a topological ordering exists (all courses can be completed), otherwise false if a cycle prevents completion.

Leetcode 53. Maximum Subarray

Find the contiguous subarray within an integer array that yields the maximum possible sum and return that sum. This is typically solved in O(n) with Kadane's algorithm (with an alternative divide-and-conquer approach as a follow-up).

How do you manage multiple priorities, do you like to be in a place where priorities keep changing or prefer doing the same thing repeatedly.

Leetcode 815. Bus Routes

Given repeating bus routes and start/target stops, find the minimum number of bus rides required to go from source to target (or -1 if impossible). This is solved by modeling routes/stops as a graph (e.g., routes as nodes connected when they share stops) and performing BFS to find the shortest transfer path — note constraints: up to 500 routes and 1e5 total stop entries.