bloomberg.db
Como se preparar para entrevistas na Bloomberg
Reunimos aqui as perguntas públicas já associadas à Bloomberg para te ajudar a estudar com mais contexto, entender o tipo de cobrança e priorizar melhor sua preparação.
salários
Quanto a Bloomberg paga em tecnologia
Ainda não publicamos salários da Bloomberg
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 Bloomberg
perguntas de entrevistas da empresa
O que já apareceu em processos da Bloomberg
24 de 28 perguntas
| Pergunta | Tipo | Nível | Relatos | Último relato |
|---|---|---|---|---|
| Leetcode 1169. Invalid TransactionsGiven a list of transactions, mark any transaction invalid if its amount > 1000 or if there exists another transaction with the same name within 60 minutes that occurred in a different city. The challenge is to parse and group transactions by name and then detect time-window conflicts (e.g., via sorting or pairwise checks) to return all possibly invalid entries. | Coding | Senior | 1 | fev. de 2026 |
| Leetcode 487. Max Consecutive Ones IIGiven a binary array, find the maximum length of a contiguous subarray of 1s you can get by flipping at most one 0 to 1; this is typically solved with a sliding-window/two-pointer approach that maintains a window containing at most one zero. | Coding | Senior | 1 | fev. 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 | fev. de 2026 |
| Describe your most impactful project | Behavioral | Senior | 1 | jan. de 2026 |
| What is the hardest challenge you've overcome at work? | Behavioral | Mid-level | 1 | jan. de 2026 |
| Leetcode 212. Word Search IIGiven an m×n letter grid and a list of words, find all words that can be formed by sequentially adjacent (horizontal/vertical) non-repeating cells. The core challenge is efficiently searching many candidate words on the board using DFS/backtracking with prefix pruning (e.g., a Trie) to handle up to 12×12 boards and tens of thousands of words. | Coding | Mid-level | 1 | nov. de 2025 |
| Design a stock ticker tracking systemDesign a system that processes tweets from Twitter/X to identify and count stock ticker mentions, providing aggregated counts across different time windows (5, 10, 30, and 60 minutes). | System Design | Senior | 1 | nov. de 2025 |
| 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 | nov. de 2025 |
| Leetcode 380. Insert Delete GetRandom O(1)Design a data structure supporting insert(val), remove(val), and getRandom() — which returns a uniformly random existing element — with each operation in average O(1) time. The key challenge is to combine O(1) existence checks/updates with O(1) random access so every current element has equal selection probability. | Coding | Senior | 1 | nov. de 2025 |
| 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 | nov. de 2025 |
| Design a Social Media Feed Generation SystemDesign a social media feed system that generates and populates personalized feeds for users on platforms like Twitter, Instagram, or Facebook. | System Design | Senior | 1 | out. de 2025 |
| Leetcode 1472. Design Browser HistoryImplement a BrowserHistory class that supports visiting URLs (which clears any forward history), moving back or forward up to a specified number of steps, and returning the current URL. The challenge is to maintain and update the browsing history efficiently while correctly handling bounds when requested steps exceed available history. | Coding | Mid-level | 1 | out. de 2025 |
| Leetcode 140. Word Break IIGiven a string s and a word dictionary, return all possible sentences formed by inserting spaces so every token is a dictionary word — i.e., enumerate all valid segmentations. The challenge is to generate all combinations efficiently by exploring prefixes and using memoization/DP to avoid exponential rework and prune impossible splits. | Coding | Junior | 1 | out. de 2025 |
| Leetcode 2866. Beautiful Towers IIChoose heights within [1, maxHeights[i]] that form a mountain (nondecreasing to a single peak then nonincreasing) to maximize the total sum. Core challenge: for each possible peak, compute the best feasible left/right height profiles under the monotonic constraints (commonly done with prefix/suffix scans or monotonic stacks) and take the maximum total. | Coding | Mid-level | 1 | set. de 2025 |
| Leetcode 126. Word Ladder IIFind all shortest sequences transforming beginWord to endWord by changing one letter at a time using only words from wordList; treat words as nodes in an unweighted graph (edges connect one-letter differences), use BFS to discover shortest distances/level graph and then backtrack/DFS to enumerate all shortest transformation paths. | Coding | Senior | 1 | ago. de 2025 |
| Leetcode 428. Serialize and Deserialize N-ary TreeDesign algorithms to serialize an N-ary tree into a single string and deserialize it back, preserving node values and the arbitrary number and order of children. The core challenge is choosing an unambiguous encoding (e.g., child-counts or markers) and using traversal (DFS/BFS) to record and reconstruct the tree efficiently. | Coding | Senior | 1 | ago. de 2025 |
| Leetcode 2303. Calculate Amount Paid in TaxesGiven sorted tax brackets with upper bounds and percentages, compute the progressive tax on a given income by summing, for each bracket in order, the taxed portion (the income within that bracket) multiplied by its rate until the income is exhausted. | Coding | Staff+ | 1 | jul. de 2025 |
| Design a Train Reservation SystemDesign a train reservation system that allows users to search for trains, book seats, and handle reservations with focus on low-level implementation details like booking algorithms and peak demand scenarios. | System Design | Senior | 1 | jul. de 2025 |
| Leetcode 257. Binary Tree PathsReturn all root-to-leaf paths of a binary tree as strings like "1->2->5"; this requires a simple DFS/backtracking traversal to build each path from root to leaf. | Coding | Senior | 1 | mar. de 2025 |
| Tell me about a time you had a conflict with a coworker. How did you resolve it? | Behavioral | Mid-level | 1 | fev. de 2025 |
| Design a Web Crawler with Limited CommunicationDesign a distributed web crawler using 10,000 machines to crawl 1 billion URLs without any centralized components (no master nodes, databases, queues, or cloud services). Focus on decentralized coordination, load distribution, and handling communication constraints between nodes. | System Design | Staff+ | 1 | fev. de 2025 |
| Design a Health Monitoring System for Database ServersDesign a system that monitors database server health in real-time and sends alerts when servers become down or unresponsive. | System Design | Senior | 1 | fev. de 2025 |
| Design Google DocsDesign a collaborative document editing service similar to Google Docs where multiple users can create, edit, and share documents in real-time with concurrent editing capabilities. | System Design | Staff+ | 1 | jan. de 2025 |
| Meeting Room Scheduling - Minimum Rooms RequiredGiven a list of meeting time intervals, determine the minimum number of conference rooms required so that no meetings overlap. This may involve handling 'Do Not Schedule' periods where meetings should be cut to avoid conflicts. The core challenge is computing the maximum number of concurrent intervals, typically solved via sorting with a min-heap of end times or a sweep-line algorithm of start/end events. | Coding | Mid-level | 1 | jan. de 2025 |
empresas relacionadas
Explore empresas parecidas
453 perguntas
313 perguntas
234 perguntas
126 perguntas
87 perguntas
83 perguntas