i
JPMorgan Chase &
Co.
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
JVM garbage collection is a process of automatically managing memory in Java programs by reclaiming unused memory.
Garbage collection is the process of identifying and deleting objects in memory that are no longer needed.
JVM uses different algorithms like Mark-Sweep, Mark-Compact, and Copying to perform garbage collection.
Examples of garbage collection in Java include the use of 'System.gc()' method to suggest garb...
Yes, React uses one-way data binding to ensure that changes in the UI trigger updates in the underlying data model.
React uses a unidirectional data flow, where data flows from parent components to child components.
Changes in the UI trigger updates in the underlying data model, but not the other way around.
This helps in maintaining a predictable state of the application and improves performance.
Example: When a user...
Binary search to find peaks in an array
Implement binary search to find peaks in the array
Compare mid element with its neighbors to determine if it is a peak
Recursively search in the half of the array where the peak is likely to be found
Merging two dataframes combines them into a single dataframe based on a common column or index.
Use the merge() function in pandas library in Python to merge dataframes
Specify the common column or index to merge on
Choose the type of join (inner, outer, left, right) based on your requirement
What people are saying about JPMorgan Chase & Co.
Use a PDF processing tool to extract and analyze tabular data from PDF files.
Use a PDF parsing library like PyPDF2 or PDFMiner to extract text from PDF files.
Identify tables in the extracted text based on tabular structure or patterns.
Use regular expressions or table detection algorithms to parse and organize tabular data.
Consider using tools like pandas in Python for further data manipulation and analysis.
I explained a complex algorithm to a non-technical team member.
Broke down the concept into simpler terms
Used analogies or real-life examples to clarify
Encouraged questions and feedback
Offered additional resources for further understanding
Time complexity refers to the amount of time an algorithm takes to run as a function of the input size.
Time complexity is typically expressed using Big O notation, which describes the worst-case scenario.
Common time complexities include O(1) for constant time, O(log n) for logarithmic time, O(n) for linear time, O(n^2) for quadratic time, and O(2^n) for exponential time.
For example, searching for an element in a s...
Print all permutations of a string iteratively and recursively.
Iterative approach: Use a stack to keep track of characters and their positions. Swap characters to generate permutations.
Recursive approach: Use backtracking to generate all possible permutations by swapping characters.
Example: Input 'abc', output ['abc', 'bac', 'cab', 'acb', 'bca', 'cba']
Sorting a 1d array of strings
Use a sorting algorithm like bubble sort, selection sort, or merge sort
Consider using built-in sorting functions in programming languages like sort() in Python or Arrays.sort() in Java
Ensure to compare strings correctly based on their ASCII values
Designing an AI parking management system to optimize parking space usage and improve efficiency.
Utilize sensors to detect available parking spaces in real-time
Implement machine learning algorithms to predict parking demand and optimize space allocation
Integrate with mobile apps for users to easily find and reserve parking spots
Use computer vision for license plate recognition and enforcement of parking rules
I applied via Naukri.com and was interviewed in Nov 2024. There was 1 interview round.
Sorting a 1d array of strings
Use a sorting algorithm like bubble sort, selection sort, or merge sort
Consider using built-in sorting functions in programming languages like sort() in Python or Arrays.sort() in Java
Ensure to compare strings correctly based on their ASCII values
I applied via Referral and was interviewed in Aug 2024. There were 2 interview rounds.
Numpy arrays are more efficient for numerical operations compared to lists.
Numpy arrays are homogeneous in nature, while lists can contain different data types.
Numpy arrays support vectorized operations, making them faster for numerical computations.
Numpy arrays require less memory compared to lists for large datasets.
Example: np_array = np.array([1, 2, 3]) vs list = [1, 2, 3]
I applied via Approached by Company and was interviewed in Sep 2024. There were 3 interview rounds.
Designing an AI parking management system to optimize parking space usage and improve efficiency.
Utilize sensors to detect available parking spaces in real-time
Implement machine learning algorithms to predict parking demand and optimize space allocation
Integrate with mobile apps for users to easily find and reserve parking spots
Use computer vision for license plate recognition and enforcement of parking rules
Coding test coprising 3 easy medium lc problems
Binary search to find peaks in an array
Implement binary search to find peaks in the array
Compare mid element with its neighbors to determine if it is a peak
Recursively search in the half of the array where the peak is likely to be found
I applied via Job Portal and was interviewed in Jul 2024. There was 1 interview round.
I appeared for an interview in Jun 2024.
Binary search based question, hashmap / dictionary based question on DSA
Use a PDF processing tool to extract and analyze tabular data from PDF files.
Use a PDF parsing library like PyPDF2 or PDFMiner to extract text from PDF files.
Identify tables in the extracted text based on tabular structure or patterns.
Use regular expressions or table detection algorithms to parse and organize tabular data.
Consider using tools like pandas in Python for further data manipulation and analysis.
Array Question To find the second highest.
I applied via Approached by Company and was interviewed in Dec 2023. There were 2 interview rounds.
DSA topics were asked
I explained a complex algorithm to a non-technical team member.
Broke down the concept into simpler terms
Used analogies or real-life examples to clarify
Encouraged questions and feedback
Offered additional resources for further understanding
I applied via Referral and was interviewed in Aug 2023. There were 2 interview rounds.
Kubernetes is an open-source container orchestration platform that automates the deployment, scaling, and management of containerized applications.
Kubernetes architecture consists of a master node and multiple worker nodes.
Master node components include API server, scheduler, controller manager, and etcd.
Worker node components include kubelet, kube-proxy, and container runtime (e.g. Docker).
Kubernetes uses Pods as the ...
The duration of JPMorgan Chase & Co. Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 30 interview experiences
Difficulty level
Duration
based on 169 reviews
Rating in categories
15-20 Yrs
Not Disclosed
Associate
11.2k
salaries
| ₹10 L/yr - ₹36.5 L/yr |
Team Lead
5.8k
salaries
| ₹4.5 L/yr - ₹17 L/yr |
Vice President
4.3k
salaries
| ₹27 L/yr - ₹70 L/yr |
Senior Associate
2.8k
salaries
| ₹13.8 L/yr - ₹53 L/yr |
Analyst
2.8k
salaries
| ₹6.5 L/yr - ₹26.6 L/yr |
Morgan Stanley
Goldman Sachs
TCS
Bank of America