Bloomberg
1239 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3737. Count Subarrays With Majority Element I | Medium | 8.3% | TopicsArrayHash TableDivide and ConquerSegment TreeMerge SortCountingPrefix Sum |
| 1793. Maximum Score of a Good Subarray | Hard | 8.3% | TopicsArrayTwo PointersBinary SearchStackMonotonic StackCartesian Tree |
| 1967. Number of Strings That Appear as Substrings in Word | Easy | 8.3% | TopicsArrayString |
| 2306. Naming a Company | Hard | 8.3% | TopicsArrayHash TableStringBit ManipulationEnumeration |
| 1846. Maximum Element After Decreasing and Rearranging | Medium | 8.3% | TopicsArrayGreedySorting |
| Base 7 | Easy | 8.3% | TopicsMathString |
| 2466. Count Ways To Build Good Strings | Medium | 8.3% | TopicsDynamic Programming |
| 2812. Find the Safest Path in a Grid | Medium | 8.3% | TopicsArrayBinary SearchBreadth-First SearchUnion-FindHeap (Priority Queue)Matrix |
| 2350. Shortest Impossible Sequence of Rolls | Hard | 8.3% | TopicsArrayHash TableGreedy |
| 3016. Minimum Number of Pushes to Type Word II | Medium | 8.3% | TopicsHash TableStringGreedySortingCounting |
| 3620. Network Recovery Pathways | Hard | 8.3% | TopicsArrayBinary SearchDynamic ProgrammingGraph TheoryTopological SortHeap (Priority Queue)Shortest Path |
| 2456. Most Popular Video Creator | Medium | 8.3% | TopicsArrayHash TableStringSortingHeap (Priority Queue) |
| 3756. Concatenate Non-Zero Digits and Multiply by Sum II | Medium | 8.3% | TopicsMathStringPrefix Sum |
| 3534. Path Existence Queries in a Graph II | Hard | 8.3% | TopicsArrayTwo PointersBinary SearchDynamic ProgrammingGreedyBit ManipulationGraph TheorySorting |
| 1483. Kth Ancestor of a Tree Node | Hard | 8.3% | TopicsBinary SearchDynamic ProgrammingBit ManipulationTreeDepth-First SearchBreadth-First SearchDesignBinary Lifting |
| 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | 8.3% | TopicsArraySliding Window |
| 3312. Sorted GCD Pair Queries | Hard | 8.3% | TopicsArrayHash TableMathBinary SearchCombinatoricsCountingNumber TheoryPrefix SumEuclidean AlgorithmGreatest Common Divisor |
| 834. Sum of Distances in Tree | Hard | 8.3% | TopicsDynamic ProgrammingTreeDepth-First SearchGraph TheoryDP on Trees |
| Maximum Binary Tree | Medium | 8.3% | TopicsArrayDivide and ConquerStackTreeMonotonic StackBinary TreeCartesian Tree |
| 3499. Maximize Active Section with Trade I | Medium | 8.3% | TopicsStringEnumeration |
| 3501. Maximize Active Section with Trade II | Hard | 8.3% | TopicsArrayStringBinary SearchSegment Tree |
| 872. Leaf-Similar Trees | Easy | 8.3% | TopicsTreeDepth-First SearchBinary Tree |
| 3514. Number of Unique XOR Triplets II | Medium | 8.3% | TopicsArrayMathBit ManipulationEnumeration |
| 2602. Minimum Operations to Make All Array Elements Equal | Medium | 8.3% | TopicsArrayBinary SearchSortingPrefix Sum |
| 778. Swim in Rising Water | Hard | 8.3% | TopicsArrayBinary SearchDepth-First SearchBreadth-First SearchUnion-FindMinimaxHeap (Priority Queue)MatrixDijkstra's Algorithm |
