Morgan Stanley
60 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 19. Remove Nth Node From End of List | Medium | 64.3% | TopicsLinked ListTwo Pointers |
| 55. Jump Game | Medium | 53.9% | TopicsArrayDynamic ProgrammingGreedy |
| 525. Contiguous Array | Medium | 53.9% | TopicsArrayHash TablePrefix Sum |
| Remove Duplicates from Sorted Array | Easy | 53.9% | TopicsArrayTwo Pointers |
| 22. Generate Parentheses | Medium | 53.9% | TopicsStringDynamic ProgrammingBacktrackingBracket Sequences |
| 2607. Make K-Subarray Sums Equal | Medium | 53.9% | TopicsArrayMathGreedySortingNumber Theory |
| 79. Word Search | Medium | 53.9% | TopicsArrayStringBacktrackingDepth-First SearchMatrix |
| 1658. Minimum Operations to Reduce X to Zero | Medium | 53.9% | TopicsArrayHash TableBinary SearchSliding WindowPrefix Sum |
| 1209. Remove All Adjacent Duplicates in String II | Medium | 53.9% | TopicsStringStack |
| 1143. Longest Common Subsequence | Medium | 53.9% | TopicsStringDynamic ProgrammingLongest Common Subsequence |
| Next Greater Element III | Medium | 53.9% | TopicsMathTwo PointersString |
| 3144. Minimum Substring Partition of Equal Character Frequency | Medium | 53.9% | TopicsHash TableStringDynamic ProgrammingCounting |
| 1529. Minimum Suffix Flips | Medium | 53.9% | TopicsStringGreedy |
| Next Greater Element II | Medium | 53.9% | TopicsArrayStackMonotonic Stack |
| 1326. Minimum Number of Taps to Open to Water a Garden | Hard | 53.9% | TopicsArrayDynamic ProgrammingGreedy |
| 1481. Least Number of Unique Integers after K Removals | Medium | 53.9% | TopicsArrayHash TableGreedySortingCounting |
| Candy | Hard | 53.9% | TopicsArrayGreedy |
| 5. Longest Palindromic Substring | Medium | 53.9% | TopicsTwo PointersStringDynamic ProgrammingManacher |
| 143. Reorder List | Medium | 53.9% | TopicsLinked ListTwo PointersStackRecursion |
| 234. Palindrome Linked List | Easy | 53.9% | TopicsLinked ListTwo PointersStackRecursion |
| 300. Longest Increasing Subsequence | Medium | 53.9% | TopicsArrayBinary SearchDynamic ProgrammingLongest Increasing Subsequence |
| 169. Majority Element | Easy | 53.9% | TopicsArrayHash TableDivide and ConquerSortingCountingBoyer–Moore Majority Vote Algorithm |
| 907. Sum of Subarray Minimums | Medium | 53.9% | TopicsArrayDynamic ProgrammingStackMonotonic Stack |
| 322. Coin Change | Medium | 53.9% | TopicsArrayDynamic ProgrammingBreadth-First SearchKnapsack ProblemComplete Knapsack |
| 1470. Shuffle the Array | Easy | 53.9% | TopicsArray |
