i
JPMorgan Chase & Co.
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Basic questions on string and dynamic programming
I addressed the issue by initiating open communication, understanding their perspective, and finding common ground to work together effectively.
Initiated a one-on-one conversation to address the issue and understand their concerns
Listened actively to their perspective and tried to empathize with their point of view
Found common ground and established clear communication channels to work together effectively
Sought help f...
Led a team of 10 students in organizing a charity event for a local shelter.
Organized team meetings to delegate tasks and set deadlines
Motivated team members to actively participate and contribute ideas
Coordinated with external vendors and sponsors to secure donations and resources
Managed logistics and ensured smooth execution of the event
Evaluated the success of the event and gathered feedback for improvement
I applied via Company Website
Online Assessment and consisted of a few coding questions (Easy-Medium Level)
I applied via Campus Placement and was interviewed in Mar 2024. There were 3 interview rounds.
It was 2 DSA questions
What people are saying about JPMorgan Chase & Co.
I applied via Campus Placement and was interviewed before Aug 2023. There were 3 interview rounds.
Basic dsa question on arrays and strings
I want to work for JPMC because of its reputation for innovation, global impact, and opportunities for growth.
JPMC is known for its cutting-edge technology and innovative solutions.
The company has a global presence, providing opportunities to work on diverse projects and collaborate with teams from around the world.
JPMC offers a supportive and inclusive work environment, fostering professional growth and development.
I ...
JPMorgan Chase & Co. interview questions for designations
I applied via Campus Placement and was interviewed before May 2023. There were 3 interview rounds.
2 LC medium questions
2 simple DSA questions on arrays and linked lists.
I applied via Campus Placement and was interviewed before Apr 2021. There were 3 interview rounds.
Question count: 2
Platform: Hackerrank
Topics: Array and Bit Manipulation
posted on 15 Dec 2020
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
To check palindrome and anagram of a string with O(n), use a hash table to store character frequencies.
Create a hash table to store the frequency of each character in the string.
For palindrome, check that no more than one character has an odd frequency.
For anagram, compare the hash tables of the two strings.
If the hash tables are equal, the strings are anagrams.
If the hash tables differ by only one character, the strin...
Optimized solutions and core principles applied in OOPS
Encapsulation, Inheritance, Polymorphism, Abstraction are core principles of OOPS
Optimized solutions can be achieved through efficient algorithms and data structures
Design patterns like Singleton, Factory, Observer can also be used for optimized solutions
I appeared for an interview before May 2021.
Round duration - 45 Minutes
Round difficulty - Hard
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...
Find the duplicate number in an integer array containing numbers from 0 to (N - 2).
Iterate through the array and keep track of the frequency of each number using a hashmap.
Return the number that appears twice in the array.
The duplicate number is always present in the given array.
Round duration - 50 Minutes
Round difficulty - Easy
Sort an unsorted array of non-negative integers using the Bubble Sort algorithm, which swaps adjacent elements if they are not in the correct order to sort the array in non-d...
Bubble Sort is used to sort an array of non-negative integers in non-decreasing order by swapping adjacent elements if they are not in the correct order.
Iterate through the array and compare adjacent elements, swapping them if they are in the wrong order.
Repeat this process until the array is sorted in non-decreasing order.
Time complexity of Bubble Sort is O(n^2) in worst case.
Example: For input [6, 2, 8, 4, 10], the o
Round duration - 60 Minutes
Round difficulty - Medium
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N
houses numbered from 1 ...
Find the shortest path between two houses in a city represented as an unweighted graph.
Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.
Start BFS from the source house and keep track of the shortest path to each house.
Once the destination house is reached, backtrack to find the shortest path.
Consider using a queue data structure to implement BFS efficiently.
Round duration - 60 Minutes
Round difficulty - Easy
Tip 1 : online resources
Tip 2 : cracking the coding interview by Gayle laykemann this is one of the best book for learning the concept at the initial level. Start practicing the approaches mention in the book once done apply the same to similar level pattern questions.
Tip 3 : geeks for geeks start from school level and then move towards easy medium and hard once done practice the previous year questions
Tip 1 : precise clear concise and well written
Tip 2 : mentions the skills sets along with the projects
Some of the top questions asked at the JPMorgan Chase & Co. Software Engineer Intern interview -
based on 5 interviews
2 Interview rounds
based on 7 reviews
Rating in categories
Associate
10.4k
salaries
| ₹10 L/yr - ₹43.4 L/yr |
Team Lead
5.6k
salaries
| ₹5.7 L/yr - ₹16.7 L/yr |
Vice President
4.1k
salaries
| ₹20 L/yr - ₹70 L/yr |
Analyst
2.6k
salaries
| ₹6.5 L/yr - ₹26 L/yr |
Software Engineer
2.6k
salaries
| ₹11 L/yr - ₹35.3 L/yr |
Morgan Stanley
Goldman Sachs
TCS
Bank of America