Oracle Questions
Here are the LeetCode questions for Oracle.
Total: 422
Easy: 97
Medium: 250
Hard: 75
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 212 | |
| 2 | String | 111 | |
| 3 | Hash Table | 100 | |
| 4 | Depth-First Search | 63 | |
| 5 | Dynamic Programming | 60 | |
| 6 | Math | 53 | |
| 7 | Sorting | 53 | |
| 8 | Breadth-First Search | 50 | |
| 9 | Tree | 49 | |
| 10 | Two Pointers | 47 | |
| 11 | Binary Tree | 43 | |
| 12 | Binary Search | 41 | |
| 13 | Stack | 37 | |
| 14 | Matrix | 36 | |
| 15 | Linked List | 31 | |
| 16 | Greedy | 30 | |
| 17 | Design | 26 | |
| 18 | Heap (Priority Queue) | 21 | |
| 19 | Backtracking | 19 | |
| 20 | Divide and Conquer | 16 | |
| 21 | Bit Manipulation | 16 | |
| 22 | Recursion | 16 | |
| 23 | Union-Find | 15 | |
| 24 | Simulation | 14 | |
| 25 | Prefix Sum | 14 | |
| 26 | Graph Theory | 13 | |
| 27 | Monotonic Stack | 13 | |
| 28 | Counting | 13 | |
| 29 | Binary Search Tree | 11 | |
| 30 | Database | 11 | |
| 31 | Sliding Window | 10 | |
| 32 | Trie | 9 | |
| 33 | Topological Sort | 8 | |
| 34 | Queue | 8 | |
| 35 | Ordered Set | 8 | |
| 36 | Memoization | 6 | |
| 37 | Enumeration | 6 | |
| 38 | Segment Tree | 5 | |
| 39 | Data Stream | 5 | |
| 40 | Hash Function | 5 | |
| 41 | Binary Indexed Tree | 4 | |
| 42 | Merge Sort | 4 | |
| 43 | Rolling Hash | 3 | |
| 44 | Doubly-Linked List | 3 | |
| 45 | Iterator | 3 | |
| 46 | Quickselect | 3 | |
| 47 | Randomized | 3 | |
| 48 | Brainteaser | 2 | |
| 49 | Concurrency | 2 | |
| 50 | String Matching | 2 | |
| 51 | Bucket Sort | 2 | |
| 52 | Number Theory | 2 | |
| 53 | Shell | 1 | |
| 54 | Combinatorics | 1 | |
| 55 | Radix Sort | 1 | |
| 56 | Monotonic Queue | 1 | |
| 57 | Game Theory | 1 | |
| 58 | Shortest Path | 1 | |
| 59 | Bitmask | 1 | |
| 60 | Probability and Statistics | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Word Squares II | Visit | Medium | |
| 2 | Generate Schedule | Visit | Medium | |
| 3 | Minimum Cost Path with Edge Reversals | Visit | Medium | |
| 4 | Find Valid Pair of Adjacent Digits in String | Visit | Easy | |
| 5 | Minimum Array Sum | Visit | Medium | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 422 questions for free!
Log InFrequently Asked Questions
Common questions about Oracle interviews