Bloomberg
1239 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3042. Count Prefix and Suffix Pairs I | Easy | 13.5% | TopicsArrayStringTrieRolling HashString MatchingHash Function |
| 2116. Check if a Parentheses String Can Be Valid | Medium | 13.5% | TopicsStringStackGreedyBracket Sequences |
| 2657. Find the Prefix Common Array of Two Arrays | Medium | 13.5% | TopicsArrayHash TableBit Manipulation |
| Merge Two Binary Trees | Easy | 13.5% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 1293. Shortest Path in a Grid with Obstacles Elimination | Hard | 13.5% | TopicsArrayBreadth-First SearchMatrix |
| Shortest Distance from All Buildings | Hard | 13.5% | TopicsArrayBreadth-First SearchMatrix |
| 581. Shortest Unsorted Continuous Subarray | Medium | 13.5% | TopicsArrayTwo PointersStackGreedySortingMonotonic Stack |
| 3160. Find the Number of Distinct Colors Among the Balls | Medium | 13.5% | TopicsArrayHash TableSimulation |
| Construct Quad Tree | Medium | 13.5% | TopicsArrayDivide and ConquerTreeMatrix |
| 1352. Product of the Last K Numbers | Medium | 13.5% | TopicsArrayMathDesignData StreamPrefix Sum |
| Count Salary Categories | Medium | 13.5% | TopicsDatabase |
| 889. Construct Binary Tree from Preorder and Postorder Traversal | Medium | 13.5% | TopicsArrayHash TableDivide and ConquerTreeBinary Tree |
| 873. Length of Longest Fibonacci Subsequence | Medium | 13.5% | TopicsArrayHash TableDynamic Programming |
| 2579. Count Total Number of Colored Cells | Medium | 13.5% | TopicsMath |
| 2523. Closest Prime Numbers in Range | Medium | 13.5% | TopicsMathNumber TheoryPrimality TestSieve TheoryPrime Number Sieve |
| 286. Walls and Gates | Medium | 13.5% | TopicsArrayBreadth-First SearchMatrix |
| 3208. Alternating Groups II | Medium | 13.5% | TopicsArraySliding Window |
| 417. Pacific Atlantic Water Flow | Medium | 13.5% | TopicsArrayDepth-First SearchBreadth-First SearchMatrix |
| 3453. Separate Squares I | Medium | 13.5% | TopicsArrayBinary Search |
| 1123. Lowest Common Ancestor of Deepest Leaves | Medium | 13.5% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchBinary TreeBinary LiftingLowest Common AncestorDP on Trees |
| 3396. Minimum Number of Operations to Make Elements in Array Distinct | Easy | 13.5% | TopicsArrayHash Table |
| 1399. Count Largest Group | Easy | 13.5% | TopicsHash TableMathCounting |
| 832. Flipping an Image | Easy | 13.5% | TopicsArrayTwo PointersBit ManipulationMatrixSimulation |
| 2974. Minimum Number Game | Easy | 13.5% | TopicsArraySortingHeap (Priority Queue)Simulation |
| 3310. Remove Methods From Project | Medium | 13.5% | TopicsDepth-First SearchBreadth-First SearchGraph Theory |
