Morgan-Stanley Topics for Interview Preparation Easy Level Medium Level Hard Level Easy LevelBubble SortCount numbers from 1 to n that have 4 as a a digitHeap SortLargest even number possible by using one swap operation in given numberMinimum number of distinct elements after removing m itemsQuickSortRemove duplicates from sorted arraySwap Kth node from beginning with Kth node from end in a Linked ListWrite your own atoi()Count ways to reach the n'th stairDynamic Programming | Set 10 ( 0-1 Knapsack Problem)Dynamic Programming | Set 14 (Maximum Sum Increasing Subsequence)Find day of the week for a given dateFind the minimum element in a sorted and rotated arrayFind minimum number of coins that make a given valueFind next greater number with same set of digitsGreedy Algorithms | Set 1 (Activity Selection Problem)Largest subarray with equal number of 0s and 1sMaximum Product SubarrayPrint a given matrix in spiral formReverse words in a given stringSort a linked list of 0s, 1s and 2sSort an array of 0s, 1s and 2sWrite a function to reverse a linked listMedium LevelCheck if a number is BleakDynamic Programming | Set 7 (Coin Change)Greedy Algorithms | Set 3 (Huffman Coding)Largest Sum Contiguous SubarrayHard LevelMedian in a stream of integers (running integers) Company Wise Coding Practice Topic Wise Coding Practice Load Comments Please Login to comment...