Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1466. Reorder Routes to Make All Paths Lead to the City Zero | Medium | 37.5% | TopicsDepth-First SearchBreadth-First SearchGraph Theory |
| 334. Increasing Triplet Subsequence | Medium | 37.5% | TopicsArrayGreedyLongest Increasing Subsequence |
| Diagonal Traverse | Medium | 37.5% | TopicsArrayMatrixSimulation |
| 622. Design Circular Queue | Medium | 37.5% | TopicsArrayLinked ListDesignQueue |
| 761. Special Binary String | Hard | 37.5% | TopicsStringDivide and ConquerSorting |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 36.2% | TopicsArrayHash TableDivide and ConquerTreeBinary Tree |
| Best Time to Buy and Sell Stock III | Hard | 36.2% | TopicsArrayDynamic Programming |
| 165. Compare Version Numbers | Medium | 36.2% | TopicsTwo PointersString |
| 199. Binary Tree Right Side View | Medium | 36.2% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| H-Index | Medium | 36.2% | TopicsArraySortingCounting Sort |
| Assign Cookies | Easy | 36.2% | TopicsArrayTwo PointersGreedySortingQuicksort |
| Find Customer Referee | Easy | 36.2% | TopicsDatabase |
| Big Countries | Easy | 36.2% | TopicsDatabase |
| Design Search Autocomplete System | Hard | 36.2% | TopicsStringDepth-First SearchDesignTrieSortingHeap (Priority Queue)Data Stream |
| 680. Valid Palindrome II | Easy | 36.2% | TopicsTwo PointersStringGreedy |
| 904. Fruit Into Baskets | Medium | 36.2% | TopicsArrayHash TableSliding Window |
| 987. Vertical Order Traversal of a Binary Tree | Hard | 36.2% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchSortingBinary Tree |
| 1027. Longest Arithmetic Subsequence | Medium | 36.2% | TopicsArrayHash TableBinary SearchDynamic Programming |
| 1304. Find N Unique Integers Sum up to Zero | Easy | 36.2% | TopicsArrayMath |
| 1394. Find Lucky Integer in an Array | Easy | 36.2% | TopicsArrayHash TableCounting |
| 1523. Count Odd Numbers in an Interval Range | Easy | 36.2% | TopicsMath |
| Customer Who Visited but Did Not Make Any Transactions | Easy | 36.2% | TopicsDatabase |
| 1653. Minimum Deletions to Make String Balanced | Medium | 36.2% | TopicsStringDynamic ProgrammingStack |
| 2246. Longest Path With Different Adjacent Characters | Hard | 36.2% | TopicsArrayStringTreeDepth-First SearchGraph TheoryTopological Sort |
| 2333. Minimum Sum of Squared Difference | Medium | 36.2% | TopicsArrayBinary SearchGreedySortingHeap (Priority Queue) |
