JPMorgan Chase & Co. Software Engineer Level 1 Interview Questions and Answers

Data Structures and Algorithms

Q1. Data structures and Algorithms
Add your answer

Q1. Data Structures And Algorithms
Add your answer

Q1. Basic understanding of the resume, resume based question, web based questions
Add your answer

Q1. They grind u in javascript,typescript
Add your answer
Q2. Html css, angular
Add your answer
Q3. Deep preparation needed
Add your answer

Q1. Project Architecture
Add your answer

Q1. Informatica tech questions
Add your answer

Question Related to the DP and the Graph

Q1. Kth Max Element in a Array
Ans. 
Find the Kth maximum element in an array of strings.
• Sort the array in descending order.

• Return the element at index K-1.
Answered by AI
Add your answer
Q2. Coin Change and optimization through DP
Ans. 
Coin change problem can be solved using dynamic programming to find the minimum number of coins needed to make a certain amount of change.
• Use dynamic programming to build up solutions for smaller subproblems

• Start by initializing an array to store the minimum number of coins needed for each amount from 0 to the target amount

• Iterate through each coin denomination and update the array with the minimum number of coins need
Answered by AI
Add your answer

Q1. Project include in your Resume
Add your answer
Q2. HR common question
Add your answer

MCQ test consisting of 70 mcqs in 75 minutes from aptitude english and cs fundamentals. If cleared next paper 2 coding qs medium level

Q1. Two sum leetcode problem
Add your answer
Q2. What problems you faced in your project
Ans. 
I faced challenges with integrating third-party APIs and debugging complex logic.
• Difficulty in understanding and implementing third-party APIs

• Issues with data synchronization between different systems

• Troubleshooting complex logic errors

• Managing dependencies and version conflicts

• Time constraints affecting problem-solving
Answered by AI
Add your answer

DP graphs strings it was good

Q1. Reverse a linkded list
Ans. 
Reverse a linked list by changing the direction of pointers
• Start with three pointers: current, previous, and next

• Iterate through the list, updating pointers to reverse the direction

• Return the new head of the reversed list
Answered by AI
Add your answer
Q2. Print fibonacci series
Ans. 
The Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.
• Start with two variables initialized to 0 and 1

• Loop through desired number of iterations, adding the previous two numbers to get the next number

• Print or store each number in the series
Answered by AI
Add your answer

Q1. Java, lambda expressions, micro services
Add your answer

Q1. Microservices architecture, saga pattern
Add your answer

Q1. Managerial, how do you improve your skills etc
Add your answer