JPMorgan Chase & Co. Operations Interview Questions and Answers

Q1. Tell me about yourself. Where are you from?
Add your answer
Q2. How has the format of balance sheet changed?
Ans. 
The format of balance sheet has not changed much over the years.
• The basic structure of balance sheet remains the same with assets on one side and liabilities and equity on the other.

• However, there have been some changes in the presentation and disclosure requirements.

• For example, companies are now required to disclose more information about their assets and liabilities, such as fair value measurements and off-balance s...read more
Answered by AI
Add your answer
Q3. What do you think about the economic slowdown? Factors and solutions.
Ans. 
The economic slowdown is a complex issue with multiple factors and requires a multi-pronged approach for solutions.
• Factors include global trade tensions, political instability, and technological disruptions.

• Solutions may involve government intervention through fiscal and monetary policies, investment in infrastructure, and support for small businesses.

• Private sector initiatives such as innovation and diversification ca...read more
Answered by AI
Add your answer
Q4. What are 2 steps you would take as the Finance Minister?
Add your answer
Q5. Impacts of corporate tax cut.
Ans. 
Corporate tax cut can have positive impacts on business operations.
• Lower tax rates can increase profits and cash flow, allowing for reinvestment in operations.

• Reduced tax burden can also lead to increased hiring and expansion.

• However, the long-term effects on the economy and government revenue must be considered.

• Example: In 2017, the US corporate tax rate was reduced from 35% to 21%, leading to increased investment and...read more
Answered by AI
Add your answer
Q6. CV based questions.
Add your answer
Q7. How do you feel about operations and technology?
Ans. 
I am passionate about operations and technology and believe they go hand in hand.
• I believe that technology can greatly enhance and streamline operations processes.

• I enjoy staying up to date with the latest technological advancements and finding ways to incorporate them into operations.

• I understand the importance of balancing technology with human interaction and communication.

• For example, implementing a new inventory m...read more
Answered by AI
Add your answer
Q8. Why do you want to join Citi?
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

Q1. 
Find the Duplicate Number Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

Q1. 
Bubble Sort Problem Statement
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...read more
Ans. 
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
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Unweighted Graph Shortest Path Problem
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 ...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy