Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 258. Add Digits | Easy | 40.9% | TopicsMathSimulationNumber Theory |
| 402. Remove K Digits | Medium | 40.9% | TopicsStringStackGreedyMonotonic Stack |
| 412. Fizz Buzz | Easy | 40.9% | TopicsMathStringSimulation |
| 438. Find All Anagrams in a String | Medium | 40.9% | TopicsHash TableStringSliding Window |
| 451. Sort Characters By Frequency | Medium | 40.9% | TopicsHash TableStringSortingHeap (Priority Queue)Bucket SortCounting |
| LFU Cache | Hard | 40.9% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 605. Can Place Flowers | Easy | 40.9% | TopicsArrayGreedy |
| 1539. Kth Missing Positive Number | Easy | 40.9% | TopicsArrayBinary Search |
| Average Time of Process per Machine | Easy | 40.9% | TopicsDatabase |
| Number of Provinces | Medium | 40.9% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| Multiply Strings | Medium | 39.8% | TopicsMathStringSimulation |
| 57. Insert Interval | Medium | 39.8% | TopicsArray |
| 58. Length of Last Word | Easy | 39.8% | TopicsString |
| 61. Rotate List | Medium | 39.8% | TopicsLinked ListTwo Pointers |
| Flatten Binary Tree to Linked List | Medium | 39.8% | TopicsLinked ListStackTreeDepth-First SearchBinary Tree |
| Populating Next Right Pointers in Each Node II | Medium | 39.8% | TopicsLinked ListTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 148. Sort List | Medium | 39.8% | TopicsLinked ListTwo PointersDivide and ConquerSortingMerge Sort |
| Binary Search Tree Iterator | Medium | 39.8% | TopicsStackTreeDesignBinary Search TreeBinary TreeIterator |
| Majority Element II | Medium | 39.8% | TopicsArrayHash TableSortingCountingBoyer–Moore Majority Vote Algorithm |
| 907. Sum of Subarray Minimums | Medium | 39.8% | TopicsArrayDynamic ProgrammingStackMonotonic Stack |
| 992. Subarrays with K Different Integers | Hard | 39.8% | TopicsArrayHash TableSliding WindowCounting |
| Article Views I | Easy | 39.8% | TopicsDatabase |
| 1480. Running Sum of 1d Array | Easy | 39.8% | TopicsArrayPrefix Sum |
| Longest Palindromic Subsequence | Medium | 39.8% | TopicsStringDynamic Programming |
| Recover Binary Search Tree | Medium | 38.7% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
