Oracle
282 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 199. Binary Tree Right Side View | Medium | 59.9% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 242. Valid Anagram | Easy | 59.9% | TopicsHash TableStringSorting |
| 295. Find Median from Data Stream | Hard | 59.9% | TopicsTwo PointersDesignSortingHeap (Priority Queue)Data Stream |
| 981. Time Based Key-Value Store | Medium | 59.9% | TopicsHash TableStringBinary SearchDesign |
| 1797. Design Authentication Manager | Medium | 59.9% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 22. Generate Parentheses | Medium | 57.7% | TopicsStringDynamic ProgrammingBacktrackingBracket Sequences |
| 2506. Count Pairs Of Similar Strings | Easy | 57.7% | TopicsArrayHash TableStringBit ManipulationCounting |
| 2836. Maximize Value of Function in a Ball Passing Game | Hard | 57.7% | TopicsArrayDynamic ProgrammingBit Manipulation |
| 1200. Minimum Absolute Difference | Easy | 57.7% | TopicsArraySorting |
| Simplify Path | Medium | 57.7% | TopicsStringStack |
| 3799. Word Squares II | Medium | 57.7% | TopicsArrayStringBacktrackingSortingEnumeration |
| 6. Zigzag Conversion | Medium | 55.2% | TopicsString |
| 13. Roman to Integer | Easy | 55.2% | TopicsHash TableMathString |
| 121. Best Time to Buy and Sell Stock | Easy | 55.2% | TopicsArrayDynamic Programming |
| Longest Consecutive Sequence | Medium | 55.2% | TopicsArrayHash TableUnion-Find |
| 207. Course Schedule | Medium | 55.2% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| 2466. Count Ways To Build Good Strings | Medium | 55.2% | TopicsDynamic Programming |
| 2580. Count Ways to Group Overlapping Ranges | Medium | 55.2% | TopicsArraySorting |
| 2549. Count Distinct Numbers on Board | Easy | 55.2% | TopicsArrayHash TableMathSimulation |
| 994. Rotting Oranges | Medium | 55.2% | TopicsArrayBreadth-First SearchMatrix |
| 3012. Minimize Length of Array Using Operations | Medium | 55.2% | TopicsArrayMathGreedyNumber Theory |
| 3015. Count the Number of Houses at a Certain Distance I | Medium | 55.2% | TopicsBreadth-First SearchGraph TheoryPrefix Sum |
| 3017. Count the Number of Houses at a Certain Distance II | Hard | 55.2% | TopicsGraph TheoryPrefix Sum |
| 2192. All Ancestors of a Node in a Directed Acyclic Graph | Medium | 55.2% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| 1353. Maximum Number of Events That Can Be Attended | Medium | 55.2% | TopicsArrayGreedySortingHeap (Priority Queue) |
