JP Morgan interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

JP Morgan
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
I started my journey in coding in my second year after being motivated by my seniors. I initially began by learning basic programming languages. Later, I started participating in online coding contests and solving questions there. I kept trying to be consistent in doing so. After 2-3 months, I was able to solve some questions on coding platforms. Then, in my third year, I studied core subjects like OS, DBMS, OOPS, and CN in depth. In this manner, I was well-prepared before the placement season.
Application story
This company visited my campus for the placement.
Why selected/rejected for the role?
I was rejected because I was not able to maintain the timing for answering the questions. I should be faster.
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1: Practice coding on online coding platforms with at least 100 questions.
Tip 2: Practice any one automation framework that includes design patterns.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1: Restrict your resume to one page and include only your practical work.
Tip 2: Mention key topics such as Selenium, Rest Assured Automation, and programming languages like Java.

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date15 Oct 2022
Coding problem3

1. DBMS

Types of Joins. (Learn)
What would you do if you wanted the top 5 records from a table?

2. DBMS

3. Largest Component

Moderate
45m average time
55% success
0/80
Asked in companies
OlaMicrosoftJP Morgan

You are given an array 'ARR' of size 'N' containing positive integers. Consider an undirected graph using the given array with the following conditions:

-> The graph consists of 'N' vertices.
-> The ith vertex has a value 'ARR[i]'.
-> There is an edge between two vertices 'i' and 'j' (where 'i' < 'j'), if and only if GCD('ARR[i]', 'ARR[j]') is greater than 1.

GCD(a, b) is the maximum number x such that both a and b are divisible by x.

Your task is to find the size of the largest component in the graph.

A component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices in the rest of the graph. The size of a component is the number of vertices in it.

Problem approach

Used DSU and a bit of maths.

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date15 Oct 2022
Coding problem2

1. Decode Ways

Moderate
15m average time
85% success
0/80
Asked in companies
AccentureUberAdobe

Given a string ‘strNum’ which represents a number, your task is to find the ways to decode the given string ‘strNum’.

The format of encoding is as follows: ‘A’ - 1, ‘B’ - 2, ‘C’ - 3, ‘D’ - 4, ……………, ‘Z’ - 26.

Encoding is possible in letters from ‘A’ to ‘Z’. There is an encoding between character and number.

Example :

subsequence

‘n = 226’ so we can decode ‘226’ in such a way-

‘BZ = 2-26’, as B maps to 2 and Z maps to 26.

‘BBF = 2-2-6’

‘VF = 22-6’

‘226; can be decoded in three ‘BZ’, ‘BBF’, ‘VF’ possible ways.

Point to be noticed we can’t decode ‘226’ as ‘226’ because we have no character which can directly map with ‘226’ we can only decode numbers from ‘1’ to ‘26’ only.

Problem approach

Used recursion and DP.

Try solving now

2. Shortest substring with all characters

Moderate
18m average time
85% success
0/80
Asked in companies
AmazonMicrosoftCisco

You have been given a string 'S' which only consists of lowercase English-Alphabet letters.

Your task is to find the shortest(minimum length) substring of 'S' which contains all the characters of 'S' at least once. If there are many substrings with the shortest length, then find one which appears earlier in the string i.e. substring whose starting index is lowest.

For example-
If the given string is S = "abcba", then the possible substrings are "abc" and "cba". As "abc" starts with a lower index (i.e. 0, "cba" start with index 2), we will print "abc" as our shortest substring that contains all characters of 'S'.
Problem approach

Used 2 pointer sliding window.

Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date15 Oct 2022
Coding problem1

1. Basic HR Questions

Tell me something about yourself that is not in your resume.

Problem approach

If you get this question, it's an opportunity to choose the most compelling information to share that is not obvious from your resume.

Example:

Strength: I believe that my greatest strength is the ability to solve problems quickly and efficiently, which makes me unique from others.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

To make an AI less repetitive in a long paragraph, you should increase:

Choose another skill to practice
Similar interview experiences
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by JP Morgan
3734 views
0 comments
0 upvotes
company logo
Software Engineer
4 rounds | 3 problems
Interviewed by JP Morgan
4877 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 6 problems
Interviewed by JP Morgan
1370 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 14 problems
Interviewed by JP Morgan
1145 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
12177 views
7 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7856 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
9947 views
1 comments
0 upvotes