Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 202. Happy Number | Easy | 54.8% | TopicsHash TableMathTwo PointersFloyd's Cycle Finding Algorithm |
| 79. Word Search | Medium | 54.4% | TopicsArrayStringBacktrackingDepth-First SearchMatrix |
| 739. Daily Temperatures | Medium | 54.4% | TopicsArrayStackMonotonic Stack |
| Minimum Path Sum | Medium | 53.8% | TopicsArrayDynamic ProgrammingMatrix |
| 102. Binary Tree Level Order Traversal | Medium | 53.8% | TopicsTreeBreadth-First SearchBinary Tree |
| 45. Jump Game II | Medium | 53.3% | TopicsArrayDynamic ProgrammingGreedy |
| Pow(x, n) | Medium | 53.3% | TopicsMathRecursion |
| Lowest Common Ancestor of a Binary Tree | Medium | 53.3% | TopicsTreeDepth-First SearchBinary TreeBinary LiftingLowest Common Ancestor |
| Meeting Rooms II | Medium | 53.3% | TopicsArrayTwo PointersGreedySortingHeap (Priority Queue)Prefix Sum |
| 295. Find Median from Data Stream | Hard | 53.3% | TopicsTwo PointersDesignSortingHeap (Priority Queue)Data Stream |
| 322. Coin Change | Medium | 53.3% | TopicsArrayDynamic ProgrammingBreadth-First SearchKnapsack ProblemComplete Knapsack |
| Fibonacci Number | Easy | 53.3% | TopicsMathDynamic ProgrammingRecursionMemoization |
| 1004. Max Consecutive Ones III | Medium | 53.3% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
| 4Sum | Medium | 52.8% | TopicsArrayTwo PointersSorting |
| 19. Remove Nth Node From End of List | Medium | 52.8% | TopicsLinked ListTwo Pointers |
| 34. Find First and Last Position of Element in Sorted Array | Medium | 52.8% | TopicsArrayBinary Search |
| 74. Search a 2D Matrix | Medium | 52.8% | TopicsArrayBinary SearchMatrix |
| String to Integer (atoi) | Medium | 52.2% | TopicsString |
| 136. Single Number | Easy | 51.7% | TopicsArrayBit Manipulation |
| 207. Course Schedule | Medium | 51.7% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| 12. Integer to Roman | Medium | 51.1% | TopicsHash TableMathString |
| 104. Maximum Depth of Binary Tree | Easy | 51.1% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Basic Calculator | Hard | 51.1% | TopicsMathStringStackRecursion |
| 93. Restore IP Addresses | Medium | 50.5% | TopicsStringBacktracking |
| 139. Word Break | Medium | 50.5% | TopicsArrayHash TableStringDynamic ProgrammingTrieMemoizationBrute-Force Search |
