Bloomberg
1239 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1611. Minimum One Bit Operations to Make Integers Zero | Hard | 8.3% | TopicsMathDynamic ProgrammingBit ManipulationRecursionMemoization |
| 1240. Tiling a Rectangle with the Fewest Squares | Hard | 8.3% | TopicsBacktracking |
| Design Tic-Tac-Toe | Medium | 8.3% | TopicsArrayHash TableDesignMatrixSimulation |
| 1948. Delete Duplicate Folders in System | Hard | 8.3% | TopicsArrayHash TableStringDepth-First SearchTrieSortingHash Function |
| 768. Max Chunks To Make Sorted II | Hard | 8.3% | TopicsArrayStackGreedySortingMonotonic Stack |
| 3234. Count the Number of Substrings With Dominant Ones | Medium | 8.3% | TopicsStringEnumeration |
| 1437. Check If All 1's Are at Least Length K Places Away | Easy | 8.3% | TopicsArray |
| 1-bit and 2-bit Characters | Easy | 8.3% | TopicsArray |
| 623. Add One Row to Tree | Medium | 8.3% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 2154. Keep Multiplying Found Values by Two | Easy | 8.3% | TopicsArrayHash TableSortingSimulation |
| 880. Decoded String at Index | Medium | 8.3% | TopicsStringStack |
| 3006. Find Beautiful Indices in the Given Array I | Medium | 8.3% | TopicsTwo PointersStringBinary SearchRolling HashString MatchingHash FunctionZ AlgorithmKnuth–Morris–Pratt AlgorithmBoyer–Moore String-Search Algorithm |
| 1015. Smallest Integer Divisible by K | Medium | 8.3% | TopicsHash TableMathPigeonhole Principle |
| 2141. Maximum Running Time of N Computers | Hard | 8.3% | TopicsArrayBinary SearchGreedySorting |
| 759. Employee Free Time | Hard | 8.3% | TopicsArraySweep LineSortingHeap (Priority Queue) |
| 3432. Count Partitions with Even Sum Difference | Easy | 8.3% | TopicsArrayMathPrefix Sum |
| Closest Binary Search Tree Value | Easy | 8.3% | TopicsBinary SearchTreeDepth-First SearchBinary Search TreeBinary Tree |
| Tree Node | Medium | 8.3% | TopicsDatabase |
| Student Attendance Record II | Hard | 8.3% | TopicsDynamic Programming |
| 1386. Cinema Seat Allocation | Medium | 8.3% | TopicsArrayHash TableGreedyBit Manipulation |
| 2551. Put Marbles in Bags | Hard | 8.3% | TopicsArrayGreedySortingHeap (Priority Queue) |
| 3623. Count Number of Trapezoids I | Medium | 8.3% | TopicsArrayHash TableMathGeometry |
| 3433. Count Mentions Per User | Medium | 8.3% | TopicsArrayMathSortingSimulation |
| 2147. Number of Ways to Divide a Long Corridor | Hard | 8.3% | TopicsMathStringDynamic Programming |
| 3484. Design Spreadsheet | Medium | 8.3% | TopicsArrayHash TableStringDesignMatrix |
