JP Morgan Interview Questions

The applicants are needed to go through a thorough recruitment procedure at JP Morgan. JP Morgan assesses the technical, logical, and analytical ability of the candidate. JP Morgan’s interview rounds generally consist of 4 rounds that are listed below:

• Online assessment
• Behavioral Interview
• Technical Interview
• HR round

Note that each round is an elimination round. Therefore, you must be required to clear all the rounds during this process.

1. Online Assessment: The Online assessment at J.P. Morgans generally consists of the following two sections:

• Aptitude and general ability: This section contains aptitude and general ability questions to assess the logical ability of the candidate. This round generally consists of 30 questions.
• Coding Questions: Two questions of easy to medium difficulty. Prepare data structures and algorithms well for this round and you are good to go for this round. You can practice questions from our website by using the link

2. Technical Interview: Candidates who could clear the online assessment are invited for the technical interview. This round at JP Morgan generally takes place on HIREVIEW platform. Mostly the questions asked in this round are related to projects. Make sure you know every aspect of your project. You also need to have good knowledge of computer fundamentals topics like Operating systems, DBMS, OOPS, and Networking. For the experienced folks, the previous working experience is also discussed in this interview round.

• From the Database management system, most of the questions asked by JP Morgans are from Keys (Primary, Secondary, Candidate, Alternate, Super),  
• From the Operating system, most questions are asked from Deadlock, Multiprogramming, Multithreading, etc. .

Generally, each candidate has to go through one technical interview during this process.

3. Behavioral Interview: Behavioral interview at JP Morgan focuses on asking questions to evaluate your past behaviours and experiences that are related to the circumstances that you will encounter in the job profile for which you have applied.

This round includes the following types of questions:

• Describe a time when you have to work with a difficult person in your team.
• Tell me about a time when you positively impacted a project. How did you measure success?
• Tell me about a scenario when a project didn't go according to your plan, and what you did to get it back on track?

Through hackathon:

JP Morgan also hires through the “Code For Good Hackathon”. It is a 24 hours long hackathon in which you are required to collaborate with other candidates to develop innovative technology solutions for non-profit organizations. The mentors judge you during this process.

4. HR Interview:

The next round after the technical and behavioural interview round is generally the HR round. Through this round, the company wants to assess whether the candidate is a cultural fit. At JP Morgan HR interview round is an important round and the candidate must not underestimate this round. Though the HR interview round is considered the easiest round, you must be well-prepared for an HR Interview. 

The interviewer asks questions based on your resume. So, make sure you mention things that are true to the best of your knowledge in the resume.

The most frequently asked HR interview questions are the following:

• Why are you interested in working for the JP Morgan company?
• What do you know about JP Morgan corporate?
• Tell me about a time when you worked effectively under pressure.
• Tell us about your experience working in a closely related field.
• What do you think are your strengths and weaknesses?
• What is your biggest strength?
• Who is the CEO of the company?
• How would you deal with a team member who does not work up to their full potential?
• Who has been your inspiration as a leader?

You can prepare using this link.

Bus topology is an arrangement of devices in which all the computers or devices are connected to a single data line. Data is transmitted from one point to another (One-way flow).

Useful Resources

• Python Interview Questions
• Java Interview Questions
• Selenium Interview Questions
• Automation Testing Interview Questions
• Software Engineering Interview Questions
• Full Stack Developer Interview Questions
• Front End Developer Interview Questions
• Technical Interview Questions
• Coding Interview Questions
• Interview Resources

Union is an SQL command and it is used to join two or more sets into a single set. Two queries can be combined easily into a single result set using the select statements.

Syntax:

Query1 UNION Query2

Example:

Consider that we have two tables:

Organization1

Organization2

SELECT Employee_Name from Organization1 UNION SELECT Employee_Name FROM Organization2

Result:

Here, we have used two different tables for extraction of rows but the column specified for extraction is the same for both. Like UNION, we will get an error if different columns are used. It is important to note that the data type specified also must be the same for both queries. Note that the result of UNION contains distinct values only.

Union ALL is also an SQL command and it is also used to join two or more sets into a single set (like UNION). The only difference between UNION and UNION ALL is that UNION marks distinct entries only, whereas the result of UNION ALL may contain duplicate values as well.

Example:

Consider that we have two tables:

Organization1

Organization2

SELECT Employee_Name from Organization1 UNION ALL SELECT Employee_Name FROM Organization2

Result:

Here, we have used two different tables for the extraction of rows but the column specified for extraction is the same for both. Like UNION, We will get an error if different columns are used. It is important to note that the data type specified also must be the same for both queries. Note that the result of UNION ALL can contain duplicate values as well.

• A virtual function is a member function that is declared within a base class and defined (or overridden) under a derived class.
• A virtual function can be declared using a virtual keyword. It tells the compiler to do dynamic binding on that function. 
• A virtual function cannot be declared as static.

Here  0, 1, and 2 represent the colors red, white, and blue, respectively.

Input Format:

You are required to complete void sortColors(vector<int> &nums) function.

Output:

You are not required to return anything (Just sort the array)

Constraints:

1 <= n <= 10^5

nums[i] can be 0, 1 and 2 only for i in the range 0 <= i <= n - 1

Time Limit: 1 sec

Sample Input 1:

Sample Output 1:

Sample Input 2:

Sample Output 2:

Approaches

1. Sort the array using the merge sort algorithm:

• We can simply sort the array using the merge sort algorithm.
• Time Complexity:  O(N Log N) where N is the number of elements in the array.
• Space Complexity: O(1)

2. Using three variables:

• We can create three variables zero, one and two. All are initialized as 0. Now we will iterate over the nums and increment zero by once if the current element is 0 or increment one by once if the current element is 1 otherwise we will increment two by once.
• Then, we will iterate through the nums again and start assigning 0 at positions and decrementing the value zero unless and until zero becomes equal to 0, then we will continue the same thing for one and then for two.
• Time Complexity: O(N) Where N is the number of elements in the array.
• Space Complexity: O(1)

3. Dutch National Flag algorithm: Though, the second approach mentioned above takes O(N) time. But sometimes the interviewer puts forward the constraint to solve the problem in a single pass only.

• Let’s initialise three-pointers low, mid and high as 0, 0 and N - 1 respectively.
• We will iterate over nums till mid is less than equal to high.
• If at any step the value of nums at the index mid is equal to 0 then we will swap elements at the positions low and mid. Also, we will increment both low and mid by one.
• Else if the value at the index mid is equal to 2, we will swap the values at positions mid and high. Also, we will decrement the value of high by one.
• Otherwise, we will increment the value of mid by one.

In this way, we will be able to sort the given array in a single pass only.

Source Code:

class Solution {
public:
    void sortColors(vector<int>& nums) {
        
        
        /*
        
            0 ... low - 1 : 0
            
            low ... mid - 1 : 1
            
            mid ... n - 1 : 2
        */
        
        
        // Get the size of the given vector
        int n = nums.size();
        
        // Initialize three variables
        int low = 0, mid = 0, high = n - 1;
        
        // Iterate till mid is less than or equal to high
        while(mid <= high)
        {
            /*
                 If the value stored at
                 mid is zero
                 then swap value stored at mid
                 with the value store at low
                 increment low and mid by one
            */
            if(nums[mid] == 0)
            {
                swap(nums[mid], nums[low]);
                mid++;
                low++;
            }
            
            /*
                 Else if the value stored at
                 mid is 2
                 then swap value stored at mid
                 with the value store at high and
                 decrement the high variable by one    
            */
            
            else if(nums[mid] == 2)
            {
                swap(nums[high], nums[mid]);
                high--;
            }
            
            /*
                 Else increment mid by one  
            */
            
            else
                mid++;
            
        }
        
        // At the end nums will become sorted
        
        
    }
};

Singleton class is a class that can have only one object at a time. After this, if you further try to create an object of the Singleton class, then the new variable also points to the first object that you had created initially. So whatever changes you do to any variable inside the class through any object, it affects the variable of the single instance created.

Input Format:

You are required to complete bool hasCycle(ListNode* head) function.

Output:

True: If loop or cycle is present

False: Otherwise

Constraints:

1 <= Number of nodes in both the lists <= 10^5

-10^5 <= Node.Val <= 10^5

Time Limit: 1 sec

Sample Input 1:

Sample Output 1:

True

Sample Input 2:

Sample Output 2:

False

Approach

To solve this problem, you need to go back to your high school physics. Let us consider a scenario in which you and one of your friends are running on a circular track but with different speeds. You both started running at the same point initially. Now a moment would come when you both again meet at some position. 

We can use this concept to solve this problem. 

Source Code:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool hasCycle(ListNode *head) {
        
        
        /*
            
            slow pointer moves one step forward at a time
            fast pointer moves two step forward at a time
        */
        
        
        ListNode* slow = head;
        ListNode* fast = head;
        
        /*
            Iterating using do while loop to check
            
        */
        
        do
        {
            
            /*
                Since, fast pointer moves faster
                hence if loop is not present in the linked list
                then it will the first to encounter NULL
            */
            if(!fast)
                return false;
            
            /*
                Otherwise we will move slow pointer and fast pointer
                one step forward
                If fast pointer is not NULL then we will move 
                fast pointer again one step forward
                Otherwise, we would return false
            
            */
            
            slow = slow -> next;
            fast = fast -> next;
            if(fast)
                fast = fast -> next;
            else
                return false;
        }
        
        while(slow != fast);
        
        /*
            If everything remains fine that it means both pointers
            now point to the same node
            Hence, we will return true
        */
        
        
        return true;
        
        
    }
};

An object-oriented model is a way to apply object-oriented concepts to all the stages of the software development cycle. In an object-oriented model, we think about the problems using models organized around real-world problems.

The main objective of the object-oriented model is the following:

1. Testing an entity before actually starting building it.
2. Coordination with the customers.
3. Visualization.
4. Reducing complexity that leads to scalable products.

In the context of a class, inheritance is the capability of a class to inherit the properties and characteristics of another class. Inheritance is considered one of the most important concepts of Object-Oriented Programming (OOPS).

In this process, new classes are created from the existing class. The new class created is known as the derived class and the existing class is known as the parent class or base class. 

Types of Inheritance:

1. Single inheritance: In this type of inheritance only one class is allowed to inherit from one class. In other words, we can say that one derived class is inherited from the base class.
2. Multiple inheritances: In multiple inheritances, a class is allowed to inherit from more than one base class. Some languages, like C++, support multiple inheritances but other languages like Java don’t. Though, in Java, we can achieve multiple inheritances through an interface.
3. Multilevel inheritance: In multilevel inheritance, a derived class inherits another derived class.
4. Hierarchical inheritance: In this type of inheritance, more than one derived class are inherited from a common base class.
5. Hybrid inheritance: Hybrid inheritance is also known as virtual inheritance. It is a combination of more than one inheritance. For example, we can combine hierarchical inheritance and multiple inheritances.

Deadlock is a situation in which two or more processes wait for each other to get complete but none of them can ever complete (More specifically, they wait for the resources being held by the other).

Let us consider a scenario in which there are three different resources Resource1, Resource2, and Resource3, and three different processes Process1, Process2, and Process3. Resource1 is allocated to Process1, Resource2 is allocated to Process2, and Resource3 is allocated to Process3. After some time, Process1 asks for Resource1 that is being used by Process2. Process1 stops or halts its execution as it cannot be completed without Resource2. Process2 also demands Resource3 which is being used by Process3. Likewise, Process1 and Process2 also halt their execution because they cannot continue without Resource3. Process3 also asks for Resource1 which is used by Process1. Eventually, Process3 also halts its execution.

The four necessary conditions for deadlock are listed below:

1. Mutual Exclusion: It states that a resource can be used in a mutually exclusive manner. It means that two or more two processes cannot share a resource at the same time.
2. Hold and Wait: A process holds for a resource (that is being held by another process) while holding another resource.
3. No preemption: A process cannot release a resource until it gets completed.
4. Circular wait: It is a logical extension of hold and wait. It states that all the processes are arranged in a cyclic manner. Each process in the circular list waits for the resource being held by the next immediate process.

For example, if P[i] is the process and there are N number of processes in total, then the P[i] process waits for the resource allocated to the P[i] % (N + 1) process.

1. Practice data structures and algorithms: Prepare well for data structures and algorithm problems. While solving problems make sure to track the time you take to solve the problems. Also, try to cover questions from each and every topic.

2. Go through your resume: Go through your resume at least once before appearing for the interview. Make sure you have written those things in your resume that you are well aware of.

3. Be a good listener: Always listen to your interviewer carefully. Make a note of their hints. If you get stuck, interviewers are always willing to offer you some help.

4. Communicate well: Communication is a key thing in an interview. Learn “think aloud”. While solving a coding problem, you must tell your approach verbally. 

5. Ask questions to the interviewer: Show interest in knowing the roles of the interviewer. You should ask questions about their work, experiences at JP Morgan, and the team you will join if you get selected.

6. Give mock interviews: Last but not least, give as many mock interviews as you can. Mock interviews help you improve and gain confidence. You can use InterviewBit platform for it.

Yes, JP Morgan pays well to their interns. The average stipend is around Rs. 6,48,053 per year.

The eligibility criteria for software developer roles are given below:

• BS/BA degree or equivalent experience.
• Proficiency in one or more modern programming languages.
• Advanced knowledge of application, data, and infrastructure architecture disciplines.
• Understanding of software skills such as business analysis, development, maintenance, and software improvement.
• Understanding of architecture and design across all systems Working proficiency in developmental toolsets Knowledge of industry-wide technology trends and best practices.

This is the most frequently asked question in a HR interview. Such types of questions are asked in an interview to assess the honesty and attitude of the candidate. You have to be careful while sharing the incident you choose to explain. The mistakes that resulted in huge losses must be avoided. After sharing the incident, also share the lesson you learnt from it. 

For example, 

“I was managing a project and the senior authority wanted me to complete the project within two weeks. Since I was quite excited about the project so I decided to take up the project. But the project took more than two weeks time. 

After this incident, I always analyze the project first and if I think I need more time for the project to be done, I simply ask them to impart me more time.”

After clearing the online assessment round, candidates are required to go through a HireVue interview. HireVue is a kind of software that assesses the candidate on the basis of the traits like body language, eye movement, and more. If you are applying for a software engineer role then you should prepare JP Morgan interview questions to clear this round.

JP Morgan takes around 3 weeks to declare the final result.

It is a fairly long process. Generally, it consists of three rounds but this process can take up to 2 months.

One needs a proper preparation strategy and then anyone can make it to J.P. Morgan easily. To crack interviews you must prepare the following topics thoroughly:

To ace Online assessment and technical interview rounds:

Data Structures and Algorithms:

• Linked lists
• Recursion
• Dynamic Programming
• Sorting algorithms.

DBMS:

• This is the most asked topic after data structure and algorithms.
• Generally, keys and normalization concepts are asked from this subject.

Operating System:

• You must have a good knowledge of how the CPU schedules different tasks in our system.
• Generally, questions from deadlock are asked in the interview.

While answering these types of questions, mention the company's work culture that inspires you to join the company. Also, tell them about your goals to learn new things while working at the company. 

For example,

You can say, “I am a determined person and want to work for an organization where I would get the opportunity to work on challenging problems. JP Morgan has a set of principles that are quite impressive. The principles will help me to improve and grow at the same time.”

To answer such questions, you must highlight what makes you stand out and why the interviewer should be excited to have you on their team. Speak aloud about what you are good at, and the things you have done in the past that demonstrate your strength and abilities.