
Amdocs


10+ Amdocs Software Developer Interview Questions and Answers for Freshers
Q1. First Unique Character in a Stream Problem Statement
Given a string A
consisting of lowercase English letters, determine the first non-repeating character at each point in the stream of characters.
Example:
Inp...read more
Given a string of lowercase English letters, find the first non-repeating character at each point in the stream.
Create a hashmap to store the frequency of each character as it appears in the stream.
Iterate through the stream and check the frequency of each character to find the first non-repeating character.
Output the first non-repeating character at each point in the stream.
Q2. Pythagorean Triplet Problem
Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.
Explanation...read more
Check if a Pythagorean triplet exists in a given array of integers.
Iterate through all possible combinations of three numbers in the array and check if they form a Pythagorean triplet.
Use a nested loop to generate all possible combinations efficiently.
Check if the sum of squares of two numbers is equal to the square of the third number.
Q3. Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the other...read more
Check if two strings are anagrams of each other by comparing their sorted characters.
Sort the characters of both strings and compare them.
Use a dictionary to count the frequency of characters in each string and compare the dictionaries.
Ensure both strings have the same length before proceeding with the comparison.
Example: For input 'spar' and 'rasp', after sorting both strings, they become 'aprs' which are equal, so return True.
Q4. Minimum Spanning Tree Problem Statement
You are provided with an undirected, connected, and weighted graph G(V, E). The graph comprises V vertices (numbered from 0 to V-1) and E edges.
Determine and return the ...read more
Find the total weight of the Minimum Spanning Tree in a graph using Kruskal's algorithm.
Implement Kruskal's algorithm to find the Minimum Spanning Tree.
Sort the edges based on their weights and add them to the MST if they don't form a cycle.
Keep track of the total weight of the MST and return it as the output.
Q5. Maximum Points On Straight Line Problem Statement
You are provided with a 2-D plane and a set of integer coordinates. Your task is to determine the maximum number of these coordinates that can be aligned in a s...read more
Find the maximum number of points that can be aligned in a straight line on a 2-D plane.
Iterate through each pair of points and calculate the slope between them.
Store the slope in a hashmap and keep track of the frequency of each slope.
The maximum frequency of slopes + 1 gives the maximum number of points on a straight line.
To check for integer overflow when multiplying two integers, use the properties of integer overflow and check if the result is within the valid range of the integer type.
Check if the signs of the two integers are the same to avoid overflow in case of multiplication.
Use the properties of integer overflow to detect if the result exceeds the maximum or minimum value of the integer type.
Consider using a larger data type or a library that supports arbitrary-precision arithmetic if...read more
Q7. Challenges faced in your RPA experience and how you resolved it?
Challenges faced in RPA experience and how resolved
One challenge was automating a process with multiple decision points, resolved by creating a decision tree
Another challenge was handling exceptions, resolved by implementing exception handling mechanisms
Integration with legacy systems was a challenge, resolved by creating custom connectors
Lack of standardization in input data was a challenge, resolved by implementing data validation and cleansing mechanisms
Check for a loop in a linked list by using two pointers moving at different speeds.
Use two pointers, one moving at double the speed of the other.
If there is a loop, the two pointers will eventually meet at the same node.
Example: 1 -> 2 -> 3 -> 4 -> 5 -> 2 (loop back to 2), the two pointers will meet at node 2.
Q9. swaping of number using call by value , address and reference
Swapping of numbers can be done using call by value, address and reference.
Call by value: Pass the values of variables as arguments to the function. Swap the values inside the function.
Call by address: Pass the addresses of variables as arguments to the function. Swap the values using pointers inside the function.
Call by reference: Pass the references of variables as arguments to the function. Swap the values using references inside the function.
Q10. write multi-threading program to print 1 2 1 2 using 2 thread.
A multi-threading program to print 1 2 1 2 using 2 threads.
Create two threads and pass a flag to each thread to print either 1 or 2.
Use a synchronization mechanism like mutex or semaphore to ensure alternate printing.
Join the threads to wait for their completion.
Q11. Design class diagram for Flower shop
Design class diagram for Flower shop
Create a Flower class with attributes like name, color, price, etc.
Create a Bouquet class that has a list of Flower objects
Create a Customer class with attributes like name, address, phone number, etc.
Create an Order class that has a Customer object and a Bouquet object
Create a Payment class with attributes like payment method, amount, etc.
Create a Delivery class with attributes like delivery address, delivery date, etc.
Q12. write a code for binary search
Code for binary search algorithm
Binary search is a divide and conquer algorithm
It works by repeatedly dividing the search interval in half
If the value is found, return the index. Else, repeat on the appropriate half
The array must be sorted beforehand
Q13. reverse the string
Reverse a given string
Use a loop to iterate through the string and append each character to a new string in reverse order
Alternatively, use built-in string functions like reverse() or slice()
Remember to handle edge cases like empty strings or strings with only one character
Q14. String reverse program
A program that reverses a string input
Create a function that takes a string as input
Use a loop to iterate through the characters of the string in reverse order
Append each character to a new string to build the reversed string
Return the reversed string as output
Q15. Describe inheritance in java.
Inheritance in Java allows a class to inherit properties and behaviors from another class.
Allows a class to reuse code from another class
Creates a parent-child relationship between classes
Child class inherits fields and methods from parent class
Can have multiple levels of inheritance
Example: class Dog extends Animal
Top HR Questions asked in Amdocs Software Developer for Freshers
Interview Process at Amdocs Software Developer for Freshers

Top Software Developer Interview Questions from Similar Companies








Reviews
Interviews
Salaries
Users/Month

