Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Minimum Cost to Separate Sentence Into Rows | Medium | 27.7% | TopicsStringDynamic Programming |
| 1952. Three Divisors | Easy | 27.7% | TopicsMathEnumerationNumber TheoryPrime FactorizationSieve Theory |
| Average Height of Buildings in Each Segment | Medium | 27.7% | TopicsArraySortingHeap (Priority Queue)Prefix Sum |
| 2028. Find Missing Observations | Medium | 27.7% | TopicsArrayMathSimulation |
| Subsequence of Size K With the Largest Even Sum | Medium | 27.7% | TopicsArrayGreedySorting |
| 2124. Check if All A's Appears Before All B's | Easy | 27.7% | TopicsString |
| Number of Unique Flavors After Sharing K Candies | Medium | 27.7% | TopicsArrayHash TableSliding Window |
| 2208. Minimum Operations to Halve Array Sum | Medium | 27.7% | TopicsArrayGreedyHeap (Priority Queue) |
| All the Matches of the League | Easy | 27.7% | TopicsDatabase |
| 2385. Amount of Time for Binary Tree to Be Infected | Medium | 27.7% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 2391. Minimum Amount of Time to Collect Garbage | Medium | 27.7% | TopicsArrayStringPrefix Sum |
| 2441. Largest Positive Integer That Exists With Its Negative | Easy | 27.7% | TopicsArrayHash TableTwo PointersSorting |
| Number of Distinct Binary Strings After Applying Operations | Medium | 27.7% | TopicsMathString |
| Make the Prefix Sum Non-negative | Medium | 27.7% | TopicsArrayGreedyHeap (Priority Queue) |
| Maximum Price to Fill a Bag | Medium | 27.7% | TopicsArrayGreedySorting |
| Smallest Number With Given Digit Product | Medium | 27.7% | TopicsMathGreedy |
| 3002. Maximum Size of a Set After Removals | Medium | 27.7% | TopicsArrayHash TableGreedy |
| Maximum Subtree of the Same Color | Medium | 27.7% | TopicsArrayDynamic ProgrammingTreeDepth-First Search |
| Maximum Number of Intersections on the Chart | Hard | 27.7% | TopicsArrayHash TableMathBinary Indexed TreeGeometrySweep LineSorting |
| 3038. Maximum Number of Operations With the Same Score I | Easy | 27.7% | TopicsArraySimulation |
| 3134. Find the Median of the Uniqueness Array | Hard | 27.7% | TopicsArrayHash TableBinary SearchSliding Window |
| 3111. Minimum Rectangles to Cover Points | Medium | 27.7% | TopicsArrayGreedySorting |
| Find the Level of Tree with Minimum Sum | Medium | 27.7% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 3212. Count Submatrices With Equal Frequency of X and Y | Medium | 27.7% | TopicsArrayMatrixPrefix Sum |
| Palindrome Partitioning II | Hard | 27.7% | TopicsStringDynamic Programming |
