oracle.db
Como se preparar para entrevistas na Oracle
Reunimos aqui as perguntas públicas já associadas à Oracle para te ajudar a estudar com mais contexto, entender o tipo de cobrança e priorizar melhor sua preparação.
salários
Quanto a Oracle paga em tecnologia
Ainda não publicamos salários da Oracle
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 Oracle
perguntas de entrevistas da empresa
O que já apareceu em processos da Oracle
24 de 64 perguntas
| Pergunta | Tipo | Nível | Relatos | Último relato |
|---|---|---|---|---|
| Leetcode 2402. Meeting Rooms IIIAssign each meeting (with unique start times) to the lowest-numbered available room or delay it (keeping its duration and prioritizing earlier original start times) until a room frees, and return the index of the room that hosted the most meetings. The core challenge is simulating this scheduling efficiently using priority queues to track free room indices and next-free times while counting assignments. | Coding | Senior | 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 |
| Design a Calendar SystemDesign a calendar system that allows users to register, manage their schedules, and view other people's availability and free/busy times. | System Design | Mid-level | 1 | mar. de 2026 |
| Leetcode 1836. Remove Duplicates From an Unsorted Linked List | Coding | Senior | 1 | mar. de 2026 |
| Leetcode 64. Minimum Path SumGiven an m×n grid of non-negative numbers, find the minimum-sum path from the top-left to bottom-right when you may only move right or down. This is a classic grid dynamic-programming problem computing cumulative minimum sums (optimal O(mn) time). | Coding | 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 |
| 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 | 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 | fev. de 2026 |
| What project are you most proud of? | Behavioral | Mid-level | 1 | fev. de 2026 |
| Design InstagramDesign a photo-sharing social media platform where users can upload photos, follow other users, and view a chronological feed of posts from people they follow. | System Design | Staff+ | 1 | fev. de 2026 |
| Tell me about a project of your choice and its challenges | Behavioral | Senior | 1 | fev. de 2026 |
| Design UberDesign a ride-sharing service like Uber that allows users to request rides, matches them with nearby drivers, handles real-time tracking, and processes payments. | System Design | Mid-level | 1 | fev. de 2026 |
| Leetcode 200. Number of IslandsCount 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). | Coding | Mid-level | 1 | fev. de 2026 |
| Tell me about a complicated product that you made simpler | Behavioral | Mid-level | 1 | fev. de 2026 |
| Leetcode 460. LFU CacheImplement an LFU cache with O(1) average-time get and put operations that evicts the least-frequently-used key when capacity is exceeded, breaking ties by least-recently-used. The cache must update a key's frequency (and recency) on both get and put, and support inserting and updating values. | Coding | Senior | 1 | fev. de 2026 |
| Tell me about a time when you had disagreements with your colleagues | Behavioral | Staff+ | 1 | fev. de 2026 |
| Tell me about a time when you made a bad decision. | Behavioral | Mid-level | 1 | fev. de 2026 |
| Design YouTube Likes SystemDesign a system that allows users to like and unlike videos, efficiently stores and retrieves like counts, provides real-time aggregated metrics for content creators and viewers, and handles the massive scale of interactions on a platform like YouTube. | System Design | Senior | 1 | fev. de 2026 |
| Leetcode 123. Best Time to Buy and Sell Stock IIIGiven daily stock prices, find the maximum profit achievable with at most two non-overlapping buy-sell transactions (you must sell before buying again). Expect to exploit the two-transaction structure (e.g., split the timeline or use DP on transaction states) and aim for an O(n) solution since n can be up to 1e5. | Coding | Senior | 1 | fev. de 2026 |
| Leetcode 188. Best Time to Buy and Sell Stock IVGiven a price array and integer k, maximize total profit using at most k non-overlapping buy-sell transactions (cannot hold multiple stocks simultaneously). This is a DP problem over days and transaction counts, with the key optimization that when k >= n/2 it reduces to the unlimited-transactions case solvable greedily. | Coding | Senior | 1 | fev. 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 | jan. de 2026 |
| Give me an example of a calculated risk that you have taken where speed was critical. | Behavioral | Mid-level | 1 | jan. de 2026 |
| Tell me about a time you received critical feedback from your manager. How did you respond to it, and what did you learn? | Behavioral | Senior | 1 | jan. de 2026 |
| Tell me about a time when you had a conflict with a peer and you were wrong | Behavioral | Senior | 1 | jan. de 2026 |
empresas relacionadas
Explore empresas parecidas
453 perguntas
313 perguntas
234 perguntas
126 perguntas
87 perguntas
83 perguntas