Como se preparar para entrevistas na LinkedIn

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

+10

Design a Job Scheduler

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

+9

Describe your most impactful project

+7

Give me an example of a tough or critical piece of feedback you received.

+6

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.

+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

Describe experience working on a complex project

+5

Design a Metrics Aggregator

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

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

+4

What was a situation where you didn't agree with your manager or superior's decision?

+4

Give an example of a situation where you had to overcome a significant setback or obstacle to achieve a goal

+4

Describe a time you failed and how you managed the situation

+4

Design a Notification System

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

+3

Leetcode 20. Valid Parentheses

Check whether a string of parentheses/brackets is valid by ensuring every closing bracket matches the most recent unmatched opening bracket and the types and nesting order are correct. This is typically solved by tracking openings (e.g., with a stack) and verifying matching pairs.

+2

Can you share an example where you resolved a significant conflict between different teams or departments in your organization?

+2

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

+2

Leetcode 210. Course Schedule II

Given numCourses and prerequisite pairs, return any ordering of courses that satisfies all prerequisites or an empty array if impossible — this is essentially computing a topological sort of a directed graph and detecting cycles.

+2

Leetcode 200. Number of Islands

Count the number of islands (4-directionally connected components of '1's) in an m×n binary grid. This is a connected-components/flood-fill problem typically solved with DFS/BFS or Union-Find in O(mn) time (m,n ≤ 300).

+1

Leetcode 236. Lowest Common Ancestor of a Binary Tree

Given a binary tree and two nodes p and q, find their lowest common ancestor — the deepest node that has both p and q as descendants (a node can be a descendant of itself). The tree can be large (up to 2e5 nodes), nodes are unique and p and q are guaranteed to exist.

+1

Design LeetCode

Design an online coding judge system for programming competitions where users can submit solutions, view real-time leaderboards, and participate in timed contests with automatic code evaluation.

Leetcode 53. Maximum Subarray

Find the contiguous subarray within an integer array that yields the maximum possible sum and return that sum. This is typically solved in O(n) with Kadane's algorithm (with an alternative divide-and-conquer approach as a follow-up).

Leetcode 76. Minimum Window Substring

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

Design a System Metrics Monitoring and Alerting Platform

Design a metrics monitoring platform that collects performance data (CPU, memory, throughput) from hundreds of thousands of servers, allows users to set threshold-based alerts, and provides dashboards for visualization and notifications when alerts are triggered.