Morgan-Stanley Logo

Morgan-Stanley Questions

Here are the LeetCode questions for Morgan-Stanley.

Total: 67
Easy: 18
Medium: 42
Hard: 7
Progress: 0%

Topic Frequency Analysis

All Topics

Rank Topic Frequency Percentage
1 Array 38
56.7%
2 Hash Table 20
29.9%
3 String 16
23.9%
4 Dynamic Programming 13
19.4%
5 Two Pointers 12
17.9%
6 Sorting 12
17.9%
7 Math 8
11.9%
8 Stack 7
10.4%
9 Greedy 7
10.4%
10 Linked List 6
9.0%
11 Counting 6
9.0%
12 Binary Search 5
7.5%
13 Design 4
6.0%
14 Matrix 4
6.0%
15 Prefix Sum 4
6.0%
16 Divide and Conquer 3
4.5%
17 Backtracking 3
4.5%
18 Recursion 3
4.5%
19 Database 3
4.5%
20 Heap (Priority Queue) 3
4.5%
21 Monotonic Stack 3
4.5%
22 Depth-First Search 1
1.5%
23 Breadth-First Search 1
1.5%
24 Memoization 1
1.5%
25 Queue 1
1.5%
26 Sliding Window 1
1.5%
27 Concurrency 1
1.5%
28 Simulation 1
1.5%
29 Doubly-Linked List 1
1.5%
30 Iterator 1
1.5%
31 Enumeration 1
1.5%
32 Number Theory 1
1.5%
33 Quickselect 1
1.5%
34 Ordered Set 1
1.5%
35 Counting Sort 1
1.5%
No. Question Title Link Difficulty Solved
1 Minimum Substring Partition of Equal Character Frequency Visit Medium
2 Make K-Subarray Sums Equal Visit Medium
3 Count Subarrays With Fixed Bounds Visit Hard
4 Find The Original Array of Prefix Xor Visit Medium
5 The Employee That Worked on the Longest Task Visit Easy
6 Restricted Restricted Hard
7 Restricted Restricted Hard
8 Restricted Restricted Hard
9 Restricted Restricted Hard
10 Restricted Restricted Hard
11 Restricted Restricted Hard
12 Restricted Restricted Hard
13 Restricted Restricted Hard
14 Restricted Restricted Hard
15 Restricted Restricted Hard

Log in to access all 67 questions for free!

Log In