Candidatei-me online. Fui entrevistado pela J.P. Morgan (Bombaim) em mar. de 2022
Entrevista
The Interview process took around 3-4 weeks,
1st Round was only General Discussion on the Position/Role with the VP of Software engineering in India
After Round I : Given a home Assignment on Super Simple Stock Market (you can get it on github easily)
to submit in 3-4 days
2nd Round was a technical for 2 hours , but the HR did not told what will be there in that around not even the agenda even after I emailed to get the same info.
The 2nd Round was scheduled for friday 5:30 Pm (IST) and then at last moment I was ready for the interview , when i joined the link of meet nobody was available for taking the interview , then i called the HR who scheduled the meet , she told 1 interviewee is not available so it will be postponed.
Really very unprofessional behavior from such a big company.
Then she told that will rearrange it for next friday.
Very strict about the timing for each question /session.
You have to answer within the time or else they move to another section
So the Interview Round II was distributed in 10-20 minutes sessions
i: 5 minutes: Introduction
ii: 15 -20 min: walk through for Home assignment which they gave to work on after Clearing Round I . (Super Simple Stock Market )
iii: 10 min: for coding- write a code in any language or pseudocode is also fine. (added in questions below)
iv: 10-15min: code review : They have given some code and asked to review it and point the mistake in it and correct it. (code was in Python)
v: 10 -15 min : Write/Draw and Explain the use case in OOPS concept model. (Question given in below /Question section)
vi : 10 min: Question releated to BA we have to answer it if we were a Business analyst.
1. your manager email you and ask you to do
1: Write a code for GUi in Java Swing to display the Stock profit for the most popular and valuable stock(something similar question)
2: Dont remember the exactly but similar to above one.
And we have to explain what are the questions we will ask to manager before starting the development.
Perguntas de entrevista [3]
Pergunta 1
1. 10 min Coding :
Write a code for Capitalize ( Refer the in put and output )
sample
input : getCodeType
output: Code_Type
i/p : getCodeStyle
o/p: Code_Style
i/p: getSWIFTCode
o/p: SWIFT_Code
10 -15 min : Write/Draw and Explain the use case in OOPS concept model.
These are the sentences
1. Cat
2. Tiger
3. My Cat name is Lucy
4. breed of Cat
5. Weight
6. Height
7. French Cat has a Long Tail
8. A breed with no Tail in Cat
9. Meow or Roar
10 . German Breed Cat
So we have to think in terms of OOPs (Object oriented terms and answer them accordingly)
Like Cat Can be a Class and Tail can be a Properties of Class.
Code review a Simple code in Python:
Class getSwag:
def __init__(tihs):
pass
Class getNewSwag(object):
def __init__(this):
this.a=0
try:
//code
......so on
So we have to find the issue by doing the code review.
Candidatei-me online. O processo levou 2 semanas. Fiz uma entrevista na empresa J.P. Morgan.
Entrevista
Had to use my own IDE to solve two Leetcode questions. Then I was asked to do a interview For 2 hours which was another Leetcode interview followed by a behavioral then a final system design questions part. My final interview was with the other managers at the location.
Perguntas de entrevista [3]
Pergunta 1
Find a series of numbers from where two lists don’t overlap
Candidatei-me por meio de uma agência de recrutamento. O processo levou 1 semana. Fui entrevistado pela J.P. Morgan (Herzliya) em out. de 2021
Entrevista
3 technical interviews + 1 hr.
passed first interview then they canceled the other interviews and invited me to another interview which didn't go well.
interviews are 1 hr which is not enough for getting to know each other + technical questions
Perguntas de entrevista [1]
Pergunta 1
a local max in an array is an element that is larger than both of his neighbors (end points are special case)
example array=[11,2,4,7,34,22,50]
11 is a local max because 11>2
50 is a local max because 50>11
34 is a local max because 34>7 and 34>22
find an algorithm that returns any local max in an unique array in o(logn) time complexity
