Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3191. Minimum Operations to Make Binary Array Elements Equal to One I | Medium | 16.4% | TopicsArrayBit ManipulationQueueSliding WindowPrefix Sum |
| Memoize | Medium | 16.4% | Topics— |
| 1863. Sum of All Subset XOR Totals | Easy | 16.4% | TopicsArrayMathBacktrackingBit ManipulationCombinatoricsEnumeration |
| 2537. Count the Number of Good Subarrays | Medium | 16.4% | TopicsArrayHash TableSliding Window |
| 983. Minimum Cost For Tickets | Medium | 16.4% | TopicsArrayDynamic Programming |
| 2302. Count Subarrays With Score Less Than K | Hard | 16.4% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
| Exclusive Time of Functions | Medium | 16.4% | TopicsArrayStack |
| 1903. Largest Odd Number in String | Easy | 16.4% | TopicsMathStringGreedy |
| 2101. Detonate the Maximum Bombs | Medium | 16.4% | TopicsArrayMathDepth-First SearchBreadth-First SearchGraph TheoryGeometry |
| 3403. Find the Lexicographically Largest String From the Box I | Medium | 16.4% | TopicsTwo PointersStringEnumeration |
| Actors and Directors Who Cooperated At Least Three Times | Easy | 16.4% | TopicsDatabase |
| 1859. Sorting the Sentence | Easy | 16.4% | TopicsStringSortingBubble Sort |
| 951. Flip Equivalent Binary Trees | Medium | 16.4% | TopicsTreeDepth-First SearchBinary Tree |
| 1319. Number of Operations to Make Network Connected | Medium | 16.4% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 1696. Jump Game VI | Medium | 16.4% | TopicsArrayDynamic ProgrammingQueueHeap (Priority Queue)Monotonic Queue |
| Convert BST to Greater Tree | Medium | 16.4% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| 2040. Kth Smallest Product of Two Sorted Arrays | Hard | 16.4% | TopicsArrayBinary Search |
| 958. Check Completeness of a Binary Tree | Medium | 16.4% | TopicsTreeBreadth-First SearchBinary Tree |
| 1094. Car Pooling | Medium | 16.4% | TopicsArraySortingHeap (Priority Queue)SimulationPrefix Sum |
| 1572. Matrix Diagonal Sum | Easy | 16.4% | TopicsArrayMatrix |
| 3333. Find the Original Typed String II | Hard | 16.4% | TopicsStringDynamic ProgrammingPrefix Sum |
| 754. Reach a Number | Medium | 16.4% | TopicsMathBinary Search |
| 3202. Find the Maximum Length of Valid Subsequence II | Medium | 16.4% | TopicsArrayDynamic Programming |
| 821. Shortest Distance to a Character | Easy | 16.4% | TopicsArrayTwo PointersString |
| 2592. Maximize Greatness of an Array | Medium | 16.4% | TopicsArrayTwo PointersGreedySorting |
