_flag_value":""},{"config_name":"updatePage","isVisible":true,"config_flag_value":""},{"config_name":"pinnacle_1yr_addon","isVisible":true,"config_flag_value":""},{"config_name":"updatePageProdDay","isVisible":true,"config_flag_value":""},{"config_name":"plan_upgrade_v2_logic","isVisible":true,"config_flag_value":""},{"config_name":"streak_leaderboard","isVisible":true,"config_flag_value":""},{"config_name":"hall_of_fame","isVisible":false,"config_flag_value":""},{"config_name":"focusMode","isVisible":true,"config_flag_value":""},{"config_name":"deleteAccount","isVisible":true,"config_flag_value":""},{"config_name":"new_checkout","isVisible":false,"config_flag_value":""},{"config_name":"downtime","isVisible":false,"config_flag_value":""},{"config_name":"streak_waala_love","isVisible":false,"config_flag_value":""},{"config_name":"new_feature_modal","isVisible":true,"config_flag_value":""},{"config_name":"promo_cards","isVisible":true,"config_flag_value":""},{"config_name":"reset_import","isVisible":true,"config_flag_value":""}],"children":"$2:props:children:1:props:children:0:props:fallback:props:children"}] 1b:T121a,

Company Name: Morgan Stanley

Job Role: Technology Analyst Intern (6-Month)

Years of Experience Required: 0

Drive: Off-Campus

CTC: 26LPA + 87k Stipend on internship.

Preparation

Topics: OS, DBMS, OOPS, DSA, SYSTEM DESIGN

Duration: 1 Month + (Good Competitive Coding Background)

Source of Preparation: Striver’s SDE Sheet (Check Striver’s SDE Sheet for Interview Preparation.), Leetcode, Youtube, Geeksforgeeks

[BONUS]:

Interview Rounds

Round 1: Online Coding Test

Problem List:

Problem Statement: Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

An input string is valid if:
-> Open brackets must be closed by the same type of brackets
-> Open brackets must be closed in the correct order.
Problem Statement: You have an array, you can pick two numbers at a time and sum them into one, the cost of this operation is the sum of the numbers. Find minimum cost to reduce the array to size 1
Problem Statement: You are given N, 2 dimensional points on the coordinate axis, find the maximum number of points that would lie on a line.