EPAM Systems interview experience Real time questions & tips from candidates to crack your interview

Junior Software Engineer

EPAM Systems
upvote
share-icon
5 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: Data Structures, Algorithms, OOPS, DBMS, Java
Tip
Tip

Tip 1 : Choose any Object-oriented Programming Language.
Tip 2 : Practice DSA from all topics, and try to maintain a consistency.
Tip 3 : Be prepared with atleast 2 Projects.

Application process
Where: Linkedin
Eligibility: No Criteria.
Resume Tip
Resume tip

Tip 1 : Be concise and don't use fancy fonts.
Tip 2 : Be honest and try to highlight your achievements.

Interview rounds

01
Round
Medium
Coding Test - Pen and paper
Duration60 minutes
Interview date1 Dec 2021
Coding problem1

The test was conducted online mode, in the afternoon. The test was completely proctored (your mic and camera should always on).

1. System Design

Design a text editor with a cursor that can do the following:

  • Add text to where the cursor is.
  • Delete text from where the cursor is (simulating the backspace key).
  • Move the cursor either left or right.
  • When deleting text, only characters to the left of the cursor will be deleted. The cursor will also remain within the actual text and cannot be moved beyond it. More formally, we have that 0 <= cursor.position <= currentText.length always holds.
Problem approach

I used two stacks for maintaining the last activities efficiently. After applying some OOPS and Stacks concept i was able to solve this problem.

02
Round
Hard
Online Coding Interview
Duration120 minutes
Interview date5 Dec 2021
Coding problem2

The test was conducted online mode, in the afternoon. The test was completely proctored (your mic and camera should always on.

1. Maximum of All Subarrays of Size K

Easy
15m average time
85% success
0/40
Asked in companies
SprinklrMicrosoftAmazon

You are given an array “A” of N integers. Your task is to find the maximum element in all K sized contiguous subarrays from left to right.

For Example:
If A = [3, 2, 3], and K = 2.
Then max of [3, 2] = 3 and max of [2, 3] = 3
So, the answer will be [3, 3]

If A = [3, 2, 3, 5, 1, 7] and K = 3.
Then max of [3, 2, 3] = 3 
Then max of [2, 3, 5] = 5 
Then max of [3, 5, 1] = 5 
Then max of [5, 1, 7] = 7 
So  the answer will be [3, 5, 5, 7]
Follow Up :
Can you solve the problem in O(N) time complexity and O(K) space complexity?
Problem approach

I used the concept of deque to solve this problem.

Try solving now

2. 0 1 Knapsack

Easy
15m average time
85% success
0/40
Asked in companies
TwitterWalmartAmazon

A thief is robbing a store and can carry a maximal weight of W into his knapsack. There are N items and the ith item weighs wi and is of value vi. Considering the constraints of the maximum weight that a knapsack can carry, you have to find and return the maximum value that a thief can generate by stealing items.

Problem approach

I solved this using 0-1 knapsack algorithm and applied to backtracking for printing selected items

Try solving now
03
Round
Medium
Group Discussion
Duration60 minutes
Interview date12 Jun 2022
Coding problem1

The topic for Group Discussion was "Effect of Artificial Intelligence on Employment", it was conducted on online mode with camera and mic on.

1. Group Discussion

What do you think of the Effect of Artificial Intelligence on Employment?

Problem approach

Tip 1 : Stay patient wait for your turn to speak
Tip 2 : Produce facts with your words

04
Round
Hard
Video Call
Duration90 minutes
Interview date24 Jun 2022
Coding problem1

This was a one-o-one technical interview round and was conducted in online mode.

1. Theory questions

  1. Your fav programming language? Why?
  2. Explain OOPS concepts
  3. Write coding implementation of abstraction and polymorphism.
  4. What are the types of inheritance.
  5. Java do not support multiple inheritance. Why?
  6. What is Interface?
  7. What are the use of static keyword?
  8. What is the final keyword?
  9. Explain Access modifiers
  10. What is Overloading and Overriding?
  11. What is Constructor? Explain the types of constructors
  12. Define Exception handling
  13. Define Collection Frameworks
  14. What do you mean by Synchronised?
  15. Define HashMap implementation
  16. Explain different Data Structures
  17. Explain the difference between singly linked list and circular linked list.
  18. Explain Normalization with its types.
  19. Explain Join
     
Problem approach

Tip 1 : Be Prepared with Java Core Concepts.
Tip 2 : Be prepared with OOPs Concepts.

05
Round
Medium
HR Round
Duration60 minutes
Interview date3 Jan 2022
Coding problem1

Like others rounds, this round was also conducted in online mode.

1. Basic HR Questions

  1. Introduce yourself.
  2. Tell me about your projects, whether it was a team project or individual.
  3. Which one is better, individual project or Team project? Why?
  4. Why do you want to join EPAM.
  5. What if you will get into a conflict with one of your female team-member.
  6. What are the leadership skills you think you have?
  7. Suppose you with your one colleague working on a project with equal participation, and you will not get credits and recognition, In this situation what will you do?
  8. Tell me something that you have achieved apart from academics.
  9. What are your hobbies and interests.
Problem approach

Tip 1 : Be confident and honest.
Tip 2 : Be prepared with situation based problems.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
Junior Software Engineer
5 rounds | 6 problems
Interviewed by EPAM Systems
1998 views
0 comments
0 upvotes
Junior Software Engineer
3 rounds | 5 problems
Interviewed by EPAM Systems
2065 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by EPAM Systems
1993 views
0 comments
0 upvotes
Junior Software Engineer
4 rounds | 10 problems
Interviewed by EPAM Systems
1197 views
0 comments
0 upvotes