i
Amdocs
Filter interviews by
I applied via Campus Placement and was interviewed in Aug 2021. There were 4 interview rounds.
A pointer is a variable that stores the memory address of another variable.
Pointers are used to manipulate memory directly.
They can be used to pass large data structures to functions without copying them.
Pointers can be used to create dynamic data structures like linked lists and trees.
They can also be used to access hardware directly.
Examples of pointer types include int*, char*, and void*.
Swap 2 numbers without using 3rd variable
Use addition and subtraction
Use multiplication and division
Use bitwise XOR operation
Answering Fibonacci series with and without recursion
Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones
Recursion method involves calling the function within itself
Non-recursive method involves using a loop to calculate the series
Recursive method is slower and can cause stack overflow for large inputs
Non-recursive method is faster and more efficient for large inputs
Print series of prime numbers
Start with 2 as the first prime number
Check if each number greater than 2 is divisible by any number less than it
If not, add it to the list of prime numbers
Continue until desired number of primes are found
Calculate the number of children and grandchildren
Count the number of direct children of a person
Count the number of grandchildren of a person
Use recursion to count all descendants
Consider only living descendants
Exclude step-children and adopted children
I applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.
Partition even and odd numbers in an array
Iterate through the array and check if each number is even or odd
Create two separate arrays for even and odd numbers
Combine the two arrays to get the final partitioned array
Find leaders in an array of strings
Leaders are elements that are greater than all elements to their right
Traverse array from right to left and keep track of maximum element
Add maximum element to result if it is a leader
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Given 'N' students standing in a row with specific heights, your task is to find the length of the longest strictly increasing subsequence of their heights...
Find the length of the longest strictly increasing subsequence of heights of students in a row.
Iterate through the heights array and for each element, find the length of the longest increasing subsequence ending at that element.
Use dynamic programming to keep track of the longest increasing subsequence length for each element.
Return the maximum length found as the result.
You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.
If an interval ends at time T and anothe...
Given start and end times of intervals, determine if any two intervals overlap.
Iterate through intervals and check if any two intervals overlap by comparing their start and end times
Sort intervals based on start times for efficient comparison
Consider edge cases where intervals end and start at the same time
Various SQL queries related to data manipulation and retrieval were asked during the interview.
Basic SELECT queries to retrieve data from a single table
JOIN queries to retrieve data from multiple tables based on a common column
Aggregate functions like COUNT, SUM, AVG, etc. to perform calculations on data
Subqueries to retrieve data based on the result of another query
UPDATE queries to modify existing data in a table
DELE...
Round duration - 60 Minutes
Round difficulty - Medium
Given a string STR
of size N
and an integer M
representing the number of rows in the zig-zag pattern, return the string formed by concatenating all rows when the string ST...
Arrange a string in zig-zag pattern with given number of rows and concatenate the rows.
Iterate through the string and distribute characters to rows based on zig-zag pattern
Concatenate the characters in each row to get the final result
Handle edge cases like when number of rows is 1 or equal to the length of the string
You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...
The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.
Iterate from right to left to find the first element that is smaller than the element to its right.
Swap this element with the smallest element to its right that is greater than it.
Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.
Round duration - 60 Minutes
Round difficulty - Medium
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
String S
Output string
Recursively remove consecutive duplicate characters from a string.
Use recursion to check if the current character is the same as the next character, if so skip the next character
Base case: if the string is empty or has only one character, return the string
Example: Input: 'aaabcc', Output: 'abc'
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
The first and only line of input ...
Return all possible permutations of a given input string.
Use recursion to generate all possible permutations of the input string.
Swap characters at different positions to generate permutations.
Handle duplicate characters in the input string by using a set to store unique permutations.
Round duration - 60 Minutes
Round difficulty - Medium
Design an e-commerce website similar to Flipkart or Amazon.
Implement user-friendly interface for easy navigation
Include search functionality with filters for products
Incorporate secure payment gateway for transactions
Provide personalized recommendations based on user behavior
Include customer reviews and ratings for products
Implement order tracking and delivery status updates
Offer various payment options like credit/deb
Tip 1 : Prepare DSA well. Standard Leetcode-type questions will be asked.
Tip 2 : You should be crystal clear about your project/s as any question would be asked and you should be able to answer it.
Tip 3 : Prepare CS fundaments like OS, OOPs, DBMS, etc.
Tip 1 : Clearly mention the tech. stack you have worked on in the project/s
Tip 2 : As a fresher, you should add your coding profiles on CodeChef, Codeforces, etc. so as to make the resume shortlisting easy
posted on 6 Dec 2020
I applied via Campus Placement and was interviewed in Nov 2020. There were 3 interview rounds.
posted on 9 Jun 2021
posted on 16 Apr 2021
posted on 7 Jul 2021
posted on 1 Aug 2022
I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.
It contains Aptitude, Java and DBMS
based on 6 reviews
Rating in categories
Software Developer
8.3k
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.1 L/yr |
Associate Software Engineer
1k
salaries
| ₹3.5 L/yr - ₹12 L/yr |
TCS
IBM
Oracle
Carelon Global Solutions