JPMorgan Chase & Co. Associate/Senior Associate -(Nontechnical) Interview Questions and Answers

Interview preparation tips for other job seekers - Please be prepared for journal entries on options and future

Interview preparation tips for other job seekers - Be prepared with basic concepts, basics is ehat they look for

Interview preparation tips for other job seekers - The straight forward answer got me a good hike.

Answer was
Frankly speaking getting a job in this pandemic would be enough fore but i think as per the name and big company like you should maintain the reputation and give a decent hike despite of a pandemic.

Topics to prepare for HSBC Group Business Analyst interview:

• Technical

Interview preparation tips for other job seekers - Prepare well for technical round

Interview preparation tips for other job seekers - Provide crisp and brief summary of the work profile and do highlight any achievements and projects handled.

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaGood Resume and 7 CGPA +Morgan Stanley interview preparation:Topics to prepare for the interview - I have done a rigourous training on Data Structure and Algorithms. It really helped me a lot to excel in life. Also I did vocational courses which enhanced my personality. I did analytical mindset training with problem solving methodologies. The hands on training on Python and Unix helped me a lot.Time required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Stay consistent with your efforts
Tip 2 : Work hard with honesty
Tip 3 : Try to set goal of +1 level from the goal you want to achieve

Application resume tips for other job seekers

Tip 1 : Present yourself with honesty
Tip 2 : Mention about the Workshops, hackathons, achievements, and the projects.

Final outcome of the interviewSelected

Round: Resume Shortlist
Experience: My resume had gotten shortlisted for the profile of an Analyst. This was the first stage.

Round: Group Discussion
Duration: 20 minutes

College Name: Lady Shri Ram College

Round: Technical Interview
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5

- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.


College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]