Amdocs Associate Software Engineer Interview Questions, Process, and Tips

Round duration - 90 Minutes
Round difficulty - Medium

This was an online coding round where we had 2 questions to solve under 90 minutes . Both the questions were of easy to medium difficulty .

Q1. 
Maximum Sum Increasing Subsequence of Length K Problem Statement
You are given an array NUMS consisting of N integers and an integer K. Your task is to determine the maximum sum of an increasing subsequen...read more
Ans. 
This was a preety good DP-problem . I struggled a bit initially on finding the DP transition but on carefully observing the constraints of the problem , I figured that a O(N^2*K) DP solution will also pass the Test Cases .

Steps :
1) Initiliase a DP array dp[n][k+1] . Store -INF in all cells initally.
2) Let dp[i][j] store the answer for an array of length i and a subsequence of length j
3) Now, for every i , dp[i][1]=arr[...read more
Answered Anonymously
Add your answer
Q2. 
First Unique Character in a String Problem Statement
Given a string STR consisting of lowercase English letters, identify the first non-repeating character in the string and return it. If no such characte...read more
Ans. 
Approach :
1) Make a count array and initialize all characters by -1, i.e., all considered as absent.
2) Traverse the given string, and the value of count[x] will be the index of ‘x’ if ‘x’ appears only once. Else, the value is going to be either -1 or -2.
3) Now, traverse the count array and check if the ith character occurs only once (count[i] has a positive value) and appears before the current result, then update the ...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round consisted of questions from DS/Algo , OOPS and Operating Systems primarily usage of some basic UNIX commands .

Q1. 
Implement Atoi Function
You have a string 'STR' of length 'N'. Your task is to implement the atoi function, which converts the string into an integer. If the string does not contain any numbers, the funct...read more
Ans. 
This was a pure implementation based problem where I was tested on how well can I figure out all the edge cases and code the problem in a production ready manner.

Steps :
1) First of all check if the string is empty , if it is then simply return 0
2) Remove all the spaces from the string
3) Handle the signs '+' and '-' .
4) Handle cases of overflow(if ans>INT_MAX/10 or ans'7' or ans==INT_MIN/10 and s[i]>'8')
5) If sign...read more
Answered Anonymously
Add your answer
Q2. Can you explain run time polymorphism in C++?
Ans. 
Answer : 
1) Runtime polymorphism is also known as dynamic polymorphism or late binding. In runtime polymorphism, the function call is resolved at run time.

2) In contrast, to compile time or static polymorphism, the compiler deduces the object at run time and then decides which function call to bind to the object. 

3)In C++, runtime polymorphism is implemented using method overriding.

4) Function overriding is t...read more
Answered Anonymously
Add your answer
Q3. What is a friend function in C++?
Ans. 
Answer : 

1) A friend function is a function that is specified outside a class but has the ability to access the class members’ protected and private data. 
2) A friend can be a member’s function, function template, or function, or a class or class template, in which case the entire class and all of its members are friends.


Uses of Friend Functions :

1) In special cases when a class’s private data needs to be acc...read more
Answered Anonymously
Add your answer
Q4. Can you explain any 5 essential UNIX commands?
Ans. 
Answer : 
1) ls -> Lists files in current directory
2) cd -> Change directory to tempdir
3) mkdir -> Make a directory called graphics
4) rmdir -> Remove directory (must be empty)
5) cp -> Copy file into directory
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. Why do you want to work at Amdocs?
Ans. 
Answer :

a) It is an IT company that caters to the telecommunication domain. The business involved in the telecommunication domain is interesting and can widen your chances of switching into various fields be it in software, hardware or networking profiles. Also, Amdocs carries a good brand name in its domain.

b) Amdocs employees get to enjoy a positive and happy work environment.

c) It is truly an employee friendly organ...read more
Answered Anonymously
Add your answer

50 Marks medium questions

2 Coding and 1 Sql question

Q1. Technical round with tech lead
Add your answer

Q1. Basic HR Questions
Add your answer

Q1. Java and Spring boot concepts and along with 1 coding problem
Add your answer

Q1. Why Amdocs? and basic HR questions
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

This was an online coding round where we had 2 questions to solve under 90 minutes . Both the questions were of easy to medium difficulty .

Q1. 
Subarray with Equal Occurrences Problem Statement
You are provided with an array/list ARR of length N containing only 0s and 1s. Your goal is to determine the number of non-empty subarrays where the numbe...read more
Ans. 
Approach :
1) Convert all 0's to -1's .
2) Now , the questions boils down to finding the number of subarrays with sum=0
3) This is a very standard problem which can be solved in O(N) using Hashing .
4) Maintain a Hash Map which keeps a track of all the prefix sums encountered so far
5) Maintain an answer variable and at each step do : ans+=map[prefixSum]
6) Finally return ans
Answered Anonymously
Add your answer
Q2. 
Pythagorean Triplets Detection
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x² + y² = z² within the array.
Input:
The first lin...read more
Ans. 
Approach :
1) I solved it in O(N^2) approach .
2) Sort the array
3) Initially map all the elements of the array to their index in a Hash Map or a Hash Set
4) Now , run 2 for loops and for every x^2 + y^2 ,check if there exists a z^2 s.t x^2+y^2=z^2 and the index of z^2 is different than both the indices of x and y
Answered Anonymously
Add your answer

Round duration - 70 Minutes
Round difficulty - Medium

I was asked to solve 3 preety basic DSA questions in this round and discuss their respective time complexities and then we moved onto OOPS where the interviewer asked me some questions related to JAVA as well as C as I had mentioned both of them in my Resume . At the end , I was asked to write a simple SQL query to join two tables . Overall this round was preety intense and I tried to give my best .

Q1. 
Palindrome String Validation
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
Note:
The string 'S' should be evaluated in a case...read more
Ans. 
Approach 1 :
1) Initialise a string named rev with the given string .
2) Reverse the string rev.
3) Now, if s is a palindrome then we would have rev==s , return true if rev==s and false otherwise

TC : O(N) where N=length of the string
SC : O(1)

Approach 2(Using Two Pointers) :
1) Keep pointer i=0 and j=n-1 where n=length of the string
2) Run a loop till i<=j and check if s[i]==s[j] for the condition of palindrome
3) If at an...read more
Answered Anonymously
Add your answer
Q2. 
Fibonacci Number Verification
Identify if the provided integer 'N' is a Fibonacci number.
A number is termed as a Fibonacci number if it appears in the Fibonacci sequence, where each number is the sum of...read more
Ans. 
Approach :
Using Recursion : 
1) Create a recursive function (int fib(int n) ) which takes the number of terms n of the Fibonacci Series
2) Base Case : if(n<=1) return n;
3) Recurrence Relation : fib(n)=fib(n-1)+fib(n-2)
4) Optimise the above code using memoisation i.e., if(dp[n]!=0)return dp[n] and fianlly store the answer into dp[n]
5) Traverse the dp array and print the output.

TC : O(n)
SC : O(n)

Without using Recur...read more
Answered Anonymously
Add your answer
Q3. 
All Prime Numbers Problem Statement
Given an integer 'N', your task is to print all the prime numbers that lie within the range from 2 to 'N' (inclusive).
Input:
Integer N
Output:
Prime numbers printe...read more
Ans. 
Approach 1 (Without using Sieve of Eratosthenes) : 
1) For every number from 2 to n check if is prime or not .
2) The check prime function which checks if a number is prime or not can be implemented in O(N^1/2) complexity by running a loop from i= 2 toi= N^1/2 and then checking if N%i==0 or not , if N%i==0 simply return false else return true

TC : O(N^3/2)
SC : O(1)

Approach 2 (Using Sieve of Eratosthenes) : 
1) In...read more
Answered Anonymously
Add your answer
Q4. What is the garbage collector in Java?
Ans. 
Answer :

1) Garbage Collection in Java is a process by which the programs perform memory management automatically.

2) The Garbage Collector(GC) finds the unused objects and deletes them to reclaim the memory. 

3) In Java, dynamic memory allocation of objects is achieved using the new operator that uses some memory and the memory remains allocated until there are references for the use of the object.

4) When there are ...read more
Answered Anonymously
Add your answer
Q5. What is a static variable in C?
Ans. 
Answer :

1) Static variables are initialized only once. 
2) The compiler persists with the variable till the end of the program. 
3) Static variables can be defined inside or outside the function. 
4) They are local to the block. 
5) The default value of static variables is zero. 
6) The static variables are alive till the execution of the program.

Here is the syntax of static variables in C language,

...read more
Answered Anonymously
Add your answer
Q6. Can you explain the Singleton Class in Java?
Ans. 
Answer :

1) In object-oriented programming, a singleton class is a class that can have only one object (an instance of the class) at a time.

2) After first time, if we try to instantiate the Singleton class, the new variable also points to the first instance created.

3) So whatever modifications we do to any variable inside the class through any instance, it affects the variable of the single instance created and is visib...read more
Answered Anonymously
Add your answer
Q7. Can you write a SQL query that joins two tables A and B on the common attribute ID and selects records (ID_NAME) that have matching ID values in both tables?
Ans. 
SELECT A.ID_Name, B.ID_Name
FROM A
INNER JOIN B ON A.ID=B.ID;
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This was a typical HR round with some standard Behavioral questions like my interests, weaknesses, strengths, family background, are you willing to relocate or travel , why Amdocs, CEO of Amdocs etc.

Q1. Why do you want to work at Amdocs?
Ans. 
Answer :

a) It is an IT company that caters to the telecommunication domain. The business involved in the telecommunication domain is interesting and can widen your chances of switching into various fields be it in software, hardware or networking profiles. Also, Amdocs carries a good brand name in its domain.

b) Amdocs employees get to enjoy a positive and happy work environment.

c) It is truly an employee friendly organ...read more
Answered Anonymously
Add your answer

This consists of aptitude,reasoning,coding qiestions,sql queries in hirepro platform

Q1. Introduce your self,sql queries,java questions,
Add your answer

Q1. Introduce yourself,company questions
Add your answer