Envié una solicitud electrónica. El proceso duró 1 día. Acudí a una entrevista en EPAM Systems (Pune)
Entrevista
Average and Easy going. Interviewer was detail oriented and wanted to understand logic and WHYs behind every answers that you gave. Make sure to give specific answer without giving mugged up answers
Preguntas de entrevista [1]
Pregunta 1
How microservices communicate with each other.
SoA v/s MS
Disadvantages of MS
When will you choose MS?
How do you handle exceptions in your project?
Why don’t you handle exceptions by catch instead of Exception handler?
Why to use an Exception handler?
How do you use an Exception handler? Class level and Method level annotation for the same.
How does the Exception handler work internally?
Checked and Unchecked exceptions
How to handle Null pointer exceptions efficiently?
Solicité el puesto a través de un captador. El proceso duró 1 día. Acudí a una entrevista en EPAM Systems (Hyderabad) en abr 2026
Entrevista
1. Coding round( 1 program with java + another program using java streams api)
2. Technical round( Questions are mostly from core java, collections, java 8, streams api, spring boot micro services and design pattern related)
2 more rounds including Hr
Envié una solicitud electrónica. Acudí a una entrevista en EPAM Systems
Entrevista
Recruiter connected through instahyre and scheduled first round technical interview. There will be two technical rounds for Java backend and Full Stack interview. My First Round is completed. These are the questions asked:
Internal implementation of LinkedHashMap?
Internal implementation of PriorityQueue?
Class level locking and object level locking?
Can we invoke the terminated collection?
Facade design pattern?
Liskov substitution principle?
Heap data structure?
Doubly linkedlist datastructure implementation?
[1,3,5,7,8,9], targetSum=13, output=[2,4] indexes of the elements that match the target sum.
Find a second non-repeated character from the given string?
Preguntas de entrevista [1]
Pregunta 1
Internal implementation of LinkedHashMap?
Internal implementation of PriorityQueue?
Class level locking and object level locking?
Can we invoke the terminated collection?
Facade design pattern?
Liskov substitution principle?
Heap data structure?
Doubly linkedlist datastructure implementation?
[1,3,5,7,8,9], targetSum=13, output=[2,4] indexes of the elements that match the target sum.
Find a second non-repeated character from the given string?
