Bloomberg
1239 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Employees Earning More Than Their Managers | Easy | 46.9% | TopicsDatabase |
| Average Time of Process per Machine | Easy | 46.9% | TopicsDatabase |
| Maximum Average Subarray I | Easy | 45.9% | TopicsArraySliding Window |
| 796. Rotate String | Easy | 45.9% | TopicsStringString Matching |
| 1004. Max Consecutive Ones III | Medium | 45.9% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
| 1011. Capacity To Ship Packages Within D Days | Medium | 45.9% | TopicsArrayBinary Search |
| Article Views I | Easy | 45.9% | TopicsDatabase |
| 1347. Minimum Number of Steps to Make Two Strings Anagram | Medium | 45.9% | TopicsHash TableStringCounting |
| 2149. Rearrange Array Elements by Sign | Medium | 45.9% | TopicsArrayTwo PointersSimulation |
| Students and Examinations | Easy | 45.9% | TopicsDatabase |
| 2965. Find Missing and Repeated Values | Easy | 45.9% | TopicsArrayHash TableMathMatrix |
| 45. Jump Game II | Medium | 44.9% | TopicsArrayDynamic ProgrammingGreedy |
| Search in Rotated Sorted Array II | Medium | 44.9% | TopicsArrayBinary Search |
| Remove Duplicates from Sorted List | Easy | 44.9% | TopicsLinked List |
| Populating Next Right Pointers in Each Node | Medium | 44.9% | TopicsLinked ListTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Intersection of Two Linked Lists | Easy | 44.9% | TopicsHash TableLinked ListTwo Pointers |
| Implement Trie (Prefix Tree) | Medium | 44.9% | TopicsHash TableStringDesignTrie |
| Lowest Common Ancestor of a Binary Tree | Medium | 44.9% | TopicsTreeDepth-First SearchBinary TreeBinary LiftingLowest Common Ancestor |
| Odd Even Linked List | Medium | 44.9% | TopicsLinked List |
| Implement Magic Dictionary | Medium | 44.9% | TopicsHash TableStringDepth-First SearchDesignTrie |
| 692. Top K Frequent Words | Medium | 44.9% | TopicsArrayHash TableStringTrieSortingHeap (Priority Queue)Bucket SortCounting |
| 852. Peak Index in a Mountain Array | Medium | 44.9% | TopicsArrayBinary SearchTernary Search |
| 1482. Minimum Number of Days to Make m Bouquets | Medium | 44.9% | TopicsArrayBinary Search |
| 1614. Maximum Nesting Depth of the Parentheses | Easy | 44.9% | TopicsStringStackBracket Sequences |
| 76. Minimum Window Substring | Hard | 43.9% | TopicsHash TableStringSliding Window |
