## Morgan Stanley Interview | Set 8 (On-Campus)

Recently Morgan Stanley visited in our campus for FTA(Full time analyst) and intern programs. Written Test It was the technical + aptitude test that anyone… Read More »

## Stanley Interview | Set 7 (On-Campus)

Recently Morgan Stanley visited our campus for jobs and interns. I had applied for the position of an intern and there were two rounds for… Read More »

## Print level order traversal line by line | Set 1

Given a binary tree, print level order traversal in a way that nodes of all levels are printed in separate lines. For example consider the… Read More »

## Count ways to reach the n’th stair

There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs… Read More »

## Find next greater number with same set of digits

Given a number n, find the smallest number that has same set of digits as n and is greater than n. If x is the… Read More »

## Morgan Stanley Interview | Set 4

Written Test: 10 Aptitude 30 Programming 10 CS Fundamentals There’s negative marking, plus there’s sectional cutoff, so you have to be very careful, and risky… Read More »

## Morgan Stanley Interview | Set 3

Morgan Stanley interview experience 1st round: (90 minutes) It was multiple choice questions round. It consists of 3 sections: 1. This section had computer fundamental… Read More »

## Morgan Stanley Interview | Set 2

Written Test: 10 aptitude and data interpretation questions, questions based on language of ur choice(C/C++/Java), questions on basic Computer skills. I was able to do… Read More »

## Morgan Stanley Interview | Set 1

Morgan Stanley campus placement for post IT analyst. 1st round – objective written test 10 questions on aptitude and analytics 30 questions on programming 10… Read More »

## Find the minimum element in a sorted and rotated array

A sorted array is rotated at some unknown point, find the minimum element in it. Following solution assumes that all elements are distinct. Examples: Input:… Read More »

## Swap Kth node from beginning with Kth node from end in a Linked List

Given a singly linked list, swap kth node from beginning with kth node from end. Swapping of data is not allowed, only pointers should be… Read More »

## Write your own atoi()

The atoi() function takes a string (which represents an integer) as an argument and returns its value. Recommended: Please solve it on “PRACTICE” first, before… Read More »

## Huffman Coding | Greedy Algo-3

Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, lengths of the assigned codes are based… Read More »

## Find day of the week for a given date

Write a function that calculates the day of the week for any particular date in the past or future. A typical application is to calculate… Read More »

## Maximum Product Subarray

Given an array that contains both positive and negative integers, find the product of the maximum product subarray. Expected Time complexity is O(n) and only… Read More »