Como se preparar para entrevistas na Bloomberg

+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?

+9

Describe your most impactful project

+7

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

+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

Design a Social Media Feed Generation System

Design a social media feed system that generates and populates personalized feeds for users on platforms like Twitter, Instagram, or Facebook.

+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.

+2

What is the hardest challenge you've overcome at work?

+1

Design Google Docs

Design 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.

Leetcode 212. Word Search II

Given 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.

Can you describe a time when you had to make a decision with incomplete information? What was the situation, and how did you handle it?

Leetcode 42. Trapping Rain Water

Given 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).

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.

Leetcode 2303. Calculate Amount Paid in Taxes

Given 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.

Meeting Room Scheduling - Minimum Rooms Required

Given 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.

Design a Health Monitoring System for Database Servers

Design a system that monitors database server health in real-time and sends alerts when servers become down or unresponsive.

Leetcode 1472. Design Browser History

Implement 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.

Leetcode 140. Word Break II

Given 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.

Design a Web Crawler with Limited Communication

Design 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.

Leetcode 126. Word Ladder II

Find 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.

Leetcode 134. Gas Station

Given two arrays gas and cost around a circular route, find the unique starting station index from which you can travel clockwise once without your running fuel (gas[i] - cost[i] cumulative) ever dropping below zero, or return -1 if impossible. The key is that a solution exists iff total gas >= total cost, and you must pick the start where the running sum never becomes negative.

Design a Train Reservation System

Design 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.

Leetcode 257. Binary Tree Paths

Return 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.

Leetcode 428. Serialize and Deserialize N-ary Tree

Design 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.