Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3197. Find the Minimum Area to Cover All Ones II | Hard | 12.3% | TopicsArrayMatrixEnumeration |
| 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | 12.3% | TopicsDynamic ProgrammingGraph TheoryShortest PathDijkstra's AlgorithmBellman–Ford AlgorithmFloyd–Warshall Algorithm |
| 3234. Count the Number of Substrings With Dominant Ones | Medium | 12.3% | TopicsStringEnumeration |
| 847. Shortest Path Visiting All Nodes | Hard | 12.3% | TopicsDynamic ProgrammingBit ManipulationBreadth-First SearchGraph TheoryBitmask |
| Percentage of Users Attended a Contest | Easy | 12.3% | TopicsDatabase |
| 1932. Merge BSTs to Create Single BST | Hard | 12.3% | TopicsArrayHash TableTreeDepth-First SearchBinary Search TreeBinary Tree |
| Split Linked List in Parts | Medium | 12.3% | TopicsLinked List |
| 941. Valid Mountain Array | Easy | 12.3% | TopicsArray |
| 1688. Count of Matches in Tournament | Easy | 12.3% | TopicsMathSimulation |
| 1381. Design a Stack With Increment Operation | Medium | 12.3% | TopicsArrayStackDesign |
| 1614. Maximum Nesting Depth of the Parentheses | Easy | 12.3% | TopicsStringStackBracket Sequences |
| 1590. Make Sum Divisible by P | Medium | 12.3% | TopicsArrayHash TablePrefix Sum |
| Range Sum Query 2D - Immutable | Medium | 12.3% | TopicsArrayDesignMatrixPrefix Sum |
| 3163. String Compression III | Medium | 12.3% | TopicsString |
| 286. Walls and Gates | Medium | 12.3% | TopicsArrayBreadth-First SearchMatrix |
| 1957. Delete Characters to Make Fancy String | Easy | 12.3% | TopicsString |
| 2769. Find the Maximum Achievable Number | Easy | 12.3% | TopicsMath |
| 1652. Defuse the Bomb | Easy | 12.3% | TopicsArraySliding Window |
| 1072. Flip Columns For Maximum Number of Equal Rows | Medium | 12.3% | TopicsArrayHash TableMatrix |
| 1861. Rotating the Box | Medium | 12.3% | TopicsArrayTwo PointersMatrix |
| List the Products Ordered in a Period | Easy | 12.3% | TopicsDatabase |
| 2577. Minimum Time to Visit a Cell In a Grid | Hard | 12.3% | TopicsArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)MatrixShortest Path |
| Fix Names in a Table | Easy | 12.3% | TopicsDatabase |
| K Inverse Pairs Array | Hard | 12.3% | TopicsDynamic Programming |
| 3264. Final Array State After K Multiplication Operations I | Easy | 12.3% | TopicsArrayMathHeap (Priority Queue)Simulation |
