Bloomberg
1239 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2226. Maximum Candies Allocated to K Children | Medium | 17.9% | TopicsArrayBinary Search |
| 2401. Longest Nice Subarray | Medium | 17.9% | TopicsArrayBit ManipulationSliding Window |
| 871. Minimum Number of Refueling Stops | Hard | 17.9% | TopicsArrayDynamic ProgrammingGreedyHeap (Priority Queue) |
| 3394. Check if Grid can be Cut into Sections | Medium | 17.9% | TopicsArraySorting |
| 2874. Maximum Value of an Ordered Triplet II | Medium | 17.9% | TopicsArrayPrefix Sum |
| 2843. Count Symmetric Integers | Easy | 17.9% | TopicsMathEnumeration |
| 2404. Most Frequent Even Element | Easy | 17.9% | TopicsArrayHash TableCounting |
| 2962. Count Subarrays Where Max Element Appears at Least K Times | Medium | 17.9% | TopicsArraySliding Window |
| 838. Push Dominoes | Medium | 17.9% | TopicsTwo PointersStringDynamic Programming |
| 3362. Zero Array Transformation III | Medium | 17.9% | TopicsArrayTwo PointersGreedySortingHeap (Priority Queue)Prefix Sum |
| Biggest Single Number | Easy | 17.9% | TopicsDatabase |
| 1544. Make The String Great | Easy | 17.9% | TopicsStringStack |
| 2460. Apply Operations to an Array | Easy | 17.9% | TopicsArrayTwo PointersSimulation |
| 2643. Row With Maximum Ones | Easy | 17.9% | TopicsArrayMatrix |
| 3443. Maximum Manhattan Distance After K Changes | Medium | 17.9% | TopicsHash TableMathStringCounting |
| 1926. Nearest Exit from Entrance in Maze | Medium | 17.9% | TopicsArrayBreadth-First SearchMatrix |
| 792. Number of Matching Subsequences | Medium | 17.9% | TopicsArrayHash TableStringBinary SearchDynamic ProgrammingTrieSorting |
| 3147. Taking Maximum Energy From the Mystic Dungeon | Medium | 17.9% | TopicsArrayDynamic ProgrammingPrefix Sum |
| 1751. Maximum Number of Events That Can Be Attended II | Hard | 17.9% | TopicsArrayBinary SearchDynamic ProgrammingSorting |
| 968. Binary Tree Cameras | Hard | 17.9% | TopicsDynamic ProgrammingTreeDepth-First SearchBinary TreeDP on Trees |
| 3202. Find the Maximum Length of Valid Subsequence II | Medium | 17.9% | TopicsArrayDynamic Programming |
| 2300. Successful Pairs of Spells and Potions | Medium | 17.9% | TopicsArrayTwo PointersBinary SearchSorting |
| 2210. Count Hills and Valleys in an Array | Easy | 17.9% | TopicsArray |
| 2411. Smallest Subarrays With Maximum Bitwise OR | Medium | 17.9% | TopicsArrayBinary SearchBit ManipulationSliding Window |
| 2264. Largest 3-Same-Digit Number in String | Easy | 17.9% | TopicsString |
