Oracle LeetCode Interview Questions

Practice 299 coding problems currently tagged to Oracle. Use the frequency and topic signals to build a focused software engineering interview practice plan.

Last updated: September 28, 2026

58 Easy

188 Medium

53 Hard

Top Topics at Oracle

Array String Hash Table Dynamic Programming Sorting

Ace your Oracle interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Problem	DifficultyDiff	Frequency	Topics	Action
LRU Cache 100%	MediumM	100%	Hash Table Linked List+2	Solve→
Longest Substring Without Repeating Characters 84.7%	MediumM	84.7%	Hash Table String+1	Solve→
Number of Islands 84.1%	MediumM	84.1%	Array Depth-First Search+3	Solve→
Two Sum 82.2%	EasyE	82.2%	Array Hash Table	Solve→
Group Anagrams 81.6%	MediumM	81.6%	Array Hash Table+2	Solve→
Top K Frequent Elements 76.2%	MediumM	76.2%	Array Hash Table+6	Solve→
Merge k Sorted Lists 74.4%	HardH	74.4%	Linked List Divide and Conquer+3	Solve→
Sliding Window Maximum 74.4%	HardH	74.4%	Array Queue+4	Solve→
Valid Parentheses 73.4%	EasyE	73.4%	String Stack+1	Solve→
Merge Intervals 70.2%	MediumM	70.2%	Array Sorting+1	Solve→
Spiral Matrix 69%	MediumM	69%	Array Matrix+1	Solve→
Search in Rotated Sorted Array 67.8%	MediumM	67.8%	Array Binary Search	Solve→
Meeting Rooms II 66.4%	MediumM	66.4%	Array Two Pointers+4	Solve→
LFU Cache 66.4%	HardH	66.4%	Hash Table Linked List+2	Solve→
Longest Palindromic Substring 63.5%	MediumM	63.5%	Two Pointers String+2	Solve→
Reverse Linked List 63.5%	EasyE	63.5%	Linked List Recursion	Solve→
Remove All Adjacent Duplicates in String II 63.5%	MediumM	63.5%	String Stack	Solve→
Container With Most Water 61.8%	MediumM	61.8%	Array Two Pointers+1	Solve→
Maximum Subarray 61.8%	MediumM	61.8%	Array Divide and Conquer+1	Solve→
Min Stack 61.8%	MediumM	61.8%	Stack Design	Solve→
Asteroid Collision 61.8%	MediumM	61.8%	Array Stack+1	Solve→
Minimum Absolute Difference 61.8%	EasyE	61.8%	Array Sorting	Solve→
3Sum 60%	MediumM	60%	Array Two Pointers+1	Solve→
Trapping Rain Water 60%	HardH	60%	Array Two Pointers+3	Solve→
Find Valid Pair of Adjacent Digits in String 60%	EasyE	60%	Hash Table String+1	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Roman to Integer 58%	EasyE	58%	Hash Table Math+1	Solve→
Generate Parentheses 58%	MediumM	58%	String Dynamic Programming+2	Solve→
Longest Consecutive Sequence 58%	MediumM	58%	Array Hash Table+1	Solve→
Binary Tree Right Side View 58%	MediumM	58%	Tree Depth-First Search+2	Solve→
Valid Anagram 58%	EasyE	58%	Hash Table String+1	Solve→
Find Median from Data Stream 58%	HardH	58%	Two Pointers Design+3	Solve→
Decode String 58%	MediumM	58%	String Stack+1	Solve→
Design Authentication Manager 58%	MediumM	58%	Hash Table Linked List+2	Solve→
Koko Eating Bananas 58%	MediumM	58%	Array Binary Search	Solve→
Sort Colors 55.8%	MediumM	55.8%	Array Two Pointers+3	Solve→
Best Time to Buy and Sell Stock 55.8%	EasyE	55.8%	Array Dynamic Programming	Solve→
Course Schedule 55.8%	MediumM	55.8%	Depth-First Search Breadth-First Search+3	Solve→
Count Pairs Of Similar Strings 55.8%	EasyE	55.8%	Array Hash Table+3	Solve→
Maximize Value of Function in a Ball Passing Game 55.8%	HardH	55.8%	Array Dynamic Programming+1	Solve→
Rotting Oranges 55.8%	MediumM	55.8%	Array Breadth-First Search+1	Solve→
Maximum Number of Events That Can Be Attended 55.8%	MediumM	55.8%	Array Greedy+2	Solve→
Word Squares II 55.8%	MediumM	55.8%	Array String+3	Solve→
Median of Two Sorted Arrays 53.4%	HardH	53.4%	Array Binary Search+1	Solve→
Longest Common Prefix 53.4%	EasyE	53.4%	Array String+1	Solve→
First Missing Positive 53.4%	HardH	53.4%	Array Hash Table	Solve→
Restore IP Addresses 53.4%	MediumM	53.4%	String Backtracking	Solve→
Majority Element 53.4%	EasyE	53.4%	Array Hash Table+4	Solve→
Lowest Common Ancestor of a Binary Tree 53.4%	MediumM	53.4%	Tree Depth-First Search+3	Solve→
Coin Change 53.4%	MediumM	53.4%	Array Dynamic Programming+3	Solve→
Delete Node in a BST 53.4%	MediumM	53.4%	Tree Binary Search Tree+1	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Count Ways To Build Good Strings 53.4%	MediumM	53.4%	Dynamic Programming	Solve→
Contiguous Array 53.4%	MediumM	53.4%	Array Hash Table+1	Solve→
Count Ways to Group Overlapping Ranges 53.4%	MediumM	53.4%	Array Sorting	Solve→
Count Distinct Numbers on Board 53.4%	EasyE	53.4%	Array Hash Table+2	Solve→
Time Based Key-Value Store 53.4%	MediumM	53.4%	Hash Table String+2	Solve→
Minimize Length of Array Using Operations 53.4%	MediumM	53.4%	Array Math+2	Solve→
Count the Number of Houses at a Certain Distance I 53.4%	MediumM	53.4%	Breadth-First Search Graph Theory+1	Solve→
Count the Number of Houses at a Certain Distance II 53.4%	HardH	53.4%	Graph Theory Prefix Sum	Solve→
All Ancestors of a Node in a Directed Acyclic Graph 53.4%	MediumM	53.4%	Depth-First Search Breadth-First Search+3	Solve→
Lucky Numbers in a Matrix 53.4%	EasyE	53.4%	Array Matrix	Solve→
HTML Entity Parser 53.4%	MediumM	53.4%	Hash Table String	Solve→
Minimum One Bit Operations to Make Integers Zero 53.4%	HardH	53.4%	Math Dynamic Programming+3	Solve→
Simplify Path 53.4%	MediumM	53.4%	String Stack	Solve→
Zigzag Conversion 50.6%	MediumM	50.6%	String	Solve→
Minimum Window Substring 50.6%	HardH	50.6%	Hash Table String+1	Solve→
Binary Tree Zigzag Level Order Traversal 50.6%	MediumM	50.6%	Tree Breadth-First Search+1	Solve→
Kth Largest Element in an Array 50.6%	MediumM	50.6%	Array Divide and Conquer+3	Solve→
Kth Smallest Element in a BST 50.6%	MediumM	50.6%	Tree Depth-First Search+2	Solve→
Product of Array Except Self 50.6%	MediumM	50.6%	Array Prefix Sum	Solve→
Logger Rate Limiter 50.6%	EasyE	50.6%	Hash Table Design+1	Solve→
Binary Tree Level Order Traversal 50.6%	MediumM	50.6%	Tree Breadth-First Search+1	Solve→
Diameter of Binary Tree 50.6%	EasyE	50.6%	Tree Depth-First Search+2	Solve→
Task Scheduler 50.6%	MediumM	50.6%	Array Hash Table+4	Solve→
Degree of an Array 50.6%	EasyE	50.6%	Array Hash Table	Solve→
Vertical Order Traversal of a Binary Tree 50.6%	HardH	50.6%	Hash Table Tree+4	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Implement Trie (Prefix Tree) 50.6%	MediumM	50.6%	Hash Table String+2	Solve→
Word Ladder 50.6%	HardH	50.6%	Hash Table String+2	Solve→
Count the Number of Infection Sequences 50.6%	HardH	50.6%	Array Math+2	Solve→
Letter Combinations of a Phone Number 47.4%	MediumM	47.4%	Hash Table String+1	Solve→
Find First and Last Position of Element in Sorted Array 47.4%	MediumM	47.4%	Array Binary Search	Solve→
Gas Station 47.4%	MediumM	47.4%	Array Greedy	Solve→
Copy List with Random Pointer 47.4%	MediumM	47.4%	Hash Table Linked List	Solve→
Course Schedule II 47.4%	MediumM	47.4%	Depth-First Search Breadth-First Search+2	Solve→
Maximal Square 47.4%	MediumM	47.4%	Array Dynamic Programming+1	Solve→
Move Zeroes 47.4%	EasyE	47.4%	Array Two Pointers	Solve→
Reverse Vowels of a String 47.4%	EasyE	47.4%	Two Pointers String	Solve→
String Compression 47.4%	MediumM	47.4%	Two Pointers String	Solve→
Design In-Memory File System 47.4%	HardH	47.4%	Hash Table String+3	Solve→
Maximum Profit From Trading Stocks 47.4%	MediumM	47.4%	Array Dynamic Programming	Solve→
Valid Palindrome 47.4%	EasyE	47.4%	Two Pointers String	Solve→
Palindromic Substrings 47.4%	MediumM	47.4%	Two Pointers String+1	Solve→
N-Queens 47.4%	HardH	47.4%	Array Backtracking+1	Solve→
Merge In Between Linked Lists 47.4%	MediumM	47.4%	Linked List	Solve→
Pour Water 47.4%	MediumM	47.4%	Array Simulation	Solve→
Diagonal Traverse 47.4%	MediumM	47.4%	Array Matrix+1	Solve→
Longest Mountain in Array 47.4%	MediumM	47.4%	Array Two Pointers+2	Solve→
Add Two Numbers 43.7%	MediumM	43.7%	Linked List Math+1	Solve→
Integer to Roman 43.7%	MediumM	43.7%	Hash Table Math+1	Solve→
Jump Game 43.7%	MediumM	43.7%	Array Dynamic Programming+1	Solve→
Rotate List 43.7%	MediumM	43.7%	Linked List Two Pointers	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Validate Binary Search Tree 43.7%	MediumM	43.7%	Tree Depth-First Search+2	Solve→
Binary Tree Maximum Path Sum 43.7%	HardH	43.7%	Dynamic Programming Tree+3	Solve→
Word Break II 43.7%	HardH	43.7%	Array Hash Table+5	Solve→
Largest Number 43.7%	MediumM	43.7%	Array String+2	Solve→
Palindrome Number 43.7%	EasyE	43.7%	Math	Solve→
Search a 2D Matrix II 43.7%	MediumM	43.7%	Array Binary Search+2	Solve→
Meeting Rooms 43.7%	EasyE	43.7%	Array Sorting+1	Solve→
Search a 2D Matrix 43.7%	MediumM	43.7%	Array Binary Search+1	Solve→
Insert Delete GetRandom O(1) 43.7%	MediumM	43.7%	Array Hash Table+3	Solve→
Single Element in a Sorted Array 43.7%	MediumM	43.7%	Array Binary Search	Solve→
Subarray Sum Equals K 43.7%	MediumM	43.7%	Array Hash Table+1	Solve→
Reorganize String 43.7%	MediumM	43.7%	Hash Table String+4	Solve→
Design HashMap 43.7%	EasyE	43.7%	Array Hash Table+3	Solve→
Maximum Profit in Job Scheduling 43.7%	HardH	43.7%	Array Binary Search+2	Solve→
Search Suggestions System 43.7%	MediumM	43.7%	Array String+4	Solve→
Find the Winner of the Circular Game 43.7%	MediumM	43.7%	Array Math+3	Solve→
Count Vowel Substrings of a String 43.7%	EasyE	43.7%	Hash Table String	Solve→
Next Permutation 43.7%	MediumM	43.7%	Array Two Pointers	Solve→
Number of Visible People in a Queue 43.7%	HardH	43.7%	Array Stack+1	Solve→
Second Highest Salary 43.7%	MediumM	43.7%	Database	Solve→
Consecutive Numbers Sum 43.7%	HardH	43.7%	Math Enumeration	Solve→
Find Leaves of Binary Tree 43.7%	MediumM	43.7%	Tree Depth-First Search+2	Solve→
Merge Two Sorted Lists 39.1%	EasyE	39.1%	Linked List Recursion	Solve→
Remove Duplicates from Sorted Array 39.1%	EasyE	39.1%	Array Two Pointers	Solve→
Combination Sum II 39.1%	MediumM	39.1%	Array Backtracking	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Permutations 39.1%	MediumM	39.1%	Array Backtracking	Solve→
Rotate Image 39.1%	MediumM	39.1%	Array Math+1	Solve→
Set Matrix Zeroes 39.1%	MediumM	39.1%	Array Hash Table+1	Solve→
Word Search 39.1%	MediumM	39.1%	Array String+3	Solve→
Linked List Cycle 39.1%	EasyE	39.1%	Hash Table Linked List+2	Solve→
Delete Node in a Linked List 39.1%	MediumM	39.1%	Linked List	Solve→
Longest Increasing Subsequence 39.1%	MediumM	39.1%	Array Binary Search+2	Solve→
Maximum Number of Non-overlapping Palindrome Substrings 39.1%	HardH	39.1%	Two Pointers String+2	Solve→
Top K Frequent Words 39.1%	MediumM	39.1%	Array Hash Table+6	Solve→
Number of Distinct Islands 39.1%	MediumM	39.1%	Array Hash Table+6	Solve→
Capacity To Ship Packages Within D Days 39.1%	MediumM	39.1%	Array Binary Search	Solve→
Kth Smallest Element in a Sorted Matrix 39.1%	MediumM	39.1%	Array Binary Search+3	Solve→
Max Area of Island 39.1%	MediumM	39.1%	Array Depth-First Search+3	Solve→
Kill Process 39.1%	MediumM	39.1%	Array Hash Table+3	Solve→
Reverse Words in a String 39.1%	MediumM	39.1%	Two Pointers String	Solve→
House Robber 39.1%	MediumM	39.1%	Array Dynamic Programming	Solve→
Permutation in String 39.1%	MediumM	39.1%	Hash Table Two Pointers+2	Solve→
Clone Graph 39.1%	MediumM	39.1%	Hash Table Depth-First Search+2	Solve→
Reverse Integer 39.1%	MediumM	39.1%	Math	Solve→
Divide Two Integers 39.1%	MediumM	39.1%	Math Bit Manipulation	Solve→
Minimum Array Sum 39.1%	MediumM	39.1%	Array Dynamic Programming	Solve→
Pow(x, n) 33.3%	MediumM	33.3%	Math Recursion	Solve→
Remove Duplicates from Sorted List 33.3%	EasyE	33.3%	Linked List	Solve→
Merge Sorted Array 33.3%	EasyE	33.3%	Array Two Pointers+1	Solve→
Populating Next Right Pointers in Each Node 33.3%	MediumM	33.3%	Linked List Tree+3	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Sort List 33.3%	MediumM	33.3%	Linked List Two Pointers+3	Solve→
Two Sum II - Input Array Is Sorted 33.3%	MediumM	33.3%	Array Two Pointers+1	Solve→
Isomorphic Strings 33.3%	EasyE	33.3%	Hash Table String	Solve→
Minimum Size Subarray Sum 33.3%	MediumM	33.3%	Array Binary Search+2	Solve→
Palindrome Linked List 33.3%	EasyE	33.3%	Linked List Two Pointers+2	Solve→
Integer to English Words 33.3%	HardH	33.3%	Math String+1	Solve→
Sqrt(x) 33.3%	EasyE	33.3%	Math Binary Search+1	Solve→
Find K Pairs with Smallest Sums 33.3%	MediumM	33.3%	Array Heap (Priority Queue)	Solve→
First Unique Character in a String 33.3%	EasyE	33.3%	Hash Table String+2	Solve→
Add Strings 33.3%	EasyE	33.3%	Math String+1	Solve→
Island Perimeter 33.3%	EasyE	33.3%	Array Depth-First Search+2	Solve→
Count Binary Substrings 33.3%	EasyE	33.3%	Two Pointers String	Solve→
Word Break 33.3%	MediumM	33.3%	Array Hash Table+5	Solve→
Daily Temperatures 33.3%	MediumM	33.3%	Array Stack+1	Solve→
Pairs of Songs With Total Durations Divisible by 60 33.3%	MediumM	33.3%	Array Hash Table+1	Solve→
Remove All Adjacent Duplicates In String 33.3%	EasyE	33.3%	String Stack	Solve→
Maximum Good People Based on Statements 33.3%	HardH	33.3%	Array Backtracking+2	Solve→
Sort an Array 33.3%	MediumM	33.3%	Array Divide and Conquer+6	Solve→
Flatten Binary Tree to Linked List 33.3%	MediumM	33.3%	Linked List Stack+3	Solve→
Next Greater Element I 33.3%	EasyE	33.3%	Array Hash Table+2	Solve→
Find Minimum in Rotated Sorted Array 33.3%	MediumM	33.3%	Array Binary Search	Solve→
Basic Calculator II 33.3%	MediumM	33.3%	Math String+1	Solve→
Find the Smallest Divisor Given a Threshold 33.3%	MediumM	33.3%	Array Binary Search	Solve→
Longest Substring with At Most K Distinct Characters 33.3%	MediumM	33.3%	Hash Table String+1	Solve→
Calculate Amount Paid in Taxes 33.3%	EasyE	33.3%	Array Simulation	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Convert Binary Number in a Linked List to Integer 33.3%	EasyE	33.3%	Linked List Math	Solve→
All Nodes Distance K in Binary Tree 33.3%	MediumM	33.3%	Hash Table Tree+3	Solve→
Triangle 33.3%	MediumM	33.3%	Array Dynamic Programming	Solve→
Minimum Remove to Make Valid Parentheses 33.3%	MediumM	33.3%	String Stack	Solve→
Subarray Product Less Than K 33.3%	MediumM	33.3%	Array Binary Search+2	Solve→
Minimum Cost to Make Array Equal 33.3%	HardH	33.3%	Array Binary Search+3	Solve→
Maximum Earnings From Taxi 33.3%	MediumM	33.3%	Array Hash Table+3	Solve→
Keys and Rooms 33.3%	MediumM	33.3%	Depth-First Search Breadth-First Search+1	Solve→
Remove K Digits 33.3%	MediumM	33.3%	String Stack+2	Solve→
Rotate String 33.3%	EasyE	33.3%	String String Matching	Solve→
Surrounded Regions 33.3%	MediumM	33.3%	Array Depth-First Search+3	Solve→
Reverse Substrings Between Each Pair of Parentheses 33.3%	MediumM	33.3%	String Stack+1	Solve→
Valid Sudoku 33.3%	MediumM	33.3%	Array Hash Table+1	Solve→
Climbing Stairs 33.3%	EasyE	33.3%	Math Dynamic Programming+1	Solve→
Frog Jump 33.3%	HardH	33.3%	Array Dynamic Programming	Solve→
Reverse Linked List II 33.3%	MediumM	33.3%	Linked List	Solve→
Meeting Rooms III 33.3%	HardH	33.3%	Array Hash Table+3	Solve→
Decrypt String from Alphabet to Integer Mapping 33.3%	EasyE	33.3%	String	Solve→
Number of Closed Islands 33.3%	MediumM	33.3%	Array Depth-First Search+3	Solve→
Number of Music Playlists 33.3%	HardH	33.3%	Math Dynamic Programming+1	Solve→
Invalid Transactions 33.3%	MediumM	33.3%	Array Hash Table+2	Solve→
Distance to a Cycle in Undirected Graph 33.3%	HardH	33.3%	Depth-First Search Breadth-First Search+2	Solve→
Open the Lock 33.3%	MediumM	33.3%	Array Hash Table+3	Solve→
Sum Root to Leaf Numbers 33.3%	MediumM	33.3%	Tree Depth-First Search+1	Solve→
Regular Expression Matching 25.3%	HardH	25.3%	String Dynamic Programming+1	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Longest Valid Parentheses 25.3%	HardH	25.3%	String Dynamic Programming+2	Solve→
Sudoku Solver 25.3%	HardH	25.3%	Array Hash Table+4	Solve→
Combination Sum 25.3%	MediumM	25.3%	Array Backtracking	Solve→
Jump Game II 25.3%	MediumM	25.3%	Array Dynamic Programming+1	Solve→
Insert Interval 25.3%	MediumM	25.3%	Array	Solve→
Decode Ways 25.3%	MediumM	25.3%	String Dynamic Programming	Solve→
Path Sum II 25.3%	MediumM	25.3%	Backtracking Tree+2	Solve→
Find Peak Element 25.3%	MediumM	25.3%	Array Binary Search	Solve→
Rotate Array 25.3%	MediumM	25.3%	Array Math+1	Solve→
Basic Calculator 25.3%	HardH	25.3%	Math String+2	Solve→
Invert Binary Tree 25.3%	EasyE	25.3%	Tree Depth-First Search+2	Solve→
Find the Duplicate Number 25.3%	MediumM	25.3%	Array Two Pointers+4	Solve→
Validate IP Address 25.3%	MediumM	25.3%	String	Solve→
Remove Nth Node From End of List 25.3%	MediumM	25.3%	Linked List Two Pointers	Solve→
Design Circular Queue 25.3%	MediumM	25.3%	Array Linked List+2	Solve→
K Closest Points to Origin 25.3%	MediumM	25.3%	Array Math+6	Solve→
Design File System 25.3%	MediumM	25.3%	Hash Table String+2	Solve→
Minimum Number of Steps to Make Two Strings Anagram 25.3%	MediumM	25.3%	Hash Table String+1	Solve→
Sort Array by Increasing Frequency 25.3%	EasyE	25.3%	Array Hash Table+1	Solve→
Non-overlapping Intervals 25.3%	MediumM	25.3%	Array Dynamic Programming+2	Solve→
Swapping Nodes in a Linked List 25.3%	MediumM	25.3%	Linked List Two Pointers	Solve→
Contains Duplicate 25.3%	EasyE	25.3%	Array Hash Table+1	Solve→
Reformat Date 25.3%	EasyE	25.3%	String	Solve→
Binary Search 25.3%	EasyE	25.3%	Array Binary Search	Solve→
Remove Duplicates from Sorted List II 25.3%	MediumM	25.3%	Linked List Two Pointers	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Split Array Largest Sum 25.3%	HardH	25.3%	Array Binary Search+3	Solve→
Trapping Rain Water II 25.3%	HardH	25.3%	Array Breadth-First Search+2	Solve→
Subsets 25.3%	MediumM	25.3%	Array Backtracking+1	Solve→
Fraction to Recurring Decimal 25.3%	MediumM	25.3%	Hash Table Math+1	Solve→
My Calendar I 25.3%	MediumM	25.3%	Array Binary Search+3	Solve→
Letter Tile Possibilities 25.3%	MediumM	25.3%	Hash Table String+2	Solve→
Maximize Greatness of an Array 25.3%	MediumM	25.3%	Array Two Pointers+2	Solve→
Linked List Cycle II 25.3%	MediumM	25.3%	Hash Table Linked List+2	Solve→
Serialize and Deserialize Binary Tree 25.3%	HardH	25.3%	String Tree+4	Solve→
Maximum Candies Allocated to K Children 25.3%	MediumM	25.3%	Array Binary Search	Solve→
Can Place Flowers 25.3%	EasyE	25.3%	Array Greedy	Solve→
Find All Duplicates in an Array 25.3%	MediumM	25.3%	Array Hash Table+1	Solve→
Basic Calculator III 25.3%	HardH	25.3%	Math String+2	Solve→
Cache With Time Limit 25.3%	MediumM	25.3%		Solve→
Maximum Employees to Be Invited to a Meeting 25.3%	HardH	25.3%	Array Dynamic Programming+5	Solve→
Plates Between Candles 25.3%	MediumM	25.3%	Array String+2	Solve→
Remove Linked List Elements 25.3%	EasyE	25.3%	Linked List Recursion	Solve→
Create Maximum Number 25.3%	HardH	25.3%	Array Two Pointers+3	Solve→
Nested List Weight Sum 25.3%	MediumM	25.3%	Depth-First Search Breadth-First Search	Solve→
Count and Say 25.3%	MediumM	25.3%	String	Solve→
Remove Invalid Parentheses 25.3%	HardH	25.3%	String Backtracking+1	Solve→
Minimum Sideway Jumps 25.3%	MediumM	25.3%	Array Dynamic Programming+1	Solve→
Largest Divisible Subset 25.3%	MediumM	25.3%	Array Math+2	Solve→
Word Search II 25.3%	HardH	25.3%	Array String+3	Solve→
Maximum Depth of Binary Tree 25.3%	EasyE	25.3%	Tree Depth-First Search+2	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Multiply Strings 25.3%	MediumM	25.3%	Math String+1	Solve→
Sparse Matrix Multiplication 25.3%	MediumM	25.3%	Array Hash Table+2	Solve→
Next Greater Element III 25.3%	MediumM	25.3%	Math Two Pointers+1	Solve→
Minimize Maximum of Array 25.3%	MediumM	25.3%	Array Binary Search+3	Solve→
Greatest Common Divisor of Strings 25.3%	EasyE	25.3%	Math String+2	Solve→
Candy 25.3%	HardH	25.3%	Array Greedy	Solve→
3Sum Smaller 25.3%	MediumM	25.3%	Array Two Pointers+2	Solve→
Merge Strings Alternately 25.3%	EasyE	25.3%	Two Pointers String	Solve→
Count Number of Nice Subarrays 25.3%	MediumM	25.3%	Array Hash Table+3	Solve→
Evaluate Reverse Polish Notation 25.3%	MediumM	25.3%	Array Math+1	Solve→
Merge Nodes in Between Zeros 25.3%	MediumM	25.3%	Linked List Simulation	Solve→
Encode and Decode Strings 25.3%	MediumM	25.3%	Array String+1	Solve→
Minimum Insertion Steps to Make a String Palindrome 25.3%	HardH	25.3%	String Dynamic Programming	Solve→
Design Add and Search Words Data Structure 25.3%	MediumM	25.3%	String Depth-First Search+2	Solve→
Boundary of Binary Tree 25.3%	MediumM	25.3%	Tree Depth-First Search+1	Solve→
Water and Jug Problem 25.3%	MediumM	25.3%	Math Depth-First Search+5	Solve→
The kth Factor of n 25.3%	MediumM	25.3%	Math Number Theory+1	Solve→
Number of Valid Words in a Sentence 25.3%	EasyE	25.3%	String	Solve→
Minimum Number of Increments on Subarrays to Form a Target Array 25.3%	HardH	25.3%	Array Dynamic Programming+3	Solve→
Collect Coins in a Tree 25.3%	HardH	25.3%	Array Tree+2	Solve→
Kth Missing Positive Number 25.3%	EasyE	25.3%	Array Binary Search	Solve→
Maximum Size Subarray Sum Equals k 25.3%	MediumM	25.3%	Array Hash Table+1	Solve→
Add Two Numbers II 25.3%	MediumM	25.3%	Linked List Math+1	Solve→
Find in Mountain Array 25.3%	HardH	25.3%	Array Binary Search+2	Solve→
Single Number III 25.3%	MediumM	25.3%	Array Bit Manipulation	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Largest Rectangle in Histogram 25.3%	HardH	25.3%	Array Stack+2	Solve→
Counting Bits 25.3%	EasyE	25.3%	Dynamic Programming Bit Manipulation	Solve→
Merge Operations to Turn Array Into a Palindrome 25.3%	MediumM	25.3%	Array Two Pointers+1	Solve→
Minimum Edge Reversals So Every Node Is Reachable 25.3%	HardH	25.3%	Dynamic Programming Depth-First Search+2	Solve→
Wildcard Matching 25.3%	HardH	25.3%	String Dynamic Programming+2	Solve→
Least Number of Unique Integers after K Removals 25.3%	MediumM	25.3%	Array Hash Table+3	Solve→
Binary Tree Level Order Traversal II 25.3%	MediumM	25.3%	Tree Breadth-First Search+1	Solve→
Redundant Connection 25.3%	MediumM	25.3%	Depth-First Search Breadth-First Search+2	Solve→
Minimum Knight Moves 25.3%	MediumM	25.3%	Breadth-First Search Heuristic Search+2	Solve→
Bus Routes 25.3%	HardH	25.3%	Array Hash Table+1	Solve→
Minimum Cost Path with Edge Reversals 25.3%	MediumM	25.3%	Graph Theory Heap (Priority Queue)+1	Solve→
Avoid Flood in The City 25.3%	MediumM	25.3%	Array Hash Table+3	Solve→
Happy Number 25.3%	EasyE	25.3%	Hash Table Math+2	Solve→
Generate Schedule 25.3%	MediumM	25.3%	Array Math+1	Solve→
Flood Fill 25.3%	EasyE	25.3%	Array Depth-First Search+2	Solve→
Percentage of Users Attended a Contest 25.3%	EasyE	25.3%	Database	Solve→
Reverse Nodes in k-Group 25.3%	HardH	25.3%	Linked List Recursion	Solve→
Design Hit Counter 25.3%	MediumM	25.3%	Array Binary Search+3	Solve→
Simple Bank System 25.3%	MediumM	25.3%	Array Hash Table+2	Solve→
Find Minimum Diameter After Merging Two Trees 25.3%	HardH	25.3%	Tree Depth-First Search+2	Solve→
Path Sum III 25.3%	MediumM	25.3%	Tree Depth-First Search+1	Solve→
Monthly Transactions I 25.3%	MediumM	25.3%	Database	Solve→
Campus Bikes 25.3%	MediumM	25.3%	Array Sorting+1	Solve→
Binary Tree Cameras 25.3%	HardH	25.3%	Dynamic Programming Tree+3	Solve→

Explore company practice sets with a similar number of tagged coding questions.

Frequently Asked Questions

What LeetCode problems are tagged to Oracle?

Our current Oracle practice dataset contains 299 tagged coding problems, including LRU Cache, Longest Substring Without Repeating Characters, Number of Islands. The difficulty breakdown is 58 Easy, 188 Medium, and 53 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 58 Easy (19%), 188 Medium (63%), and 53 Hard (18%) problems.

Ready to ace your Oracle interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

Top Topics at Oracle