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

# Software Engineer

Amdocs
3 rounds | 3 Coding problems

## Interview preparation journey

Journey
I kept practicing DSA, oops, algorithms, and competitive programming. And I was also learning web development and I made some good projects. I also worked on my communication skill.
Application story
I got this Referral from my friend that works there. He helped by telling me which topics would be asked and told me about his interview experiences.
Why selected/rejected for the role?
I passed 2 interview rounds and 1 HR round. I answered 2 questions out 0f 3 in the first round and in the second round I answered all questions.
Preparation
Duration: 8 months
Topics: Data structures, Sorting, Recursion, Pointers, OOPS, Algorithms, Greedy algorithms, Dynamic Programming
Tip

Tip 1 : Do Competitive Programming consistently.
Tip 2 : Practice as many questions possible in DSA covering all topics.
Tip 3 : Have atleast a single project of which you have complete knowledge with good hands-on of the technology used in it.

Application process
Where: Referral
Eligibility: No criteria
Resume tip

Tip 1 : Have good projects of which you have complete knowledge.
Tip 2 : Showcase your coding skills by adding various Coding profiles like: Codeforces, Codechef, etc.

## Interview rounds

01
Round
Hard
Online Coding Test
Duration90 mins
Interview date18 Jun 2022
Coding problem1

### 1. Next Greater Number

Moderate
15m average time
90% success
0/80

#### You are given a string S which represents a number. You have to find the smallest number strictly great...

View more
Problem approach

I have done this question earlier so just use already built algorithm which traverses the number from the back.

02
Round
Medium
Video Call
Duration60 mins
Interview date23 Jun 2022
Coding problem1

### 1. Maximum length sub-array having absolute difference of adjacent elements either 0 or 1

Easy
15m average time
85% success
0/40

#### Given an array ‘A’ of ‘N’ integers, you need to find the maximum length of the sub-array such that the absolute difference between the adjacent elements of the sub-array should be either 0 or 1.

<...
View more
Problem approach

This was a simple array problem. I solved this using question as:
Starting from the first element of the array, find the first valid sub-array and store its length then starting from the next element (the first element that wasn’t included in the first sub-array), find another valid sub-array. Repeat the process until all the valid sub-arrays have been found then print the length of the maxi...

View more
03
Round
Easy
HR Round
Duration45 mins
Interview date29 Jun 2022
Coding problem1

### 1. Basic HR Questions

Why do you want to join Amdocs?

Problem approach

Tip 2: Try to communicate better

Here's your problem of the day

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

What is the result of 4 % 2?

Start a Discussion
Similar interview experiences
Software Engineer
4 rounds | 3 problems
Interviewed by Amdocs
1215 views
Software Engineer
4 rounds | 5 problems
Interviewed by Amdocs
1189 views
Software Engineer
4 rounds | 4 problems
Interviewed by Amdocs
621 views
Software Engineer
1 rounds | 1 problems
Interviewed by Amdocs
56 views
Companies with similar interview experiences
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
10366 views