i
Amdocs
Filter interviews by
I appeared for an interview in Oct 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 questions of DSA where I was asked to first explain my approach and then code it as well in a production ready manner . After that , I was asked some questions related to Operating Systems and Java .
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Remove the Kth node from the end of a singly linked list.
Traverse the linked list to find the length 'N'.
Calculate the position to delete from the beginning as 'N - K + 1'.
Delete the node at the calculated position.
Handle edge cases like deleting the head or tail node.
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Find the node where two linked lists merge
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the merging node
The life cycle of a thread in Java involves creation, running, waiting, and termination.
A thread is created using the 'new' keyword or by implementing the Runnable interface.
The thread starts running when the start() method is called.
During execution, a thread can enter a waiting state using methods like sleep() or wait().
A thread terminates when its run() method completes or when the stop() method is called.
Round duration - 60 Minutes
Round difficulty - Medium
This round also had 2 questions of DS/Algo where I coded one of them and then we switched our discussion to DBMS and OOPS ( particularly in Java ) .
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Merge two sorted linked lists into a single sorted linked list with linear time complexity and constant space usage.
Create a dummy node to start the merged list
Compare the values of the two linked lists and add the smaller value to the merged list
Move the pointer of the merged list and the pointer of the smaller value list forward
Continue this process until one of the lists is fully traversed
Append the remaining elemen...
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to keep track of the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access and update.
When capacity is reached, evict the least recently used item before inserting a new item.
DELETE removes specific rows from a table, while TRUNCATE removes all rows and resets auto-increment values.
DELETE is a DML command, while TRUNCATE is a DDL command.
DELETE can be rolled back, while TRUNCATE cannot be rolled back.
DELETE triggers delete triggers, while TRUNCATE does not trigger them.
DELETE is slower as it logs individual row deletions, while TRUNCATE is faster as it logs the deallocation of the data page...
Garbage collector in Java is a built-in mechanism that automatically manages memory by reclaiming unused objects.
Garbage collector runs in the background to reclaim memory from objects that are no longer in use.
It helps prevent memory leaks and optimize memory usage.
Examples of garbage collectors in Java include Serial, Parallel, CMS, G1, and Z Garbage Collectors.
Round duration - 50 Minutes
Round difficulty - Medium
This round was inclined towards some Low Level Design Principles and some concepts from Java .
Railway Reservation System for booking train tickets
Create a database to store train schedules, seat availability, and passenger information
Develop a user interface for customers to search for trains, select seats, and make payments
Implement a booking system to reserve seats and generate tickets
Include features like seat selection, cancellation, and ticket printing
Ensure security measures for payment processing and dat
Java is platform-independent because the code is compiled into bytecode which can run on any platform with a JVM, making the JVM platform-dependent.
Java code is compiled into bytecode, which is a platform-independent intermediate code
The JVM interprets and executes the bytecode on different platforms
The JVM acts as a layer of abstraction between the Java code and the underlying platform
The JVM is platform-dependent bec...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more
I use LinkedList for insertion and deletion as it provides constant time complexity.
LinkedList provides constant time complexity for insertion and deletion operations.
ArrayList provides linear time complexity for these operations.
LinkedList is preferred when frequent insertion and deletion operations are required.
ArrayList is preferred when frequent access to elements is required.
Association refers to a relationship between two or more objects where they are connected or linked in some way.
Association is a fundamental concept in object-oriented programming.
It is used to represent a relationship between two or more objects.
The relationship can be one-to-one, one-to-many, or many-to-many.
For example, a car has an association with its engine, as it cannot function without it.
Another example is a s...
Truncate removes all data from a table while delete removes specific rows.
Truncate is faster than delete as it doesn't log individual row deletions.
Truncate cannot be rolled back while delete can be.
Truncate resets the identity of the table while delete doesn't.
Truncate doesn't fire triggers while delete does.
Query to delete record in SQL
Use DELETE statement with WHERE clause to specify the record to be deleted
Make sure to backup data before deleting
Example: DELETE FROM table_name WHERE column_name = value;
Merging two lists in Java
Create a new list to hold the merged result
Iterate through both lists and compare elements
Add the smaller element to the new list and move to the next element in that list
Repeat until all elements have been added to the new list
Return the new merged list
Interview questions for Software Developer related to Spring, Collections, Serialization, Exceptions, Unix, Annotations, Json, Build tools, Restful services, and more.
List and Set are both collection interfaces in Java. List allows duplicates and maintains insertion order while Set doesn't allow duplicates and doesn't maintain any order.
Sorted in Hashed Set means that the elements are stored in a sorted order based on ...
I appeared for an interview before Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview in Oct 2016.
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Inheritance allows for code reuse and promotes modularity.
The class that is being inherited from is called the superclass or base class.
The class that inherits from the superclass is called the subclass or derived class.
The subclass can access the public and protected members of the superclass.
Inhe...
Regular expressions in PHP are powerful tools for pattern matching and manipulating strings.
Regular expressions are defined using the preg_match() function in PHP.
They are used to search, replace, and validate strings based on specific patterns.
Regex patterns consist of a combination of characters and special symbols.
Modifiers can be added to the pattern to control the matching behavior.
Common regex functions in PHP in...
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism allows a single interface to be used for different types of objects.
It enables code reusability and flexibility in object-oriented programming.
For example, a parent class 'Animal' can have multiple child classes like 'Dog', 'Cat', and 'Bird'. They can all be treated as 'Anim...
Software Developer
8.2k
salaries
| ₹5 L/yr - ₹17 L/yr |
Software Engineer
1.9k
salaries
| ₹4 L/yr - ₹16 L/yr |
Softwaretest Engineer
1.7k
salaries
| ₹2.9 L/yr - ₹14 L/yr |
Functional Test Engineer
1.2k
salaries
| ₹4 L/yr - ₹12.3 L/yr |
Associate Software Engineer
1k
salaries
| ₹3.5 L/yr - ₹12 L/yr |
TCS
IBM
Oracle
Carelon Global Solutions