Bloomberg
1239 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 342. Power of Four | Easy | 17.9% | TopicsMathBit ManipulationRecursion |
| 1323. Maximum 69 Number | Easy | 17.9% | TopicsMathGreedy |
| 1300. Sum of Mutated Array Closest to Target | Medium | 17.9% | TopicsArrayBinary SearchSorting |
| 1319. Number of Operations to Make Network Connected | Medium | 17.9% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 2749. Minimum Operations to Make the Integer Zero | Medium | 17.9% | TopicsBit ManipulationBrainteaserEnumeration |
| 966. Vowel Spellchecker | Medium | 17.9% | TopicsArrayHash TableString |
| 3408. Design Task Manager | Medium | 17.9% | TopicsHash TableDesignHeap (Priority Queue)Ordered Set |
| Binary Watch | Easy | 17.9% | TopicsBacktrackingBit Manipulation |
| 3494. Find the Minimum Amount of Time to Brew Potions | Medium | 17.9% | TopicsArraySimulationPrefix Sum |
| 3542. Minimum Operations to Convert All Elements to Zero | Medium | 17.9% | TopicsArrayHash TableStackGreedyMonotonic Stack |
| Ones and Zeroes | Medium | 17.9% | TopicsArrayStringDynamic ProgrammingKnapsack Problem0-1 Knapsack |
| 3583. Count Special Triplets | Medium | 17.9% | TopicsArrayHash TableCounting |
| 2492. Minimum Score of a Path Between Two Cities | Medium | 17.9% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 840. Magic Squares In Grid | Medium | 17.9% | TopicsArrayHash TableMathMatrix |
| 1411. Number of Ways to Paint N × 3 Grid | Hard | 17.9% | TopicsDynamic ProgrammingGraph Coloring |
| 925. Long Pressed Name | Easy | 17.9% | TopicsTwo PointersString |
| Design Linked List | Medium | 17.9% | TopicsLinked ListDesign |
| 3507. Minimum Pair Removal to Sort Array I | Easy | 17.9% | TopicsArrayHash TableLinked ListHeap (Priority Queue)SimulationDoubly-Linked ListOrdered Set |
| 532. K-diff Pairs in an Array | Medium | 17.9% | TopicsArrayHash TableTwo PointersBinary SearchSorting |
| 1536. Minimum Swaps to Arrange a Binary Grid | Medium | 17.9% | TopicsArrayGreedyMatrix |
| Binary Tree Level Order Traversal II | Medium | 17.9% | TopicsTreeBreadth-First SearchBinary Tree |
| 3471. Find the Largest Almost Missing Integer | Easy | 17.9% | TopicsArrayHash Table |
| 3783. Mirror Distance of an Integer | Easy | 17.9% | TopicsMath |
| 329. Longest Increasing Path in a Matrix | Hard | 17.9% | TopicsArrayDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryTopological SortMemoizationMatrixDirected Acyclic Graph |
| 1871. Jump Game VII | Medium | 17.9% | TopicsStringDynamic ProgrammingSliding WindowPrefix Sum |
