Como se preparar para entrevistas na Apple

+15

Tell me about a time you had a conflict with a coworker. How did you resolve it?

+7

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

+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

Design a URL Shortener

Design a URL shortening service similar to TinyURL that allows users to convert long URLs into short, shareable links and manage their shortened URLs.

+5

Design a Rate Limiter

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

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

+3

Leetcode 253. Meeting Rooms II

Given a list of meeting time intervals, determine the minimum number of conference rooms required so that no meetings overlap. The core challenge is computing the maximum number of concurrent intervals (e.g., via sorting with a min-heap of end times or a sweep-line of start/end events).

+3

Design a Ticket Booking System

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

+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

Leetcode 981. Time Based Key-Value Store

Design a time-based key-value store that records multiple values per key with timestamps and returns the value whose timestamp is the largest <= the queried timestamp. With timestamps per key strictly increasing and up to 2e5 operations, the typical solution uses per-key ordered timestamp/value lists and binary search to find the floor timestamp efficiently.

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

+1

Describe a project with unclear or changing requirements and your approach to maintaining productivity.

Design Yelp

Design a location-based service like Yelp that allows users to search for nearby businesses using latitude/longitude coordinates, with support for global scale and high query volumes.

Leetcode 353. Design Snake Game

Simulate a Snake game on an m×n grid supporting move(direction): the snake advances, grows when it eats sequentially placed food (increasing score), and the game ends on collision with walls or the snake's own body. Candidates should track the snake body and occupied cells efficiently for frequent moves (e.g., deque + hash set) and handle food lookup and collision checks.

Design a Calendar App

Design a calendar application that allows users to create and manage meetings, send invitations to participants, and handle invitation responses (accept/reject).

Leetcode 56. Merge Intervals

Given a list of intervals, merge all overlapping (including touching endpoints) intervals and return the minimal set of non-overlapping intervals that cover them. Key pattern: sort by start and sweep/merge adjacent ranges whose starts are <= current end.

Design a Logger System

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

Leetcode 1482. Minimum Number of Days to Make m Bouquets

Find the minimum day such that you can form at least m bouquets, each requiring k adjacent flowers that have bloomed (return -1 if impossible, e.g., when m*k > n). This is typically solved by binary searching the day and greedily scanning for k-length contiguous bloomed segments to check feasibility.

Leetcode 1209. Remove All Adjacent Duplicates in String II

Given a string s and integer k, repeatedly remove any run of k equal adjacent characters until no more removals are possible and return the final string. The core challenge is to handle cascading deletions efficiently by tracking consecutive character counts (often via a stack of character-count pairs) rather than rescanning the string.

Job Scheduling Algorithms Implementation

Implement job scheduling algorithms including both First Come First Serve (FCFS) and priority-based approaches. The solution should handle job submissions with start times, end times, and priorities, and output the execution schedule with appropriate timing details.

Design a Scheduler System

Design a system that allows users to schedule events and processes them at specified times. Focus on the event staging architecture, including how events are queued, stored, and transitioned from scheduled state to active processing.

Leetcode 874. Walking Robot Simulation

Simulate a robot on an infinite grid executing turn commands and unit-step moves, stopping any step that would hit an obstacle and updating its facing direction as instructed. Use fast obstacle lookup (e.g., a hash set) while stepping through commands to track and return the maximum squared Euclidean distance from the origin reached.

Describe working with team members with different work styles

Leetcode 362. Design Hit Counter

Design a hit counter that records timestamps of hits and returns the number of hits in the past 5 minutes (300 seconds). The challenge is to support high-frequency record and query operations efficiently by maintaining a sliding-window summary (e.g., queue or fixed-size circular buffer) that discards expired hits.