linkedin.db
Como se preparar para entrevistas na LinkedIn
Reunimos aqui as perguntas públicas já associadas à LinkedIn para te ajudar a estudar com mais contexto, entender o tipo de cobrança e priorizar melhor sua preparação.
salários
Quanto a LinkedIn paga em tecnologia
Ainda não publicamos salários da LinkedIn
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 LinkedIn
perguntas de entrevistas da empresa
O que já apareceu em processos da LinkedIn
24 de 83 perguntas
| Pergunta | Tipo | Nível | Relatos | Último relato |
|---|---|---|---|---|
| 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 | mar. de 2026 |
| Design a Key-Value StoreDesign a distributed key-value store that supports persistent storage with append-only file operations, handles both read-heavy and write-heavy workloads with strong consistency, and can manage large values (up to 2GB) that cannot fit entirely in memory. | System Design | Senior | 1 | mar. de 2026 |
| Leetcode 215. Kth Largest Element in an ArrayReturn the k-th largest element (by sorted order, not distinct) from an unsorted array. For inputs up to ~1e5 elements, solve it faster than full sorting using selection techniques (e.g., Quickselect) or a size-k min-heap. | Coding | Senior | 1 | mar. de 2026 |
| Leetcode 1004. Max Consecutive Ones IIIFind the maximum length of a contiguous subarray that can be made all 1s by flipping at most k zeros — equivalently, find the longest window containing at most k zeros (sliding-window / two-pointer pattern). | Coding | Mid-level | 1 | mar. de 2026 |
| Past Project Technical OverviewWalk me through a significant technical project you've worked on in the past. Explain the technical challenges you faced, your approach to solving them, and what you learned from the experience. | Technical | Staff+ | 1 | mar. de 2026 |
| Leetcode 364. Nested List Weight Sum IIGiven a nested list of integers, compute the sum where each integer is weighted by the reverse of its depth (elements deeper in the nesting get smaller weights, weight = maxDepth − depth + 1). The challenge is handling arbitrary nesting and determining appropriate weights across levels to produce the weighted total. | Coding | Senior | 1 | mar. de 2026 |
| Leetcode 716. Max StackDesign a stack that supports push, pop, top, peekMax, and popMax (which removes the most recently added maximum element if there are duplicates). The challenge is to maintain fast retrieval and removal of the current maximum even when it isn't at the top, so choose data structures that allow efficient max lookup and deletion. | Coding | Staff+ | 1 | mar. de 2026 |
| Design a Malicious IP Detection SystemDesign a system that can detect and block malicious IP addresses for an enterprise, including geo-distributed blacklists, edge processing capabilities, and efficient filtering mechanisms like bloom filters to prevent attacks at scale. | System Design | Senior | 1 | mar. de 2026 |
| What project are you most proud of? | Behavioral | Mid-level | 1 | mar. de 2026 |
| Design a Metrics AggregatorDesign a metrics aggregation system that collects count-based metrics (like user signups, system errors, ad clicks) from services via a client library and displays them as histogram data on a dashboard. The system should support querying aggregated metrics within specific time frames for monitoring and analytics purposes. | System Design | Senior | 1 | mar. de 2026 |
| Leetcode 366. Find Leaves of Binary TreeGiven a binary tree, repeatedly remove all current leaf nodes and record their values until the tree is empty, returning a list of lists where each inner list contains the leaves removed in that round. The key challenge is grouping nodes by their removal round (i.e., their height from the bottom), which can be computed via a post-order traversal. | Coding | Mid-level | 1 | mar. de 2026 |
| Leetcode 432. All O`one Data StructureDesign a data structure that supports incrementing and decrementing string counts (removing keys when their count drops to zero) and can return any key with the current maximum or minimum count, with all operations required to run in O(1) average time. | Coding | Staff+ | 1 | mar. de 2026 |
| Leetcode 103. Binary Tree Zigzag Level Order TraversalReturn the node values grouped by tree depth, but alternate the order of values on each level (left-to-right then right-to-left, and so on). This is a level-order traversal problem where you must flip the output direction for every other level. | Coding | Junior | 1 | mar. de 2026 |
| Leetcode 277. Find the CelebrityGiven n people and an API knows(a, b), find the celebrity — someone who is known by everyone else but who knows no one — or return -1 if none exists. The core challenge is to identify the candidate with minimal knows() calls (typically via pairwise elimination) and then verify incoming/outgoing relationships in O(n) time and O(1) space. | Coding | Senior | 1 | mar. de 2026 |
| Leetcode 367. Valid Perfect SquareDetermine whether a positive integer is a perfect square without using built-in sqrt — i.e., decide if there exists an integer x such that x*x == num (1 ≤ num ≤ 2^31−1). | Coding | Junior | 1 | mar. de 2026 |
| Leetcode 104. Maximum Depth of Binary TreeGiven the root of a binary tree, return its maximum depth — the number of nodes along the longest root-to-leaf path. This classic easy problem is solved by a DFS or level-order traversal in O(n) time (n ≤ 10^4). | Coding | Mid-level | 1 | fev. de 2026 |
| Design a Distributed Blocking/Denylist SystemDesign a distributed denylist system that blocks requests from specified entities (users, IP addresses, emails, etc.). The system should integrate with external APIs to fetch blocked entity lists, handle both IPv4 and IPv6 addresses where applicable, support region-specific blocking rules, and efficiently propagate updates across a global infrastructure. Requirements include high availability, low latency lookups, real-time updates across multiple nodes, and the ability to handle government-mandated blocking scenarios. | System Design | Staff+ | 1 | fev. de 2026 |
| Leetcode 244. Shortest Word Distance IIGiven a list of words, design a class that can answer repeated queries returning the minimum index distance between two given words; optimize for many queries by preprocessing each word’s positions and computing the smallest gap between their index lists efficiently. | Coding | Senior | 1 | fev. de 2026 |
| Leetcode 152. Maximum Product SubarrayFind the contiguous subarray with the largest product in an integer array; because negatives and zeros can flip signs, you must track both the running maximum and minimum products at each step to correctly handle sign changes. | Coding | Mid-level | 1 | fev. de 2026 |
| Leetcode 449. Serialize and Deserialize BSTDesign algorithms to serialize a binary search tree into a compact string and deserialize it back to the exact original tree. Leverage the BST ordering property (so you can encode compactly, e.g., without null markers) to produce an unambiguous, space-efficient representation. | Coding | Staff+ | 1 | fev. de 2026 |
| Design a Top-K URL System for LinkedIn PostsDesign a system that tracks and displays the top K most shared URLs/articles from LinkedIn posts across different time windows (5 minutes, 1 hour, 1 day). The system should handle high scale (10M+ articles/day) with rolling time windows and eventual consistency. | System Design | Senior | 1 | fev. de 2026 |
| Leetcode 265. Paint House IIGiven n houses and k paint colors with a cost matrix, choose a color for each house so no two adjacent houses share a color and the total painting cost is minimized. The challenge is to design an efficient DP that handles large k (avoid naive O(n·k²)), typically by carrying forward the best and second-best previous costs to achieve O(n·k) time. | Coding | Senior | 1 | fev. de 2026 |
| Design a Job SchedulerDesign a distributed job scheduler that can handle high-throughput job processing (10,000+ jobs per second), support both scheduled (cron-based) and ad-hoc job execution, include retry mechanisms for failed jobs, and maintain execution history for up to one year. | System Design | Senior | 1 | fev. de 2026 |
| Leetcode 76. Minimum Window SubstringFind the smallest substring of s that contains all characters of t (including duplicates), or return "" if none exists. This is typically solved with a sliding-window + frequency-count approach to track coverage and achieve O(m+n) time. | Coding | Senior | 1 | fev. de 2026 |
empresas relacionadas
Explore empresas parecidas
453 perguntas
313 perguntas
234 perguntas
126 perguntas
87 perguntas
64 perguntas