amazon.db
Como se preparar para entrevistas na Amazon
Reunimos aqui as perguntas públicas já associadas à Amazon para te ajudar a estudar com mais contexto, entender o tipo de cobrança e priorizar melhor sua preparação.
salários
Quanto a Amazon paga em tecnologia
Ainda não publicamos salários da Amazon
Publicamos a mediana de uma empresa quando 15 pessoas diferentes contribuem. Se você trabalha ou trabalhou lá, seu relato anônimo ajuda a abrir esse número.
perguntas de entrevistas da empresa
O que já apareceu em processos da Amazon
24 de 313 perguntas
| Pergunta | Tipo | Nível | Relatos | Último relato |
|---|---|---|---|---|
| Design a Top-K SystemDesign 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." | System Design | Senior | 1 | mar. de 2026 |
| Leetcode 200. Number of IslandsCount 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). | Coding | Mid-level | 1 | mar. de 2026 |
| Leetcode 236. Lowest Common Ancestor of a Binary TreeGiven a binary tree and two nodes p and q, find their lowest common ancestor — the deepest node that has both p and q as descendants (a node can be a descendant of itself). The tree can be large (up to 2e5 nodes), nodes are unique and p and q are guaranteed to exist. | Coding | Mid-level | 1 | mar. de 2026 |
| Leetcode 127. Word LadderFind the length of the shortest transformation sequence from beginWord to endWord where each step changes exactly one letter and every intermediate word must be in wordList — treat words as nodes in an implicit graph with edges between one-letter-different words. Return the number of words in that shortest path (or 0 if endWord isn't reachable). | Coding | Mid-level | 1 | mar. de 2026 |
| Describe a time when you didn't think you were going to meet a commitment you promised, like a project deadline. What did you do? | Behavioral | Senior | 1 | mar. de 2026 |
| Leetcode 347. Top K Frequent ElementsGiven 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)). | Coding | Mid-level | 1 | fev. de 2026 |
| Give me an example of a time when you were not able to meet a commitment. | Behavioral | Mid-level | 1 | fev. de 2026 |
| Leetcode 452. Minimum Number of Arrows to Burst BalloonsGiven a list of intervals [x_start, x_end] (endpoints inclusive), find the minimum number of points on the x-axis (vertical arrows) such that each interval contains at least one point. This is the classic interval-stabbing/covering problem: choose the fewest x positions that hit all intervals. | Coding | Mid-level | 1 | fev. de 2026 |
| Describe working with team members with different work styles | Behavioral | Senior | 1 | fev. de 2026 |
| Leetcode 2115. Find All Possible Recipes from Given SuppliesGiven recipes whose ingredients may include other recipes and an initial set of supplies, determine which recipes can be produced; the core challenge is dependency resolution on a directed graph (topological ordering or DFS) while handling cycles and using supplies as base nodes. | Coding | Mid-level | 1 | fev. de 2026 |
| Leetcode 312. Burst BalloonsChoose an order to remove elements from an array where bursting index i yields coins equal to nums[i-1]*nums[i]*nums[i+1] (treat out-of-bounds as 1), and return the maximum total coins. The reward depends on dynamic neighbors, so the core challenge is exploiting optimal substructure (interval/segment DP over subarrays) to search the best bursting sequence for n up to 300. | Coding | Mid-level | 1 | fev. de 2026 |
| Leetcode 1650. Lowest Common Ancestor of a Binary Tree III | Coding | Senior | 1 | fev. de 2026 |
| Design a Payment SystemDesign a payment system that processes transactions through an external payment service for approval/denial, holds approved amounts, and batches all transactions daily for final processing while handling 10,000 transactions per second. | System Design | Senior | 1 | fev. de 2026 |
| Leetcode 410. Split Array Largest SumSplit the array into k non-empty contiguous subarrays so that the maximum subarray sum is as small as possible, and return that minimized largest sum. This is a partitioning/optimization problem typically solved with binary search on the answer (or DP) and a greedy feasibility check. | Coding | Mid-level | 1 | fev. de 2026 |
| Describe the most innovative thing you've done. | Behavioral | Mid-level | 1 | fev. de 2026 |
| Leetcode 698. Partition to K Equal Sum SubsetsDetermine whether an array of up to 16 small positive integers can be split into k non-empty subsets whose sums are equal. This is a combinatorial partitioning/subset-sum problem (total sum must be divisible by k) that typically requires exhaustive search with strong pruning or bitmask DP due to the exponential state space. | Coding | Mid-level | 1 | fev. de 2026 |
| Leetcode 146. LRU CacheImplement 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. | Coding | Senior | 1 | fev. de 2026 |
| Design a Chess GameDesign a chess game system that allows players to make moves, validates legal moves according to chess rules, and tracks game state including check, checkmate, and stalemate conditions. | Technical | Mid-level | 1 | fev. de 2026 |
| Design a Weather SystemDesign a weather monitoring system that can collect data from thousands of distributed sensors and provide weather information to users. | System Design | Senior | 1 | fev. de 2026 |
| Design a Linux Find Command APIDesign an API service that replicates the Linux 'find' command, allowing users to search files across directories based on criteria like size, format, and name. The system should support filters like "files >5MB" or "all XML files" through a clean, extensible interface. | Technical | Mid-level | 1 | fev. de 2026 |
| Tell me about a time you had a conflict with a coworker. How did you resolve it? | Behavioral | Mid-level | 1 | fev. de 2026 |
| Leetcode 138. Copy List with Random Pointer | Coding | Senior | 1 | fev. de 2026 |
| Song ShufflerDesign an algorithm to shuffle a playlist of songs such that each song is played once in a random order. The algorithm should ensure that the shuffle is unbiased and each permutation of the playlist is equally likely. | Coding | Senior | 1 | fev. de 2026 |
| Give me an example of a time when you were able to deliver an important project under a tight deadline. | Behavioral | Senior | 1 | fev. de 2026 |
empresas relacionadas
Explore empresas parecidas
453 perguntas
234 perguntas
126 perguntas
87 perguntas
50 perguntas
48 perguntas