Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Evaluate Division | Medium | 22.8% | TopicsArrayStringDepth-First SearchBreadth-First SearchUnion-FindGraph TheoryShortest PathBellman–Ford AlgorithmFloyd–Warshall Algorithm |
| Trapping Rain Water II | Hard | 22.8% | TopicsArrayBreadth-First SearchHeap (Priority Queue)Matrix |
| 421. Maximum XOR of Two Numbers in an Array | Medium | 22.8% | TopicsArrayHash TableBit ManipulationTrie |
| 523. Continuous Subarray Sum | Medium | 22.8% | TopicsArrayHash TableMathPrefix SumPigeonhole Principle |
| 572. Subtree of Another Tree | Easy | 22.8% | TopicsTreeDepth-First SearchString MatchingBinary TreeHash Function |
| Robot Return to Origin | Easy | 22.8% | TopicsStringSimulation |
| 692. Top K Frequent Words | Medium | 22.8% | TopicsArrayHash TableStringTrieSortingHeap (Priority Queue)Bucket SortCounting |
| 752. Open the Lock | Medium | 22.8% | TopicsArrayHash TableStringBreadth-First SearchBidirectional Search |
| 763. Partition Labels | Medium | 22.8% | TopicsHash TableTwo PointersStringGreedy |
| 867. Transpose Matrix | Easy | 22.8% | TopicsArrayMatrixSimulation |
| 909. Snakes and Ladders | Medium | 22.8% | TopicsArrayBreadth-First SearchMatrix |
| 973. K Closest Points to Origin | Medium | 22.8% | TopicsArrayMathDivide and ConquerGeometrySortingHeap (Priority Queue)QuickselectK-D Tree |
| 1047. Remove All Adjacent Duplicates In String | Easy | 22.8% | TopicsStringStack |
| 1051. Height Checker | Easy | 22.8% | TopicsArraySortingCounting SortBubble Sort |
| 1146. Snapshot Array | Medium | 22.8% | TopicsArrayHash TableBinary SearchDesignPersistent Data Structure |
| 1209. Remove All Adjacent Duplicates in String II | Medium | 22.8% | TopicsStringStack |
| 1781. Sum of Beauty of All Substrings | Medium | 22.8% | TopicsHash TableStringCounting |
| 2502. Design Memory Allocator | Medium | 22.8% | TopicsArrayHash TableDesignSimulation |
| To Be Or Not To Be | Easy | 22.8% | Topics— |
| 389. Find the Difference | Easy | 22.8% | TopicsHash TableStringBit ManipulationSorting |
| 2401. Longest Nice Subarray | Medium | 22.8% | TopicsArrayBit ManipulationSliding Window |
| Immediate Food Delivery II | Medium | 22.8% | TopicsDatabase |
| 1046. Last Stone Weight | Easy | 22.8% | TopicsArrayHeap (Priority Queue) |
| 1531. String Compression II | Hard | 22.8% | TopicsStringDynamic Programming |
| 1008. Construct Binary Search Tree from Preorder Traversal | Medium | 22.8% | TopicsArrayStackTreeBinary Search TreeMonotonic StackBinary Tree |
