microsoft.db
Como se preparar para entrevistas na Microsoft
Reunimos aqui as perguntas públicas já associadas à Microsoft para te ajudar a estudar com mais contexto, entender o tipo de cobrança e priorizar melhor sua preparação.
salários
Quanto a Microsoft paga em tecnologia
Ainda não publicamos salários da Microsoft
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 Microsoft
perguntas de entrevistas da empresa
O que já apareceu em processos da Microsoft
24 de 126 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 |
| 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 |
| Design an LLD of SplitwiseDesign the low-level design (LLD) of a system like Splitwise, which allows users to track shared expenses and settle debts. The system should support features like adding expenses, splitting costs among users, and tracking balances. | Technical | Mid-level | 1 | mar. de 2026 |
| Leetcode 10. Regular Expression MatchingDetermine whether a pattern p (with '.' matching any single character and '*' meaning zero or more of the preceding element) matches the entire string s. The core challenge is handling the branching choices introduced by '*' and overlapping subproblems, typically solved with recursion+memoization or dynamic programming. | Coding | Mid-level | 1 | mar. de 2026 |
| Leetcode 273. Integer to English WordsConvert a non-negative integer to its English words representation. The core challenge is chunking the number into three-digit groups (ones, thousands, millions, billions), mapping each chunk to its word form, and handling edge cases like zero within the 32-bit range. | Coding | Senior | 1 | mar. 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 | mar. de 2026 |
| Design a Presence Service APIDesign a presence service API that allows users to track and display online/offline status, activity states, and real-time presence information across multiple devices and applications. | System Design | Senior | 1 | mar. de 2026 |
| Design a URL ShortenerDesign a URL shortening service similar to TinyURL that allows users to convert long URLs into short, shareable links and manage their shortened URLs. | System Design | Senior | 1 | mar. 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 | mar. de 2026 |
| Leetcode 49. Group AnagramsGroup the input strings into lists of anagrams — i.e., strings that contain the same multiset of letters — and return the groups in any order. Typical solutions compute a canonical key per string (sorted characters or a letter-count signature) and use a hash map to bucket up to 10^4 strings of length ≤100. | Coding | Staff+ | 1 | mar. de 2026 |
| Leetcode 529. MinesweeperSimulate a Minesweeper click on an m×n board: clicking a mine turns it to 'X', while clicking an empty square requires counting adjacent mines — if the count > 0 set the cell to that digit, otherwise mark it 'B' and recursively reveal all neighbors. The core challenge is a grid flood-fill with adjacency counting (use DFS/BFS) to propagate reveals. | Coding | Senior | 1 | mar. de 2026 |
| Describe your most impactful project | Behavioral | Senior | 1 | fev. de 2026 |
| Tell me about a conflict you had at work.The interviewer focused on a conflict that comes from different perspectives or ideas on how to execute a certain task. | Behavioral | 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 Notification SystemDesign 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. | System Design | Senior | 1 | fev. de 2026 |
| Design a Ticket Booking SystemDesign a ticket booking system like Ticketmaster that handles high-traffic events, supports both seated and general admission tickets, and manages scenarios like flash sales with limited inventory and concurrent users. | System Design | Staff+ | 1 | fev. de 2026 |
| Design a Distributed Cache SystemDesign a distributed caching system that can serve data with low latency across multiple geographic locations, handling cache misses, replication, and scaling to support billions of records. | System Design | Staff+ | 1 | fev. de 2026 |
| Design a Logger SystemDesign a logger system that receives messages with timestamps and only prints each message if it hasn't been printed in the last 10 seconds, with support for multiple applications and search capabilities. | System Design | Mid-level | 1 | fev. de 2026 |
| Leetcode 3. Longest Substring Without Repeating CharactersFind the length of the longest contiguous substring that contains no repeated characters. This is a classic sliding-window / two-pointer problem where you track seen characters to expand and contract the window efficiently (linear-time expected). | Coding | Mid-level | 1 | fev. de 2026 |
| Tell me something about yourself I won't find on your resume | Behavioral | Mid-level | 1 | fev. de 2026 |
| Leetcode 438. Find All Anagrams in a StringGiven strings s and p, return all start indices of substrings in s that are anagrams of p; the core challenge is to detect equal character multisets efficiently, typically via a sliding window with frequency counts (s, p up to 3×10^4, lowercase letters). | Coding | Staff+ | 1 | fev. de 2026 |
| Leetcode 384. Shuffle an ArrayDesign a class that stores an integer array and supports reset (returning the original configuration) and shuffle (returning a uniformly random permutation so that all permutations are equally likely). Expect arrays up to length 50 and up to 10^4 total operations, so use an unbiased shuffling method. | Coding | Senior | 1 | fev. de 2026 |
| Leetcode 708. Insert into a Sorted Circular Linked List | Coding | Mid-level | 1 | fev. de 2026 |
| Leetcode 723. Candy CrushGiven an m×n board of integer "candies," repeatedly find and remove any horizontal or vertical runs of ≥3 identical candies, let the remaining candies fall down to fill gaps (gravity), and repeat until no more removals are possible — return the stabilized board. This tests grid scanning and iterative simulation to detect runs and collapse columns to a fixed point. | Coding | Senior | 1 | fev. de 2026 |
empresas relacionadas
Explore empresas parecidas
453 perguntas
313 perguntas
234 perguntas
87 perguntas
50 perguntas
48 perguntas