Skip to content

Tag Archives: Morgan Stanley

I got a call from HR (some 3rd party HR that works for Morgan Stanley) for a Job application. I shared an updated resume over… Read More
I got the mail regarding the shortlisting of my resume on 20th Feb 2022 and the online test was scheduled for 23rd Feb 2022. Round… Read More
Morgan Stanley was one of the first organizations that arrived in our college for on-campus placement. Around 388 students from my university were shortlisted to… Read More
Coding Round: https://www.geeksforgeeks.org/lexicographically-smallest-string-formed-by-removing-duplicates/ https://www.geeksforgeeks.org/count-minimum-number-of-fountains-to-be-activated-to-cover-the-entire-garden/ Round 1:  Find occurrences of a given element in a long sorted array Find the max element in an unsorted array.… Read More
Morgan Stanley visited my college for a 2-month internship for 3rd-year students. The criteria for applying was: No live backlogs Streams – CSE / ETRX… Read More
Hi Guys, Hope you are all doing good.Today, I want to share my experience and the process for getting into Morgan Stanley. I got an… Read More
Efficient approach: If we are allowed to buy and sell only once, then we can use following algorithm. Maximum difference between two elements. Here we… Read More
Given a square matrix, turn it by 90 degrees in anti-clockwise direction without using any extra space.Examples :   Input: Matrix: 1 2 3 4 5… Read More
Given an array A[] consisting 0s, 1s and 2s. The task is to write a function that sorts the given array. The functions should put… Read More
Given an array A[] consisting 0s, 1s and 2s. The task is to write a function that sorts the given array. The functions should put… Read More
Given an array A[] consisting 0s, 1s and 2s. The task is to write a function that sorts the given array. The functions should put… Read More
Given an array A[] consisting 0s, 1s and 2s. The task is to write a function that sorts the given array. The functions should put… Read More

Start Your Coding Journey Now!