Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Employee Bonus | Easy | 36.2% | TopicsDatabase |
| 2484. Count Palindromic Subsequences | Hard | 36.2% | TopicsStringDynamic Programming |
| 829. Consecutive Numbers Sum | Hard | 36.2% | TopicsMathEnumeration |
| Remove Duplicates from Sorted Array II | Medium | 34.7% | TopicsArrayTwo Pointers |
| 97. Interleaving String | Medium | 34.7% | TopicsStringDynamic Programming |
| Convert Sorted Array to Binary Search Tree | Easy | 34.7% | TopicsArrayDivide and ConquerTreeBinary Search TreeBinary Tree |
| 130. Surrounded Regions | Medium | 34.7% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| Consecutive Numbers | Medium | 34.7% | TopicsDatabase |
| 191. Number of 1 Bits | Easy | 34.7% | TopicsDivide and ConquerBit Manipulation |
| 225. Implement Stack using Queues | Easy | 34.7% | TopicsStackDesignQueue |
| Basic Calculator II | Medium | 34.7% | TopicsMathStringStack |
| 312. Burst Balloons | Hard | 34.7% | TopicsArrayDynamic Programming |
| Remove Duplicate Letters | Medium | 34.7% | TopicsStringStackGreedyMonotonic Stack |
| 452. Minimum Number of Arrows to Burst Balloons | Medium | 34.7% | TopicsArrayGreedySorting |
| 493. Reverse Pairs | Hard | 34.7% | TopicsArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered SetTreap |
| Two Sum IV - Input is a BST | Easy | 34.7% | TopicsHash TableTwo PointersTreeDepth-First SearchBreadth-First SearchBinary Search TreeBinary Tree |
| Find K Closest Elements | Medium | 34.7% | TopicsArrayTwo PointersBinary SearchSliding WindowSortingHeap (Priority Queue) |
| 678. Valid Parenthesis String | Medium | 34.7% | TopicsStringDynamic ProgrammingStackGreedyBracket Sequences |
| Accounts Merge | Medium | 34.7% | TopicsArrayHash TableStringDepth-First SearchBreadth-First SearchUnion-FindSorting |
| Basic Calculator III | Hard | 34.7% | TopicsMathStringStackRecursion |
| 805. Split Array With Same Average | Hard | 34.7% | TopicsArrayHash TableMathDynamic ProgrammingBit ManipulationMeet in the MiddleBitmask |
| 912. Sort an Array | Medium | 34.7% | TopicsArrayDivide and ConquerSortingHeap (Priority Queue)Merge SortBucket SortRadix SortCounting Sort |
| 981. Time Based Key-Value Store | Medium | 34.7% | TopicsHash TableStringBinary SearchDesign |
| Print in Order | Easy | 34.7% | TopicsConcurrency |
| Monthly Transactions I | Medium | 34.7% | TopicsDatabase |
