goldman-sachs.db
Como se preparar para entrevistas na Goldman Sachs
Reunimos aqui as perguntas públicas já associadas à Goldman Sachs para te ajudar a estudar com mais contexto, entender o tipo de cobrança e priorizar melhor sua preparação.
salários
Quanto a Goldman Sachs paga em tecnologia
Ainda não publicamos salários da Goldman Sachs
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.
quem contatar
Quem contatar na Goldman Sachs
perguntas de entrevistas da empresa
O que já apareceu em processos da Goldman Sachs
12 perguntas
| Pergunta | Tipo | Nível | Relatos | Último relato |
|---|---|---|---|---|
| Design a Rate LimiterDesign 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. | System Design | Senior | 1 | mar. de 2026 |
| Leetcode 1047. Remove All Adjacent Duplicates In StringGiven a lowercase string, repeatedly remove any two equal adjacent characters until no more removals are possible and return the resulting (unique) string. Solve in linear time using a stack or in-place two-pointer simulation to handle lengths up to 1e5. | Coding | Mid-level | 1 | fev. de 2026 |
| Leetcode 1832. Check if the Sentence Is PangramCheck whether a lowercase string is a pangram by verifying it contains all 26 English letters at least once. This can be done in O(n) time by tracking seen letters with a set or fixed-size boolean array. | Coding | Junior | 1 | fev. de 2026 |
| Design an e-commerce platformDesign an eBay-like e-commerce platform that allows users to view products, manage shopping carts, place orders, complete checkout, and process purchases. | System Design | Senior | 1 | jan. de 2026 |
| Leetcode 875. Koko Eating BananasFind the minimum integer eating speed k such that the total hours required (sum over piles of ceil(piles[i]/k)) is ≤ h; because the required hours decreases monotonically with k, this is solved by binary searching k between 1 and max(piles). | Coding | Senior | 1 | jan. de 2026 |
| Leetcode 198. House RobberGiven an array of nonnegative integers representing house values, find the maximum sum you can obtain by selecting houses with the constraint that no two chosen houses are adjacent — a classic dynamic programming problem of deciding at each index whether to rob it or skip it to maximize total. | Coding | Mid-level | 1 | jan. de 2026 |
| Design a key-value storeDesign an in-memory key-value store that supports multiple data structures (sorted sets, lists, etc.) and can be configured with different eviction strategies like LRU, LFU, or TTL-based expiration. | Technical | Mid-level | 1 | jan. de 2026 |
| Leetcode 3061. Calculate Trapping Rain WaterGiven an array of non-negative heights representing elevation bars, compute the total amount of water that can be trapped after rainfall. The core challenge is, for each index, to determine the limiting left/right maxima and sum max(0, min(left_max, right_max) − height) efficiently (optimal solutions run in O(n) time with constant or linear extra space). | Coding | Junior | 1 | jan. de 2026 |
| Leetcode 42. Trapping Rain WaterGiven an array of non-negative heights representing elevation bars of width 1, compute the total units of water that can be trapped between them after raining. The core challenge is determining, for each position, the bounding left and right maxima to accumulate trapped volume efficiently (ideally in linear time). | Coding | Mid-level | 1 | set. de 2025 |
| Leetcode 387. First Unique Character in a StringReturn the index of the first character in s that occurs exactly once (or -1 if none). This is typically solved by counting character frequencies then scanning for the first char with count 1 — O(n) time and O(1) extra space for lowercase letters. | Coding | Mid-level | 1 | set. de 2025 |
| Design DropBoxDesign a file storage and synchronization system like Dropbox that allows users to upload, download, and sync files across multiple devices with real-time updates. | System Design | Staff+ | 1 | jun. de 2025 |
| Leetcode 556. Next Greater Element IIIFind the smallest integer greater than n that uses exactly the same digits (i.e., the next lexicographic permutation of n's digits); return -1 if no such permutation exists or if the result exceeds the 32-bit signed integer limit (2^31−1). | Coding | Mid-level | 1 | jun. de 2025 |
empresas relacionadas
Explore empresas parecidas
453 perguntas
313 perguntas
234 perguntas
126 perguntas
87 perguntas
83 perguntas