JPMorgan Chase & Co. Software Engineer Interview Questions, Process, and Tips

Q1. All DSA and OOPs questions
Add your answer

Q1. Same as round 1
Add your answer

Q1. Design round ..
Add your answer

Q1. Basic hr questions
Add your answer

Cognitive test basically testing aptitude

Test TO show my coding skills on Dsa and Dbms

Q1. WHat IS circular linked list
Ans. 
A circular linked list is a linked list where the last node points back to the first node, forming a circle.
• Each node has a reference to the next node in the list.

• The last node's reference points back to the first node.

• Traversal can start from any node and loop through the entire list.
Answered by AI
Add your answer
Q2. What is time omplexity . explain with examples
Ans. 
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 sorted...read more
Answered by AI
Add your answer

Q1. Print all the permutations of a string both iterative and recursive way.
Ans. 
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']
Answered by AI
Add your answer

DFS questions, and Python coding challenge

Q1. Python technical questions
Add your answer