Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1095. Find in Mountain Array | Hard | 19.8% | TopicsArrayBinary SearchInteractiveTernary Search |
| 980. Unique Paths III | Hard | 19.8% | TopicsArrayBacktrackingBit ManipulationMatrixHamiltonian Path |
| 1161. Maximum Level Sum of a Binary Tree | Medium | 19.8% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 1108. Defanging an IP Address | Easy | 19.8% | TopicsString |
| 1365. How Many Numbers Are Smaller Than the Current Number | Easy | 19.8% | TopicsArrayHash TableSortingCounting Sort |
| 1356. Sort Integers by The Number of 1 Bits | Easy | 19.8% | TopicsArrayBit ManipulationSortingCounting |
| 2974. Minimum Number Game | Easy | 19.8% | TopicsArraySortingHeap (Priority Queue)Simulation |
| Self Dividing Numbers | Easy | 19.8% | TopicsMath |
| Beautiful Arrangement | Medium | 19.8% | TopicsArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask |
| 1674. Minimum Moves to Make Array Complementary | Medium | 19.8% | TopicsArrayHash TablePrefix Sum |
| 3737. Count Subarrays With Majority Element I | Medium | 19.8% | TopicsArrayHash TableDivide and ConquerSegment TreeMerge SortCountingPrefix Sum |
| 877. Stone Game | Medium | 19.8% | TopicsArrayMathDynamic ProgrammingMinimaxGame TheoryZero-Sum Game |
| 2029. Stone Game IX | Medium | 19.8% | TopicsArrayMathGreedyMinimaxCountingGame TheoryNim GameZero-Sum Game |
| 3883. Count Non Decreasing Arrays With Given Digit Sums | Hard | 19.8% | TopicsArrayDynamic ProgrammingPrefix Sum |
| Count Complete Tree Nodes | Medium | 16.4% | TopicsBinary SearchBit ManipulationTreeBinary Tree |
| Rectangle Area | Medium | 16.4% | TopicsMathGeometry |
| Single Number III | Medium | 16.4% | TopicsArrayBit Manipulation |
| Binary Tree Vertical Order Traversal | Medium | 16.4% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchSortingBinary Tree |
| Frog Jump | Hard | 16.4% | TopicsArrayDynamic Programming |
| Third Maximum Number | Easy | 16.4% | TopicsArraySorting |
| 433. Minimum Genetic Mutation | Medium | 16.4% | TopicsHash TableStringBreadth-First SearchBidirectional Search |
| 465. Optimal Account Balancing | Hard | 16.4% | TopicsArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask |
| Minimum Time Difference | Medium | 16.4% | TopicsArrayMathStringSorting |
| 557. Reverse Words in a String III | Easy | 16.4% | TopicsTwo PointersString |
| 581. Shortest Unsorted Continuous Subarray | Medium | 16.4% | TopicsArrayTwo PointersStackGreedySortingMonotonic Stack |
