Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3578. Count Partitions With Max-Min Difference at Most K | Medium | 7.5% | TopicsArrayDynamic ProgrammingQueueSliding WindowPrefix SumMonotonic Queue |
| 1018. Binary Prefix Divisible By 5 | Easy | 7.5% | TopicsArrayBit Manipulation |
| 1250. Check If It Is a Good Array | Hard | 7.5% | TopicsArrayMathNumber TheoryBézout's LemmaEuclidean AlgorithmGreatest Common DivisorExtended Euclidean Algorithm |
| 2110. Number of Smooth Descent Periods of a Stock | Medium | 7.5% | TopicsArrayMathTwo PointersDynamic ProgrammingSliding Window |
| 2147. Number of Ways to Divide a Long Corridor | Hard | 7.5% | TopicsMathStringDynamic Programming |
| Design Bounded Blocking Queue | Medium | 7.5% | TopicsConcurrency |
| 3652. Best Time to Buy and Sell Stock using Strategy | Medium | 7.5% | TopicsArraySliding WindowPrefix Sum |
| 3658. GCD of Odd and Even Sums | Easy | 7.5% | TopicsMathNumber Theory |
| 3193. Count the Number of Inversions | Hard | 7.5% | TopicsArrayDynamic Programming |
| 1411. Number of Ways to Paint N × 3 Grid | Hard | 7.5% | TopicsDynamic ProgrammingGraph Coloring |
| 2798. Number of Employees Who Met the Target | Easy | 7.5% | TopicsArray |
| 1266. Minimum Time Visiting All Points | Easy | 7.5% | TopicsArrayMathGeometry |
| 3203. Find Minimum Diameter After Merging Two Trees | Hard | 7.5% | TopicsTreeDepth-First SearchBreadth-First SearchGraph Theory |
| 3803. Count Residue Prefixes | Easy | 7.5% | TopicsHash TableString |
| 3314. Construct the Minimum Bitwise Array I | Easy | 7.5% | TopicsArrayBit Manipulation |
| Binary Tree Level Order Traversal II | Medium | 7.5% | TopicsTreeBreadth-First SearchBinary Tree |
| Calculator with Method Chaining | Easy | 7.5% | Topics— |
| 3006. Find Beautiful Indices in the Given Array I | Medium | 7.5% | TopicsTwo PointersStringBinary SearchRolling HashString MatchingHash FunctionZ AlgorithmKnuth–Morris–Pratt AlgorithmBoyer–Moore String-Search Algorithm |
| 3510. Minimum Pair Removal to Sort Array II | Hard | 7.5% | TopicsArrayHash TableLinked ListHeap (Priority Queue)SimulationDoubly-Linked ListOrdered Set |
| 788. Rotated Digits | Medium | 7.5% | TopicsMathDynamic Programming |
| 1984. Minimum Difference Between Highest and Lowest of K Scores | Easy | 7.5% | TopicsArraySliding WindowSorting |
| 3797. Count Routes to Climb a Rectangular Grid | Hard | 7.5% | TopicsArrayDynamic ProgrammingMatrixPrefix Sum |
| 1624. Largest Substring Between Two Equal Characters | Easy | 7.5% | TopicsHash TableString |
| 1326. Minimum Number of Taps to Open to Water a Garden | Hard | 7.5% | TopicsArrayDynamic ProgrammingGreedy |
| 3650. Minimum Cost Path with Edge Reversals | Medium | 7.5% | TopicsGraph TheoryHeap (Priority Queue)Shortest Path |
