Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 435. Non-overlapping Intervals | Medium | 29.7% | TopicsArrayDynamic ProgrammingGreedySorting |
| 437. Path Sum III | Medium | 29.7% | TopicsTreeDepth-First SearchBinary Tree |
| IPO | Hard | 29.7% | TopicsArrayGreedySortingHeap (Priority Queue) |
| Find Bottom Left Tree Value | Medium | 29.7% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Boundary of Binary Tree | Medium | 29.7% | TopicsTreeDepth-First SearchBinary Tree |
| Bulb Switcher II | Medium | 29.7% | TopicsMathBit ManipulationDepth-First SearchBreadth-First Search |
| 724. Find Pivot Index | Easy | 29.7% | TopicsArrayPrefix Sum |
| 767. Reorganize String | Medium | 29.7% | TopicsHash TableStringGreedySortingHeap (Priority Queue)Counting |
| 787. Cheapest Flights Within K Stops | Medium | 29.7% | TopicsDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)Shortest Path |
| Random Pick with Weight | Medium | 29.7% | TopicsArrayMathBinary SearchPrefix SumRandomized |
| 918. Maximum Sum Circular Subarray | Medium | 29.7% | TopicsArrayDivide and ConquerDynamic ProgrammingQueueMonotonic Queue |
| 930. Binary Subarrays With Sum | Medium | 29.7% | TopicsArrayHash TableSliding WindowPrefix Sum |
| 1006. Clumsy Factorial | Medium | 29.7% | TopicsMathStackSimulation |
| Product Sales Analysis I | Easy | 29.7% | TopicsDatabase |
| Students and Examinations | Easy | 29.7% | TopicsDatabase |
| Find the Start and End Number of Continuous Ranges | Medium | 29.7% | TopicsDatabase |
| 1344. Angle Between Hands of a Clock | Medium | 29.7% | TopicsMath |
| 1375. Number of Times Binary String Is Prefix-Aligned | Medium | 29.7% | TopicsArray |
| 1415. The k-th Lexicographical String of All Happy Strings of Length n | Medium | 29.7% | TopicsStringBacktracking |
| 1547. Minimum Cost to Cut a Stick | Hard | 29.7% | TopicsArrayDynamic ProgrammingSorting |
| 1637. Widest Vertical Area Between Two Points Containing No Points | Easy | 29.7% | TopicsArraySorting |
| Lowest Common Ancestor of a Binary Tree III | Medium | 29.7% | TopicsHash TableTwo PointersTreeBinary TreeBinary LiftingLowest Common Ancestor |
| 1703. Minimum Adjacent Swaps for K Consecutive Ones | Hard | 29.7% | TopicsArrayGreedySliding WindowPrefix Sum |
| Remove Duplicates From an Unsorted Linked List | Medium | 29.7% | TopicsHash TableLinked List |
| 2127. Maximum Employees to Be Invited to a Meeting | Hard | 29.7% | TopicsArrayDynamic ProgrammingDepth-First SearchGraph TheoryTopological SortKosaraju's AlgorithmTarjan's SCC Algorithm |
