RejectedSenior Member of Technical Staff (IC3) at Oracle
- Difficulty
- Process took
- 3-4 Weeks
- Rounds
- 4
- Format
- Remote
- Applied via
- Company Website
How it went
- Practice greedy algorithms and heaps thoroughly
What they would tell you
- Practice greedy algorithms and heaps thoroughly
How to prepare
If you’re preparing for OCI, DSA problem medium to hard enough.
Round by round
- 1
Technical Coding Round 160 min
Problem: Given an array showing the daily price of a product and a limited number of discount vouchers, apply these vouchers optimally to minimize your total purchase cost. For example, you can buy on any number of days, but each voucher can only be used once. You want to minimize your total spending by strategically using your vouchers on the cheapest days. Approach: This is a greedy problem, use a priority queue (heap) to always apply the next voucher to the smallest remaining price.
- 2
System Design60 min
After clearing the technical coding round, after 4 day system design ,I was asked to design a Distributed Rate Limiter Key requirements:
- Handle requests per second across regions.
- Allow per-client, per-endpoint, and global rate limits.
- 3
Behavioral Interview60 min
Describe a time you made a tough technical decision under tight deadlines. Tell me about a project where you led a team with conflicting priorities. Explain a professional failure or mistake and what you learned from it.
- 4
Technical Coding Round 260 min
Most Recently Used (MRU) cache.
- get(key) retrieves the value associated with the key.
- put(key, value) stores or updates the value.
- If the cache is full, evict the most recently used item.
- All operations must be O(1) average time.
What came up
A candidate-reported account, lightly edited. Interview processes change by team and date.