apple.db
Como se preparar para entrevistas na Apple
Reunimos aqui as perguntas públicas já associadas à Apple para te ajudar a estudar com mais contexto, entender o tipo de cobrança e priorizar melhor sua preparação.
salários
Quanto a Apple paga em tecnologia
Ainda não publicamos salários da Apple
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 Apple
perguntas de entrevistas da empresa
O que já apareceu em processos da Apple
24 de 50 perguntas
| Pergunta | Tipo | Nível | Relatos | Último relato |
|---|---|---|---|---|
| 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 | mar. de 2026 |
| Leetcode 567. Permutation in StringCheck whether any substring of s2 of length |s1| is a permutation of s1 (i.e., has the same character multiset). The core challenge is to do this efficiently—typically via a sliding-window with constant-size (26-letter) frequency comparisons for strings up to length 10^4. | Coding | Senior | 1 | mar. de 2026 |
| Leetcode 210. Course Schedule IIGiven 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. | Coding | Senior | 1 | fev. de 2026 |
| Design a Calendar AppDesign a calendar application that allows users to create and manage meetings, send invitations to participants, and handle invitation responses (accept/reject). | System Design | Mid-level | 1 | fev. 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 | fev. de 2026 |
| Design a Scheduler SystemDesign 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. | System Design | Senior | 1 | jan. de 2026 |
| Leetcode 125. Valid PalindromeCheck whether a string becomes a palindrome after lowercasing and removing all non-alphanumeric characters. The typical challenge is to do this efficiently (O(n)) by scanning with two pointers that skip non-alphanumeric characters. | Coding | Mid-level | 1 | jan. 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 | jan. de 2026 |
| Describe working with team members with different work styles | Behavioral | Senior | 1 | jan. de 2026 |
| Design a chat applicationDesign a mobile chat application that allows users to send text messages and share images in one-on-one conversations. | System Design | Senior | 1 | jan. de 2026 |
| Design a Facebook posts storage systemDesign a system that allows users to create, store, and retrieve Facebook posts efficiently, handling features like post creation, storage, and retrieval at scale. | System Design | Staff+ | 1 | jan. de 2026 |
| Design a Facebook post storage and query systemDesign a system that stores Facebook posts with associated tags/keywords and allows users to query posts using UNION and INTERSECTION operations on those tags to retrieve matching posts. | System Design | Staff+ | 1 | jan. de 2026 |
| Leetcode 362. Design Hit CounterDesign 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. | Coding | Senior | 1 | dez. de 2025 |
| Leetcode 713. Subarray Product Less Than KCount the number of contiguous subarrays of positive integers whose product is strictly less than k. Because all nums > 0, this is a sliding-window/two-pointer problem maintaining a running product (with the quick edge case that k ≤ 1 yields 0). | Coding | Senior | 1 | dez. de 2025 |
| Leetcode 981. Time Based Key-Value StoreDesign 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. | Coding | Staff+ | 1 | nov. de 2025 |
| Leetcode 1209. Remove All Adjacent Duplicates in String IIGiven 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. | Coding | Senior | 1 | out. de 2025 |
| 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 | set. de 2025 |
| Design a Caching System for Multi-Core, Multi-Disk SystemsDesign a distributed caching system that can handle high-throughput read/write operations across multiple cores and spinning disks while ensuring data durability and leveraging low-level concurrency for scalability. | System Design | Mid-level | 1 | set. de 2025 |
| Design a Real-Time Event Message SystemDesign a real-time event messaging system that can ingest event data (movie releases, sports events, etc.) from various sources and provide fast in-memory storage for real-time queries and aggregations. | System Design | Senior | 1 | set. de 2025 |
| Leetcode 855. Exam RoomManage an exam room of n seats where seat() places the next student at the index that maximizes the distance to the nearest occupied seat (ties broken by smallest index) and leave(p) frees a seat. The challenge is to design a data structure—typically interval tracking with a max-heap and ordered set—to pick and merge the largest empty segments efficiently for up to 10^4 operations with n up to 10^9. | Coding | Senior | 1 | set. de 2025 |
| Leetcode 56. Merge IntervalsGiven 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. | Coding | Mid-level | 1 | ago. de 2025 |
| Job Scheduling Algorithms ImplementationImplement 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. | Coding | Senior | 1 | ago. de 2025 |
| Leetcode 253. Meeting Rooms IIGiven 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). | Coding | Senior | 1 | ago. de 2025 |
| Leetcode 101. Symmetric TreeCheck whether a binary tree is symmetric around its center by determining if the left and right subtrees are mirror images of each other. This is typically solved by recursively comparing corresponding nodes (or iteratively using a queue/stack) to ensure paired node values and structure match. | Coding | Senior | 1 | ago. de 2025 |
empresas relacionadas
Explore empresas parecidas
453 perguntas
313 perguntas
234 perguntas
126 perguntas
87 perguntas
48 perguntas