Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2259. Remove Digit From Number to Maximize Result | Easy | 29.7% | TopicsStringGreedyEnumeration |
| 2384. Largest Palindromic Number | Medium | 29.7% | TopicsHash TableStringGreedyCounting |
| 2405. Optimal Partition of String | Medium | 29.7% | TopicsHash TableStringGreedy |
| 2477. Minimum Fuel Cost to Report to the Capital | Medium | 29.7% | TopicsTreeDepth-First SearchBreadth-First SearchGraph Theory |
| 3040. Maximum Number of Operations With the Same Score II | Medium | 29.7% | TopicsArrayDynamic ProgrammingMemoization |
| Maximal Square | Medium | 29.7% | TopicsArrayDynamic ProgrammingMatrix |
| Sliding Window Median | Hard | 29.7% | TopicsArrayHash TableSliding WindowHeap (Priority Queue)Treap |
| 1283. Find the Smallest Divisor Given a Threshold | Medium | 29.7% | TopicsArrayBinary Search |
| 2161. Partition Array According to Given Pivot | Medium | 29.7% | TopicsArrayTwo PointersSimulation |
| Delete Duplicate Emails | Easy | 29.7% | TopicsDatabase |
| 2861. Maximum Number of Alloys | Medium | 29.7% | TopicsArrayBinary Search |
| 1413. Minimum Value to Get Positive Step by Step Sum | Easy | 29.7% | TopicsArrayPrefix Sum |
| 2472. Maximum Number of Non-overlapping Palindrome Substrings | Hard | 29.7% | TopicsTwo PointersStringDynamic ProgrammingGreedy |
| 3229. Minimum Operations to Make Array Equal to Target | Hard | 29.7% | TopicsArrayDynamic ProgrammingStackGreedyMonotonic Stack |
| 3772. Maximum Subgraph Score in a Tree | Hard | 29.7% | TopicsArrayDynamic ProgrammingTreeDepth-First Search |
| 3878. Count Good Subarrays | Hard | 29.7% | TopicsArrayStackBit ManipulationMonotonic Stack |
| Search in Rotated Sorted Array II | Medium | 27.7% | TopicsArrayBinary Search |
| Word Break II | Hard | 27.7% | TopicsArrayHash TableStringDynamic ProgrammingBacktrackingTrieMemoization |
| Department Top Three Salaries | Hard | 27.7% | TopicsDatabase |
| Meeting Rooms | Easy | 27.7% | TopicsArraySortingQuicksort |
| Closest Binary Search Tree Value | Easy | 27.7% | TopicsBinary SearchTreeDepth-First SearchBinary Search TreeBinary Tree |
| 278. First Bad Version | Easy | 27.7% | TopicsBinary SearchInteractive |
| Inorder Successor in BST | Medium | 27.7% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| Count of Smaller Numbers After Self | Hard | 27.7% | TopicsArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered SetTreap |
| 329. Longest Increasing Path in a Matrix | Hard | 27.7% | TopicsArrayDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryTopological SortMemoizationMatrixDirected Acyclic Graph |
