Bloomberg
1239 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1572. Matrix Diagonal Sum | Easy | 13.5% | TopicsArrayMatrix |
| 2529. Maximum Count of Positive Integer and Negative Integer | Easy | 13.5% | TopicsArrayBinary SearchCounting |
| 3498. Reverse Degree of a String | Easy | 13.5% | TopicsStringSimulation |
| 1096. Brace Expansion II | Hard | 13.5% | TopicsHash TableStringBacktrackingStackBreadth-First SearchSorting |
| 1111. Maximum Nesting Depth of Two Valid Parentheses Strings | Medium | 13.5% | TopicsStringStackBracket Sequences |
| 2333. Minimum Sum of Squared Difference | Medium | 13.5% | TopicsArrayBinary SearchGreedySortingHeap (Priority Queue) |
| 2778. Sum of Squares of Special Elements | Easy | 13.5% | TopicsArrayEnumeration |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 8.3% | TopicsArrayHash TableDivide and ConquerTreeBinary Tree |
| Find Right Interval | Medium | 8.3% | TopicsArrayBinary SearchSorting |
| 501. Find Mode in Binary Search Tree | Easy | 8.3% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| 718. Maximum Length of Repeated Subarray | Medium | 8.3% | TopicsArrayBinary SearchDynamic ProgrammingSliding WindowRolling HashHash Function |
| Design HashSet | Easy | 8.3% | TopicsArrayHash TableLinked ListDesignHash Function |
| 935. Knight Dialer | Medium | 8.3% | TopicsDynamic Programming |
| 986. Interval List Intersections | Medium | 8.3% | TopicsArrayTwo PointersSweep Line |
| 1027. Longest Arithmetic Subsequence | Medium | 8.3% | TopicsArrayHash TableBinary SearchDynamic Programming |
| 1042. Flower Planting With No Adjacent | Medium | 8.3% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryGraph Coloring |
| 1044. Longest Duplicate Substring | Hard | 8.3% | TopicsStringBinary SearchSliding WindowRolling HashSuffix ArrayHash FunctionSuffix AutomatonSuffix TreeZ AlgorithmBoyer–Moore String-Search Algorithm |
| 1122. Relative Sort Array | Easy | 8.3% | TopicsArrayHash TableSortingCounting SortQuicksortBubble Sort |
| 1289. Minimum Falling Path Sum II | Hard | 8.3% | TopicsArrayDynamic ProgrammingMatrix |
| 2273. Find Resultant Array After Removing Anagrams | Easy | 8.3% | TopicsArrayHash TableStringSorting |
| 1282. Group the People Given the Group Size They Belong To | Medium | 8.3% | TopicsArrayHash TableGreedy |
| 1518. Water Bottles | Easy | 8.3% | TopicsMathSimulation |
| 1547. Minimum Cost to Cut a Stick | Hard | 8.3% | TopicsArrayDynamic ProgrammingSorting |
| Patients With a Condition | Easy | 8.3% | TopicsDatabase |
| 1578. Minimum Time to Make Rope Colorful | Medium | 8.3% | TopicsArrayStringDynamic ProgrammingGreedy |
