Bloomberg
1239 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3550. Smallest Index With Digit Sum Equal to Index | Easy | 8.3% | TopicsArrayMath |
| 1603. Design Parking System | Easy | 8.3% | TopicsDesignSimulationCounting |
| 1675. Minimize Deviation in Array | Hard | 8.3% | TopicsArrayGreedyHeap (Priority Queue)Ordered Set |
| 1523. Count Odd Numbers in an Interval Range | Easy | 8.3% | TopicsMath |
| 1674. Minimum Moves to Make Array Complementary | Medium | 8.3% | TopicsArrayHash TablePrefix Sum |
| 3727. Maximum Alternating Sum of Squares | Medium | 8.3% | TopicsArrayGreedySorting |
| Department Highest Salary | Medium | 8.3% | TopicsDatabase |
| 2001. Number of Pairs of Interchangeable Rectangles | Medium | 8.3% | TopicsArrayHash TableMathCountingNumber Theory |
| 2096. Step-By-Step Directions From a Binary Tree Node to Another | Medium | 8.3% | TopicsStringTreeDepth-First SearchBinary TreeBinary LiftingLowest Common Ancestor |
| 2913. Subarrays Distinct Element Sum of Squares I | Easy | 8.3% | TopicsArrayHash TableBinary Indexed TreeSegment Tree |
| Beautiful Arrangement II | Medium | 8.3% | TopicsArrayMath |
| 1824. Minimum Sideway Jumps | Medium | 8.3% | TopicsArrayDynamic ProgrammingGreedy |
| 1569. Number of Ways to Reorder Array to Get Same BST | Hard | 8.3% | TopicsArrayMathDivide and ConquerDynamic ProgrammingTreeUnion-FindBinary Search TreeMemoizationCombinatoricsBinary TreeFermat's Little Theorem |
| 3886. Sum of Sortable Integers | Hard | 8.3% | TopicsArrayMathSortingEnumeration |
