Morgan-Stanley Logo

Morgan-Stanley Questions

Here are the LeetCode questions for Morgan-Stanley.

Total: 61
Easy: 16
Medium: 38
Hard: 7
Progress: 0%

Topic Frequency Analysis

All Topics

Rank Topic Frequency Percentage
1 Array 33
54.1%
2 Hash Table 17
27.9%
3 String 15
24.6%
4 Two Pointers 12
19.7%
5 Dynamic Programming 10
16.4%
6 Sorting 10
16.4%
7 Math 8
13.1%
8 Stack 7
11.5%
9 Greedy 7
11.5%
10 Linked List 6
9.8%
11 Counting 5
8.2%
12 Matrix 4
6.6%
13 Prefix Sum 4
6.6%
14 Backtracking 3
4.9%
15 Design 3
4.9%
16 Recursion 3
4.9%
17 Database 3
4.9%
18 Heap (Priority Queue) 3
4.9%
19 Monotonic Stack 3
4.9%
20 Binary Search 2
3.3%
21 Divide and Conquer 2
3.3%
22 Depth-First Search 1
1.6%
23 Memoization 1
1.6%
24 Queue 1
1.6%
25 Sliding Window 1
1.6%
26 Concurrency 1
1.6%
27 Simulation 1
1.6%
28 Doubly-Linked List 1
1.6%
29 Iterator 1
1.6%
30 Enumeration 1
1.6%
31 Number Theory 1
1.6%
32 Quickselect 1
1.6%
33 Counting Sort 1
1.6%
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 61 questions for free!

Log In