Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Different Ways to Add Parentheses | Medium | 16.4% | TopicsMathStringDynamic ProgrammingRecursionMemoizationBracket Sequences |
| 684. Redundant Connection | Medium | 16.4% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| K-th Smallest in Lexicographical Order | Hard | 16.4% | TopicsTrie |
| Repeated Substring Pattern | Easy | 16.4% | TopicsStringString MatchingZ AlgorithmKnuth–Morris–Pratt Algorithm |
| 2390. Removing Stars From a String | Medium | 16.4% | TopicsStringStackSimulation |
| 1233. Remove Sub-Folders from the Filesystem | Medium | 16.4% | TopicsArrayStringDepth-First SearchTrie |
| 3243. Shortest Distance After Road Addition Queries I | Medium | 16.4% | TopicsArrayBreadth-First SearchGraph Theory |
| 2483. Minimum Penalty for a Shop | Medium | 16.4% | TopicsStringPrefix Sum |
| 2210. Count Hills and Valleys in an Array | Easy | 16.4% | TopicsArray |
| Word Pattern II | Medium | 16.4% | TopicsHash TableStringBacktracking |
| 1792. Maximum Average Pass Ratio | Medium | 16.4% | TopicsArrayGreedyHeap (Priority Queue) |
| 1373. Maximum Sum BST in Binary Tree | Hard | 16.4% | TopicsDynamic ProgrammingTreeDepth-First SearchBinary Search TreeBinary TreeDP on Trees |
| 1839. Longest Substring Of All Vowels in Order | Medium | 16.4% | TopicsStringSliding Window |
| Repeated String Match | Medium | 16.4% | TopicsStringString MatchingZ AlgorithmKnuth–Morris–Pratt AlgorithmBoyer–Moore String-Search Algorithm |
| 1657. Determine if Two Strings Are Close | Medium | 16.4% | TopicsHash TableStringSortingCounting |
| 2559. Count Vowel Strings in Ranges | Medium | 16.4% | TopicsArrayStringPrefix Sum |
| 3151. Special Array I | Easy | 16.4% | TopicsArray |
| Project Employees I | Easy | 16.4% | TopicsDatabase |
| 1020. Number of Enclaves | Medium | 16.4% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| Valid Number | Hard | 16.4% | TopicsString |
| 1749. Maximum Absolute Sum of Any Subarray | Medium | 16.4% | TopicsArrayDynamic Programming |
| 1028. Recover a Tree From Preorder Traversal | Hard | 16.4% | TopicsStringTreeDepth-First SearchBinary Tree |
| 1824. Minimum Sideway Jumps | Medium | 16.4% | TopicsArrayDynamic ProgrammingGreedy |
| 2594. Minimum Time to Repair Cars | Medium | 16.4% | TopicsArrayBinary Search |
| 1277. Count Square Submatrices with All Ones | Medium | 16.4% | TopicsArrayDynamic ProgrammingMatrix |
