Interview Prep/Companies/Morgan Stanley
MS

Morgan Stanley

51 questions tracked49 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 51 of 51 questions

1
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
100
ArrayDynamic Programming
2
EasyMinimum Cost to Move Chips to The Same Positionβœ“ Our Solution
90
ArrayMathGreedy
3
MediumFind The Original Array of Prefix Xorβœ“ Our Solution
90
ArrayBit Manipulation
4
MediumBest Team With No Conflictsβœ“ Our Solution
90
ArrayDynamic ProgrammingSorting
5
EasyFind Subarrays With Equal Sumβœ“ Our Solution
88
ArrayHash Table
6
MediumMinimum Number of Lines to Cover Points
88
ArrayHash TableMathDynamic Programming+4
7
EasyThe Employee That Worked on the Longest Taskβœ“ Our Solution
88
Array
8
HardFind the Longest Valid Obstacle Course at Each Positionβœ“ Our Solution
88
ArrayBinary SearchBinary Indexed Tree
9
HardCount Subarrays With Fixed Boundsβœ“ Our Solution
76
ArrayQueueSliding WindowMonotonic Queue
10
71
ArrayHash Table
11
MediumMerge Intervalsβœ“ Our Solution
71
ArraySorting
12
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
66
Hash TableStringSliding Window
13
HardFirst Missing Positiveβœ“ Our Solution
66
ArrayHash Table
14
MediumKth Largest Element in an Arrayβœ“ Our Solution
59
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
15
59
ArrayTwo PointersSorting
16
MediumGroup Anagramsβœ“ Our Solution
59
ArrayHash TableStringSorting
17
MediumMake K-Subarray Sums Equalβœ“ Our Solution
59
ArrayMathGreedySorting+1
18
MediumContiguous Arrayβœ“ Our Solution
59
ArrayHash TablePrefix Sum
19
HardMinimum Number of Refueling Stopsβœ“ Our Solution
59
ArrayDynamic ProgrammingGreedyHeap (Priority Queue)
20
MediumLRU Cacheβœ“ Our Solution
59
Hash TableLinked ListDesignDoubly-Linked List
21
MediumCopy List with Random Pointerβœ“ Our Solution
59
Hash TableLinked List
22
EasyReverse Stringβœ“ Our Solution
50
Two PointersString
23
MediumMaximum Subarrayβœ“ Our Solution
50
ArrayDivide and ConquerDynamic Programming
24
EasyRemove Duplicates from Sorted Arrayβœ“ Our Solution
50
ArrayTwo Pointers
25
HardStamping The Sequenceβœ“ Our Solution
50
StringStackGreedyQueue
26
MediumGenerate Parenthesesβœ“ Our Solution
50
StringDynamic ProgrammingBacktracking
27
EasyKth Missing Positive Numberβœ“ Our Solution
50
ArrayBinary Search
28
MediumCoin Change IIβœ“ Our Solution
50
ArrayDynamic Programming
29
MediumMin Stackβœ“ Our Solution
50
StackDesign
30
EasyPalindrome Linked Listβœ“ Our Solution
50
Linked ListTwo PointersStackRecursion
31
EasyValid Parenthesesβœ“ Our Solution
50
StringStack
32
MediumLetter Combinations of a Phone Numberβœ“ Our Solution
50
Hash TableStringBacktracking
33
MediumWord Searchβœ“ Our Solution
50
ArrayStringBacktrackingDepth-First Search+1
34
MediumMinimum Operations to Reduce X to Zeroβœ“ Our Solution
50
ArrayHash TableBinary SearchSliding Window+1
35
MediumNumber of Islandsβœ“ Our Solution
50
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
36
HardSubarrays with K Different Integersβœ“ Our Solution
50
ArrayHash TableSliding WindowCounting
37
MediumJump Gameβœ“ Our Solution
50
ArrayDynamic ProgrammingGreedy
38
MediumSteps to Make Array Non-decreasingβœ“ Our Solution
50
ArrayLinked ListStackMonotonic Stack
39
MediumMeeting Rooms II
50
ArrayTwo PointersGreedySorting+2
40
HardCount of Range Sumβœ“ Our Solution
50
ArrayBinary SearchDivide and ConquerBinary Indexed Tree+3
41
MediumRotate Listβœ“ Our Solution
50
Linked ListTwo Pointers
42
MediumSort Colorsβœ“ Our Solution
50
ArrayTwo PointersSorting
43
EasyNext Greater Element Iβœ“ Our Solution
50
ArrayHash TableStackMonotonic Stack
44
HardCount of Integersβœ“ Our Solution
50
MathStringDynamic Programming
45
MediumDecode Waysβœ“ Our Solution
50
StringDynamic Programming
46
MediumSubarray Sum Equals Kβœ“ Our Solution
50
ArrayHash TablePrefix Sum
47
EasyCount Binary Substringsβœ“ Our Solution
50
Two PointersString
48
EasySubtree of Another Treeβœ“ Our Solution
50
TreeDepth-First SearchString MatchingBinary Tree+1
49
MediumReverse Words in a Stringβœ“ Our Solution
50
Two PointersString
50
MediumHouse Robberβœ“ Our Solution
50
ArrayDynamic Programming
51
MediumLongest Palindromic Substringβœ“ Our Solution
50
Two PointersStringDynamic Programming