Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Flatten Deeply Nested Array | Medium | 7.5% | Topics— |
| 3483. Unique 3-Digit Even Numbers | Easy | 7.5% | TopicsArrayHash TableRecursionEnumeration |
| 932. Beautiful Array | Medium | 7.5% | TopicsArrayMathDivide and Conquer |
| 835. Image Overlap | Medium | 7.5% | TopicsArrayMatrix |
| 1603. Design Parking System | Easy | 7.5% | TopicsDesignSimulationCounting |
| 1611. Minimum One Bit Operations to Make Integers Zero | Hard | 7.5% | TopicsMathDynamic ProgrammingBit ManipulationRecursionMemoization |
| Queue Reconstruction by Height | Medium | 7.5% | TopicsArrayBinary Indexed TreeSegment TreeSorting |
| 2438. Range Product Queries of Powers | Medium | 7.5% | TopicsArrayBit ManipulationPrefix Sum |
| 3849. Maximum Bitwise XOR After Rearrangement | Medium | 7.5% | TopicsStringGreedyBit Manipulation |
| 2434. Using a Robot to Print the Lexicographically Smallest String | Medium | 7.5% | TopicsHash TableStringStackGreedy |
| Circular Array Loop | Medium | 7.5% | TopicsArrayHash TableTwo PointersFloyd's Cycle Finding Algorithm |
| 2164. Sort Even and Odd Indices Independently | Easy | 7.5% | TopicsArraySorting |
| 3488. Closest Equal Element Queries | Medium | 7.5% | TopicsArrayHash TableBinary Search |
| Number of Divisible Triplet Sums | Medium | 7.5% | TopicsArrayHash Table |
| 782. Transform to Chessboard | Hard | 7.5% | TopicsArrayMathBit ManipulationMatrix |
| Print Binary Tree | Medium | 7.5% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 2574. Left and Right Sum Differences | Easy | 7.5% | TopicsArrayPrefix Sum |
| 1492. The kth Factor of n | Medium | 7.5% | TopicsMathNumber TheoryPrime Factorization |
| 1331. Rank Transform of an Array | Easy | 7.5% | TopicsArrayHash TableSorting |
| 2550. Count Collisions of Monkeys on a Polygon | Medium | 7.5% | TopicsMathRecursion |
| 1550. Three Consecutive Odds | Easy | 7.5% | TopicsArray |
