Oracle LeetCode Interview Questions
Practice 46 real coding problems frequently asked in Oracle technical interviews. Master these questions to ace your next Oracle software engineering interview.
Top Topics at Oracle
Ace your Oracle interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Oracle Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
The Earliest Moment When Everyone Become Friends 100% | MediumM | Solve→ |
Is Subsequence 100% | EasyE | Solve→ |
Add Strings 94% | EasyE | Solve→ |
Max Consecutive Ones III 91% | MediumM | Solve→ |
Best Time to Buy and Sell Stock II 90% | MediumM | Solve→ |
Decode String 87% | MediumM | Solve→ |
First Unique Character in a String 83% | EasyE | Solve→ |
Check Completeness of a Binary Tree 82% | MediumM | Solve→ |
Random Pick Index 82% | MediumM | Solve→ |
Insert Delete GetRandom O(1) 79% | MediumM | Solve→ |
Adding Spaces to a String 76% | MediumM | Solve→ |
First Missing Positive 74% | HardH | Solve→ |
Sum Root to Leaf Numbers 72% | MediumM | Solve→ |
Vertical Order Traversal of a Binary Tree 69% | HardH | Solve→ |
Custom Sort String 68% | MediumM | Solve→ |
Coin Change II 67% | MediumM | Solve→ |
Word Ladder 64% | HardH | Solve→ |
Design HashMap 63% | EasyE | Solve→ |
Evaluate Division 63% | MediumM | Solve→ |
Nested List Weight Sum II 63% | MediumM | Solve→ |
Longest Increasing Path in a Matrix 60% | HardH | Solve→ |
Regular Expression Matching 58% | HardH | Solve→ |
Number of Islands 57% | MediumM | Solve→ |
Search in Rotated Sorted Array 57% | MediumM | Solve→ |
Search a 2D Matrix 56% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Word Ladder II 52% | HardH | Solve→ |
Find Leaves of Binary Tree 51% | MediumM | Solve→ |
Zero Array Transformation I 51% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 50% | MediumM | Solve→ |
Check If N and Its Double Exist 50% | EasyE | Solve→ |
Merge Two Sorted Lists 49% | EasyE | Solve→ |
Remove Stones to Minimize the Total 47% | MediumM | Solve→ |
Continuous Subarrays 45% | MediumM | Solve→ |
Find K Closest Elements 44% | MediumM | Solve→ |
Subarray Sum Equals K 42% | MediumM | Solve→ |
Buildings With an Ocean View 42% | MediumM | Solve→ |
Interval List Intersections 41% | MediumM | Solve→ |
Median of Two Sorted Arrays 41% | HardH | Solve→ |
Minimum Path Sum 41% | MediumM | Solve→ |
LRU Cache 39% | MediumM | Solve→ |
Plus One 39% | EasyE | Solve→ |
Nested List Weight Sum 34% | MediumM | Solve→ |
Search Suggestions System 33% | MediumM | Solve→ |
Subsets 32% | MediumM | Solve→ |
House Robber II 28% | MediumM | Solve→ |
Move Pieces to Obtain a String 24% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Oracle ask in interviews?
Oracle commonly asks 46 coding problems in technical interviews, including The Earliest Moment When Everyone Become Friends, Is Subsequence, Add Strings. The difficulty breakdown is 7 Easy, 32 Medium, and 7 Hard problems.
How should I prepare for a Oracle coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Oracle interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Oracle coding interviews?
Based on our data, Oracle interviews include 7 Easy (15%), 32 Medium (70%), and 7 Hard (15%) problems.
Ready to ace your Oracle interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required