Oracle
282 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2047. Number of Valid Words in a Sentence | Easy | 26.6% | TopicsString |
| 1526. Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 26.6% | TopicsArrayDynamic ProgrammingStackGreedyMonotonic Stack |
| 2603. Collect Coins in a Tree | Hard | 26.6% | TopicsArrayTreeGraph TheoryTopological Sort |
| 1539. Kth Missing Positive Number | Easy | 26.6% | TopicsArrayBinary Search |
| Maximum Size Subarray Sum Equals k | Medium | 26.6% | TopicsArrayHash TablePrefix Sum |
| Add Two Numbers II | Medium | 26.6% | TopicsLinked ListMathStack |
| 1095. Find in Mountain Array | Hard | 26.6% | TopicsArrayBinary SearchInteractiveTernary Search |
| Single Number III | Medium | 26.6% | TopicsArrayBit Manipulation |
| 84. Largest Rectangle in Histogram | Hard | 26.6% | TopicsArrayStackMonotonic StackRange Minimum/Maximum Query |
| Merge Operations to Turn Array Into a Palindrome | Medium | 26.6% | TopicsArrayTwo PointersGreedy |
| 2858. Minimum Edge Reversals So Every Node Is Reachable | Hard | 26.6% | TopicsDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph Theory |
| Wildcard Matching | Hard | 26.6% | TopicsStringDynamic ProgrammingGreedyRecursion |
| 1481. Least Number of Unique Integers after K Removals | Medium | 26.6% | TopicsArrayHash TableGreedySortingCounting |
| Binary Tree Level Order Traversal II | Medium | 26.6% | TopicsTreeBreadth-First SearchBinary Tree |
| 684. Redundant Connection | Medium | 26.6% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 1197. Minimum Knight Moves | Medium | 26.6% | TopicsBreadth-First SearchHeuristic SearchBidirectional SearchA* Search |
| 815. Bus Routes | Hard | 26.6% | TopicsArrayHash TableBreadth-First Search |
| 3650. Minimum Cost Path with Edge Reversals | Medium | 26.6% | TopicsGraph TheoryHeap (Priority Queue)Shortest Path |
| 1488. Avoid Flood in The City | Medium | 26.6% | TopicsArrayHash TableBinary SearchGreedyHeap (Priority Queue) |
| 202. Happy Number | Easy | 26.6% | TopicsHash TableMathTwo PointersFloyd's Cycle Finding Algorithm |
| 3680. Generate Schedule | Medium | 26.6% | TopicsArrayMathGreedy |
| Percentage of Users Attended a Contest | Easy | 26.6% | TopicsDatabase |
| Design Hit Counter | Medium | 26.6% | TopicsArrayBinary SearchDesignQueueData Stream |
| 2043. Simple Bank System | Medium | 26.6% | TopicsArrayHash TableDesignSimulation |
| 3203. Find Minimum Diameter After Merging Two Trees | Hard | 26.6% | TopicsTreeDepth-First SearchBreadth-First SearchGraph Theory |
