Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1192. Critical Connections in a Network | Hard | 27.7% | TopicsDepth-First SearchGraph TheoryBiconnected ComponentBridge (Graph) |
| Design Skiplist | Hard | 27.7% | TopicsLinked ListDesign |
| 2321. Maximum Score Of Spliced Array | Hard | 27.7% | TopicsArrayDynamic Programming |
| 2216. Minimum Deletions to Make Array Beautiful | Medium | 27.7% | TopicsArrayStackGreedy |
| 2193. Minimum Number of Moves to Make Palindrome | Hard | 27.7% | TopicsTwo PointersStringGreedyBinary Indexed Tree |
| 2309. Greatest English Letter in Upper and Lower Case | Easy | 27.7% | TopicsHash TableStringEnumeration |
| 1371. Find the Longest Substring Containing Vowels in Even Counts | Medium | 27.7% | TopicsHash TableStringBit ManipulationPrefix Sum |
| Get the Second Most Recent Activity | Hard | 27.7% | TopicsDatabase |
| 1417. Reformat The String | Easy | 27.7% | TopicsString |
| 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 27.7% | TopicsArrayQueueSliding WindowHeap (Priority Queue)Ordered SetMonotonic Queue |
| 1458. Max Dot Product of Two Subsequences | Hard | 27.7% | TopicsArrayDynamic ProgrammingLongest Common Subsequence |
| Find All The Lonely Nodes | Easy | 27.7% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 1510. Stone Game IV | Hard | 27.7% | TopicsMathDynamic ProgrammingMinimaxGame TheoryNim GameSprague–Grundy TheoremZero-Sum Game |
| Delete N Nodes After M Nodes of a Linked List | Easy | 27.7% | TopicsLinked List |
| 1573. Number of Ways to Split a String | Medium | 27.7% | TopicsMathString |
| 1576. Replace All ?'s to Avoid Consecutive Repeating Characters | Easy | 27.7% | TopicsString |
| 1638. Count Substrings That Differ by One Character | Medium | 27.7% | TopicsHash TableStringDynamic ProgrammingEnumeration |
| 1671. Minimum Number of Removals to Make Mountain Array | Hard | 27.7% | TopicsArrayBinary SearchDynamic ProgrammingGreedy |
| Lowest Common Ancestor of a Binary Tree II | Medium | 27.7% | TopicsTreeDepth-First SearchBinary TreeBinary LiftingLowest Common Ancestor |
| 1681. Minimum Incompatibility | Hard | 27.7% | TopicsArrayHash TableDynamic ProgrammingBit ManipulationBitmask |
| 1808. Maximize Number of Nice Divisors | Hard | 27.7% | TopicsMathRecursionNumber Theory |
| Primary Department for Each Employee | Easy | 27.7% | TopicsDatabase |
| 1822. Sign of the Product of an Array | Easy | 27.7% | TopicsArrayMath |
| 1904. The Number of Full Rounds You Have Played | Medium | 27.7% | TopicsMathString |
| 1945. Sum of Digits of String After Convert | Easy | 27.7% | TopicsStringSimulation |
