Microsoft
1371 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2652. Sum Multiples | Easy | 7.5% | TopicsMath |
| Employees Whose Manager Left the Company | Easy | 7.5% | TopicsDatabase |
| 2812. Find the Safest Path in a Grid | Medium | 7.5% | TopicsArrayBinary SearchBreadth-First SearchUnion-FindHeap (Priority Queue)Matrix |
| 1312. Minimum Insertion Steps to Make a String Palindrome | Hard | 7.5% | TopicsStringDynamic Programming |
| 2063. Vowels of All Substrings | Medium | 7.5% | TopicsMathStringDynamic ProgrammingCombinatorics |
| 3969. Valid Subarrays With Matching Sum Digits I | Medium | 7.5% | TopicsArrayHash TableSliding WindowEnumerationPrefix Sum |
| Sleep | Easy | 7.5% | Topics— |
| 2760. Longest Even Odd Subarray With Threshold | Easy | 7.5% | TopicsArraySliding Window |
| Number of Atoms | Hard | 7.5% | TopicsHash TableStringStackSorting |
| 1697. Checking Existence of Edge Length Limited Paths | Hard | 7.5% | TopicsArrayTwo PointersUnion-FindGraph TheorySorting |
| 3532. Path Existence Queries in a Graph I | Medium | 7.5% | TopicsArrayHash TableBinary SearchUnion-FindGraph Theory |
| Fill Missing Data | Easy | 7.5% | Topics— |
| 2016. Maximum Difference Between Increasing Elements | Easy | 7.5% | TopicsArray |
| 978. Longest Turbulent Subarray | Medium | 7.5% | TopicsArrayDynamic ProgrammingSliding Window |
| 2791. Count Paths That Can Form a Palindrome in a Tree | Hard | 7.5% | TopicsHash TableBit ManipulationTreeDepth-First Search |
| 1311. Get Watched Videos by Your Friends | Medium | 7.5% | TopicsArrayHash TableBreadth-First SearchGraph TheorySorting |
| 1289. Minimum Falling Path Sum II | Hard | 7.5% | TopicsArrayDynamic ProgrammingMatrix |
| Arithmetic Slices II - Subsequence | Hard | 7.5% | TopicsArrayDynamic Programming |
| 2460. Apply Operations to an Array | Easy | 7.5% | TopicsArrayTwo PointersSimulation |
| 2670. Find the Distinct Difference Array | Easy | 7.5% | TopicsArrayHash Table |
| 1282. Group the People Given the Group Size They Belong To | Medium | 7.5% | TopicsArrayHash TableGreedy |
| Brightest Position on Street | Medium | 7.5% | TopicsArraySortingPrefix SumOrdered Set |
| 3499. Maximize Active Section with Trade I | Medium | 7.5% | TopicsStringEnumeration |
| 3513. Number of Unique XOR Triplets I | Medium | 7.5% | TopicsArrayMathBit Manipulation |
| 1081. Smallest Subsequence of Distinct Characters | Medium | 7.5% | TopicsStringStackGreedyMonotonic Stack |
