Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1318. Minimum Flips to Make a OR b Equal to c | Medium | 33.2% | TopicsBit Manipulation |
| 1339. Maximum Product of Splitted Binary Tree | Medium | 33.2% | TopicsTreeDepth-First SearchBinary Tree |
| 1482. Minimum Number of Days to Make m Bouquets | Medium | 33.2% | TopicsArrayBinary Search |
| 1578. Minimum Time to Make Rope Colorful | Medium | 33.2% | TopicsArrayStringDynamic ProgrammingGreedy |
| 1615. Maximal Network Rank | Medium | 33.2% | TopicsGraph Theory |
| Find if Path Exists in Graph | Easy | 33.2% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| Create a DataFrame from List | Easy | 33.2% | Topics— |
| 2996. Smallest Missing Integer Greater Than Sequential Prefix Sum | Easy | 33.2% | TopicsArrayHash TableSorting |
| 662. Maximum Width of Binary Tree | Medium | 33.2% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 1922. Count Good Numbers | Medium | 33.2% | TopicsMathRecursion |
| Find All Numbers Disappeared in an Array | Easy | 33.2% | TopicsArrayHash Table |
| 3377. Digit Operations to Make Two Integers Equal | Medium | 33.2% | TopicsMathGraph TheoryHeap (Priority Queue)Number TheoryShortest Path |
| 844. Backspace String Compare | Easy | 33.2% | TopicsTwo PointersStringStackSimulation |
| 3136. Valid Word | Easy | 33.2% | TopicsString |
| 1200. Minimum Absolute Difference | Easy | 33.2% | TopicsArraySorting |
| Triangle | Medium | 31.5% | TopicsArrayDynamic Programming |
| Dungeon Game | Hard | 31.5% | TopicsArrayDynamic ProgrammingMatrix |
| Rank Scores | Medium | 31.5% | TopicsDatabase |
| Range Sum Query - Immutable | Easy | 31.5% | TopicsArrayDesignPrefix Sum |
| 338. Counting Bits | Easy | 31.5% | TopicsDynamic ProgrammingBit Manipulation |
| 441. Arranging Coins | Easy | 31.5% | TopicsMathBinary Search |
| Find All Duplicates in an Array | Medium | 31.5% | TopicsArrayHash TableSorting |
| 4 Keys Keyboard | Medium | 31.5% | TopicsMathDynamic Programming |
| 706. Design HashMap | Easy | 31.5% | TopicsArrayHash TableLinked ListDesignHash Function |
| 1013. Partition Array Into Three Parts With Equal Sum | Easy | 31.5% | TopicsArrayGreedy |
