Atlassian
57 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1366. Rank Teams by Votes | Medium | 100% | TopicsArrayHash TableStringSortingCounting |
| 2034. Stock Price Fluctuation | Medium | 96.5% | TopicsHash TableDesignHeap (Priority Queue)Data StreamOrdered Set |
| All O`one Data Structure | Hard | 94.6% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| Design Snake Game | Medium | 88.7% | TopicsArrayHash TableDesignQueueSimulation |
| 56. Merge Intervals | Medium | 83.5% | TopicsArraySortingQuicksort |
| Lowest Common Ancestor of a Binary Tree | Medium | 76.4% | TopicsTreeDepth-First SearchBinary TreeBinary LiftingLowest Common Ancestor |
| 2933. High-Access Employees | Medium | 74.2% | TopicsArrayHash TableStringSorting |
| Meeting Rooms II | Medium | 72.9% | TopicsArrayTwo PointersGreedySortingHeap (Priority Queue)Prefix Sum |
| 2639. Find the Width of Columns of a Grid | Easy | 66.9% | TopicsArrayMatrix |
| Text Justification | Hard | 63.1% | TopicsArrayStringSimulation |
| 2959. Number of Possible Sets of Closing Branches | Hard | 63.1% | TopicsBit ManipulationGraph TheoryHeap (Priority Queue)EnumerationShortest Path |
| 79. Word Search | Medium | 63.1% | TopicsArrayStringBacktrackingDepth-First SearchMatrix |
| Lowest Common Ancestor of a Binary Tree IV | Medium | 63.1% | TopicsHash TableTreeDepth-First SearchBinary TreeBinary LiftingLowest Common Ancestor |
| 2948. Make Lexicographically Smallest Array by Swapping Elements | Medium | 60.8% | TopicsArrayUnion-FindSorting |
| 2976. Minimum Cost to Convert String I | Medium | 60.8% | TopicsArrayStringGraph TheoryShortest Path |
| 2977. Minimum Cost to Convert String II | Hard | 60.8% | TopicsArrayStringDynamic ProgrammingGraph TheoryTrieShortest Path |
| 3026. Maximum Good Subarray Sum | Medium | 60.8% | TopicsArrayHash TablePrefix Sum |
| 1307. Verbal Arithmetic Puzzle | Hard | 60.8% | TopicsArrayMathStringBacktracking |
| 2598. Smallest Missing Non-negative Integer After Operations | Medium | 60.8% | TopicsArrayHash TableMathGreedy |
| 2577. Minimum Time to Visit a Cell In a Grid | Hard | 60.8% | TopicsArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)MatrixShortest Path |
| 2039. The Time When the Network Becomes Idle | Medium | 58.2% | TopicsArrayBreadth-First SearchGraph Theory |
| 121. Best Time to Buy and Sell Stock | Easy | 55.3% | TopicsArrayDynamic Programming |
| Logger Rate Limiter | Easy | 55.3% | TopicsHash TableDesignData Stream |
| 347. Top K Frequent Elements | Medium | 47.5% | TopicsArrayHash TableDivide and ConquerSortingHeap (Priority Queue)Bucket SortCountingQuickselect |
| 605. Can Place Flowers | Easy | 47.5% | TopicsArrayGreedy |
