KPMG India Senior Software Engineer Interview Questions and Answers

This is a case study round, you would be given 3 question out of which you will need to solve any 2.
Two question are algoritm based around designing datastructure and matrix problem
One question will be based om designing Database for a given requirement.

Q1. This is a follow up round after case study,where the interviewer will ask you about perfomance and scalability of questions is case study round. There might be few addition question on improving the soluti...read more
Add your answer

Q1. This is a behaviour round where interviewer will see your fitiness for team. It basically has scenario based question . This is also elimination round
Add your answer

Mix of coding, aptitude, java, javascript

Q1. Resume based questions on project
Add your answer
Q2. Basic SQL, Java streams questions
Add your answer

Q1. Project related questions
Add your answer
Q2. Internal working of hashmap
Ans. 
HashMap is a data structure that stores key-value pairs and uses hashing to quickly retrieve values based on keys.
• HashMap internally uses an array of linked lists to store key-value pairs.

• When a key-value pair is added, the key is hashed to determine the index in the array where the pair will be stored.

• If multiple keys hash to the same index, a collision occurs and the pairs are stored in a linked list at that index.

• To...read more
Answered by AI
Add your answer
Q3. Design patterns I've used
Ans. 
I have used design patterns such as Singleton, Factory, and Observer in my projects.
• Singleton pattern ensures a class has only one instance and provides a global point of access to it.

• Factory pattern creates objects without specifying the exact class of object that will be created.

• Observer pattern defines a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and
Answered by AI
Add your answer
Q4. Print whole Fibonacci series using recursion.
Ans. 
Print Fibonacci series using recursion
• Define a recursive function to calculate Fibonacci numbers

• Base case: return 0 if n is 0, return 1 if n is 1

• Recursive case: return sum of previous two Fibonacci numbers

• Print each Fibonacci number in the series
Answered by AI
Add your answer
Q5. Show my Github projects, and the interviewer didn't even properly looked into the code.
Add your answer

They will ask some simple algorithmic questions.

Q1. Very friendly face to face interview simple questions will be asked base on your level of expertise
Add your answer