i
JPMorgan Chase & Co.
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Jun 2023. There were 6 interview rounds.
3 sections consisting maths, prob stats and CS fundamentals
2 easy to medium-level coding questions
Graph of x+(1/x) is a hyperbola with two branches.
The graph consists of two branches, one in the first quadrant and one in the third quadrant.
As x approaches positive or negative infinity, the graph approaches the x-axis.
The graph has a vertical asymptote at x=0.
The minimum value of the function is 2 when x=1 or x=-1.
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Loop in a linkedlist can be found using Floyd's cycle-finding algorithm.
Use two pointers, one moving at a speed of 1 and the other at a speed of 2.
If there is a loop, the two pointers will eventually meet at some point.
If there is no loop, the faster pointer will reach the end of the list.
Time complexity is O(n) and space complexity is O(1).
What people are saying about JPMorgan Chase & Co.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Pseudo code to find the k'th largest element in an array
Sort the array in descending order
Return the element at index k-1
JPMorgan Chase & Co. interview questions for designations
I applied via Campus Placement
ATM transaction involves multiple background processes including authentication, authorization, and communication with bank servers.
Customer inserts card and enters PIN
ATM authenticates the card and PIN
ATM requests authorization from bank server
Bank server verifies account balance and approves or denies transaction
ATM dispenses cash or completes other requested transaction
ATM updates account balance and sends transacti
Cut cake into 8 pieces using knife 3 times only.
First, cut the cake horizontally into two equal halves.
Then, cut the cake vertically into four equal pieces.
Finally, cut the cake horizontally again into eight equal pieces.
Make sure to use the knife efficiently to minimize the number of cuts.
Practice visualization before making the cuts to avoid mistakes.
The one bird was already dead.
The bird was already dead before the shot was fired.
The bird was injured and unable to fly away with the rest of the birds.
The bird was a decoy bird used for hunting purposes.
The bird was a trained bird used for falconry.
Developed a web-based attendance management system and a mobile app for event management.
Created a database schema and implemented CRUD operations using PHP and MySQL.
Designed the user interface using HTML, CSS, and JavaScript.
Integrated Google Maps API for location tracking in the mobile app.
Implemented push notifications using Firebase Cloud Messaging.
Collaborated with a team of four to complete the projects within t
I applied via Campus Placement
Finding smallest of 4 numbers without using >.< and min function in Java.
Initialize a variable with the first number
Compare it with the remaining numbers using if-else statements
If a smaller number is found, update the variable
Repeat until all numbers are compared
The final value of the variable will be the smallest number
Code for palindrome checking
Convert the input to lowercase to ignore case sensitivity
Use two pointers, one at the start and one at the end of the string
Compare the characters at both pointers and move them towards each other
If all characters match, it's a palindrome
Javascript code to display 'Hello World!' on the webpage
Create a new HTML file
Add a script tag with 'type' attribute set to 'text/javascript'
Inside the script tag, use document.write() to display 'Hello World!'
Swap two numbers without using a temporary variable.
Use addition and subtraction to swap the values
Use XOR operator to swap the values
Use multiplication and division to swap the values
To add 2 tables, we need to use a join operation on a common column.
Identify the common column between the tables
Choose the appropriate join type (inner, outer, left, right)
Write the SQL query to join the tables
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column
Union combines and removes duplicates, Union All combines all rows including duplicates.
Union is used to combine the result sets of two or more SELECT statements and remove duplicates.
Union All is used to combine the result sets of two or more SELECT statements and includes all rows, including duplicates.
Union is slower than Union All as it has to remove duplicates.
Union requires the same number of columns in all SELEC...
Being assigned a project with unrealistic deadlines and minimal guidance
Received a project with tight deadlines and unclear requirements
Struggled to meet the deadlines due to lack of guidance and support
Had to work long hours and weekends to try to complete the project
Learned the importance of clear communication and setting realistic expectations
I was interviewed before Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
There were 33 questions in total. The objective questions were simple.
Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.
Sort a list of event dates in ascending order based on year, month, and day.
Sort the list of dates based on year, then month, and finally day.
Use a sorting algorithm to rearrange the dates in ascending order.
Ensure the constraints are met for each date in the list.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Given an array and a target sum, find all pairs of elements that add up to the target sum.
Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the pairs based on the first element and then the second element.
Handle edge cases like duplicate elements and pairs with the same values.
Example...
Given an integer N
, your task is to recursively break it into three integer parts: N / 2
, N / 3
, and N / 4
. You need to compute the maximum sum possible by dividing the numbe...
Given an integer N, recursively break it into three parts and find the maximum sum possible.
Recursively divide N into N/2, N/3, and N/4 to find the maximum sum
Compare the sum obtained by dividing N with the sum of N itself
Return the maximum sum for each test case
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more
based on 2 interviews
Interview experience
based on 10 reviews
Rating in categories
Associate
10.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
5.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Vice President
4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
2.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
2.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Morgan Stanley
Goldman Sachs
TCS
Bank of America