Bloomberg
1239 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Scramble String | Hard | 8.3% | TopicsStringDynamic Programming |
| 3333. Find the Original Typed String II | Hard | 8.3% | TopicsStringDynamic ProgrammingPrefix Sum |
| 3307. Find the K-th Character in String Game II | Hard | 8.3% | TopicsMathBit ManipulationRecursion |
| Find Followers Count | Easy | 8.3% | TopicsDatabase |
| Student Attendance Record I | Easy | 8.3% | TopicsString |
| 3439. Reschedule Meetings for Maximum Free Time I | Medium | 8.3% | TopicsArrayGreedySliding Window |
| 1900. The Earliest and Latest Rounds Where Players Compete | Hard | 8.3% | TopicsDynamic ProgrammingMemoization |
| 899. Orderly Queue | Hard | 8.3% | TopicsMathStringSortingLexicographically Minimal String Rotation |
| 2163. Minimum Difference in Sums After Removal of Elements | Hard | 8.3% | TopicsArrayDynamic ProgrammingHeap (Priority Queue) |
| Memoize | Medium | 8.3% | Topics— |
| 1695. Maximum Erasure Value | Medium | 8.3% | TopicsArrayHash TableSliding Window |
| 3274. Check if Two Chessboard Squares Have the Same Color | Easy | 8.3% | TopicsMathString |
| Add Two Promises | Easy | 8.3% | Topics— |
| 3480. Maximize Subarrays After Removing One Conflicting Pair | Hard | 8.3% | TopicsArraySegment TreeEnumerationPrefix Sum |
| 2044. Count Number of Maximum Bitwise-OR Subsets | Medium | 8.3% | TopicsArrayBacktrackingBit ManipulationEnumeration |
| 1202. Smallest String With Swaps | Medium | 8.3% | TopicsArrayHash TableStringDepth-First SearchBreadth-First SearchUnion-FindSorting |
| 2561. Rearranging Fruits | Hard | 8.3% | TopicsArrayHash TableGreedySort |
| 991. Broken Calculator | Medium | 8.3% | TopicsMathGreedy |
| 2597. The Number of Beautiful Subsets | Medium | 8.3% | TopicsArrayHash TableMathDynamic ProgrammingBacktrackingSortingCombinatorics |
| 2535. Difference Between Element Sum and Digit Sum of an Array | Easy | 8.3% | TopicsArrayMath |
| The Maze | Medium | 8.3% | TopicsArrayDepth-First SearchBreadth-First SearchMatrix |
| Number of Distinct Substrings in a String | Medium | 8.3% | TopicsStringTrieRolling HashSuffix ArrayHash Function |
| 2582. Pass the Pillow | Easy | 8.3% | TopicsMathSimulation |
| 1851. Minimum Interval to Include Each Query | Hard | 8.3% | TopicsArrayBinary SearchSweep LineSortingHeap (Priority Queue) |
| Bitwise AND of Numbers Range | Medium | 8.3% | TopicsBit Manipulation |