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

Associate Software Engineer

Amdocs
upvote
share-icon
4 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
Starting my journey in Data Structures and Algorithms (DSA) from your second year is a great way to build a strong foundation in computer science and programming. Combining this with a focus on computer fundamentals demonstrates a well-rounded approach to your education.
Application story
Round 1 (Online assessment): Round 2 (Psychometric): Round 3 (Technical Interview): Round 4 (HR Interview):
Why selected/rejected for the role?
I got my result, and I was selected as I was confident in the interview and gave all the answers in the interview.
Preparation
Duration: 12 months
Topics: Data Structure, Algorithms, Operating System, Object Oriented programming language, Computer Network
Tip
Tip

Tip 1 : Cover main subjects in detail (Data Structure and Algorithms, Operating System, object-oriented programming language, and Computer Network).
Tip 2 : Do not lie in your resume, as questions will be asked from your resume.
Tip 3 : Read as many Interview experiences of that Company as possible. You will see that the questions are repeated in an interview.

Application process
Where: Campus
Eligibility: Above 6 CGPA
Resume Tip
Resume tip

Tip 1 : Have some good projects on your resume.
Tip 2 : Do not put false things on your resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date6 Oct 2022
Coding problem2

45 MCQ 
2 Coding Question

1. Rearrange string

Hard
50m average time
50% success
0/120
Asked in companies
eBayAdobeMicrosoft

You are given a string “S”. Your task is to rearrange the characters of a string “S”, such that it does not contain any two adjacent characters which are the same.

If it is possible to rearrange the string “S”, then print any possible arrangement. else, print “not possible” without quotes.

For Example:

For a string  “qaacde”, This string has two same adjacent characters.
So, one possible way to rearrange the string is “qacade”. Now, this string does not have two adjacent characters that are the same. 
Problem approach

Tip 1: Do practice for DSA

Try solving now

2. Subset Sum Equal To K

Moderate
30m average time
65% success
0/80
Asked in companies
Deutsche BankHCL TechnologiesPayPal

You are given an array/list ‘ARR’ of ‘N’ positive integers and an integer ‘K’. Your task is to check if there exists a subset in ‘ARR’ with a sum equal to ‘K’.

Note: Return true if there exists a subset with sum equal to ‘K’. Otherwise, return false.

For Example :
If ‘ARR’ is {1,2,3,4} and ‘K’ = 4, then there exists 2 subsets with sum = 4. These are {1,3} and {4}. Hence, return true.
Problem approach

Tip 1 : Do practice for DSA

Try solving now
02
Round
Medium
Online Coding Interview
Duration15 minutes
Interview date4 Nov 2022
Coding problem0

It was a personality assessment round.Questions related to personality and self management were asked.

03
Round
Medium
Video Call
Duration90 minutes
Interview date5 Nov 2022
Coding problem3

1. Project Related Questions

Tell me about yourself?
Tell Me About Your projects.
How can you scale up your project?

2. Theory Questions

What is the OSI Model? (Learn)
Write any program and handle exceptions in that program. (Learn)
What are cout and cin? Where it is defined and declared, and how does it work? (Learn)
What is Abstraction? (Learn)
What is polymorphism, and what are the types of polymorphism? (Learn)
Write the code to explain the Run Time Polymorphism.
What are ACID properties? (Learn)
What is a compiler, and name any of the Compilers? (Learn)

3. Minimum Spanning Tree

Moderate
34m average time
0/80
Asked in companies
AmazonWells FargoMicrosoft

You are given an undirected, connected and weighted graph G(V, E), consisting of V number of vertices (numbered from 0 to V-1) and E number of edges.

Find and print the total weight of the Minimum Spanning Tree (MST) using Kruskal's algorithm.

By definition, a minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.

Problem approach

I have used the Prim’s Minimum Spanning Tree Algorithm:

Try solving now
04
Round
Easy
HR Round
Duration20 minutes
Interview date6 Nov 2022
Coding problem1

1. Basic HR Questions

How was your Technical Interview?
Why Amdocs?
Are you ready for relocation? Any Preferences for Locations.
Then asked about Education and background verification.
Anyone from your family is in AMDOCS?

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 the purpose of the < title > tag in HTML?

Choose another skill to practice
Similar interview experiences
company logo
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Amdocs
1694 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 10 problems
Interviewed by Amdocs
2137 views
0 comments
0 upvotes
company logo
Associate Software Engineer
2 rounds | 2 problems
Interviewed by Amdocs
1047 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Amdocs
911 views
1 comments
0 upvotes
Companies with similar interview experiences
company logo
Associate Software Engineer
3 rounds | 5 problems
Interviewed by Optum
1715 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 5 problems
Interviewed by SAP Labs
1075 views
0 comments
0 upvotes
company logo
Associate Software Engineer
4 rounds | 4 problems
Interviewed by Mindtree
0 views
0 comments
0 upvotes