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
4ArrayDynamic ProgrammingSorting
6MediumMinimum Number of Lines to Cover Points
ArrayHash TableMathDynamic Programming+4
8ArrayBinary SearchBinary Indexed Tree
9ArrayQueueSliding WindowMonotonic Queue
12Hash TableStringSliding Window
14ArrayDivide and ConquerSortingHeap (Priority Queue)+1
16ArrayHash TableStringSorting
18ArrayHash TablePrefix Sum
19ArrayDynamic ProgrammingGreedyHeap (Priority Queue)
20Hash TableLinked ListDesignDoubly-Linked List
23ArrayDivide and ConquerDynamic Programming
26StringDynamic ProgrammingBacktracking
30Linked ListTwo PointersStackRecursion
32Hash TableStringBacktracking
33ArrayStringBacktrackingDepth-First Search+1
34ArrayHash TableBinary SearchSliding Window+1
35ArrayDepth-First SearchBreadth-First SearchUnion Find+1
36ArrayHash TableSliding WindowCounting
37ArrayDynamic ProgrammingGreedy
38ArrayLinked ListStackMonotonic Stack
39MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2
40ArrayBinary SearchDivide and ConquerBinary Indexed Tree+3
43ArrayHash TableStackMonotonic Stack
44MathStringDynamic Programming
45StringDynamic Programming
46ArrayHash TablePrefix Sum
48TreeDepth-First SearchString MatchingBinary Tree+1
51Two PointersStringDynamic Programming