Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 12.3% | TopicsArrayDynamic ProgrammingSliding WindowPrefix Sum |
| 1401. Circle and Rectangle Overlapping | Medium | 12.3% | TopicsMathGeometry |
| 2270. Number of Ways to Split Array | Medium | 12.3% | TopicsArrayPrefix Sum |
| 2185. Counting Words With a Given Prefix | Easy | 12.3% | TopicsArrayStringString Matching |
| 1400. Construct K Palindrome Strings | Medium | 12.3% | TopicsHash TableStringGreedyCounting |
| 1169. Invalid Transactions | Medium | 12.3% | TopicsArrayHash TableStringSorting |
| 3420. Count Non-Decreasing Subarrays After K Operations | Hard | 12.3% | TopicsArrayStackSegment TreeQueueSliding WindowMonotonic StackMonotonic Queue |
| 2429. Minimize XOR | Medium | 12.3% | TopicsGreedyBit Manipulation |
| Swap Sex of Employees | Easy | 12.3% | TopicsDatabase |
| 1267. Count Servers that Communicate | Medium | 12.3% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrixCounting |
| 2658. Maximum Number of Fish in a Grid | Medium | 12.3% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 2493. Divide Nodes Into the Maximum Number of Groups | Hard | 12.3% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 3105. Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | 12.3% | TopicsArray |
| 851. Loud and Rich | Medium | 12.3% | TopicsArrayDepth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| Delete Operation for Two Strings | Medium | 12.3% | TopicsStringDynamic ProgrammingLongest Common Subsequence |
| 1352. Product of the Last K Numbers | Medium | 12.3% | TopicsArrayMathDesignData StreamPrefix Sum |
| 946. Validate Stack Sequences | Medium | 12.3% | TopicsArrayStackSimulation |
| 873. Length of Longest Fibonacci Subsequence | Medium | 12.3% | TopicsArrayHash TableDynamic Programming |
| 3208. Alternating Groups II | Medium | 12.3% | TopicsArraySliding Window |
| 2529. Maximum Count of Positive Integer and Negative Integer | Easy | 12.3% | TopicsArrayBinary SearchCounting |
| 3108. Minimum Cost Walk in Weighted Graph | Hard | 12.3% | TopicsArrayBit ManipulationUnion-FindGraph Theory |
| 2685. Count the Number of Complete Components | Medium | 12.3% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 2033. Minimum Operations to Make a Uni-Value Grid | Medium | 12.3% | TopicsArrayMathSortingMatrix |
| 3217. Delete Nodes From Linked List Present in Array | Medium | 12.3% | TopicsArrayHash TableLinked List |
| 2843. Count Symmetric Integers | Easy | 12.3% | TopicsMathEnumeration |
