Filter interviews by
Cloud UCaaS solutions offer flexibility and scalability, while on-premise solutions provide more control. PSTN telephony codecs include G.711, G.729, and Opus.
Cloud UCaaS solutions offer scalability and flexibility, allowing for easy expansion and reduced maintenance costs.
On-premise UCaaS solutions provide more control over security and customization, but require higher upfront costs and maintenance.
PSTN telephony cod...
Prepare a Solution Deck and present to panel of 3 interviewers.
Top trending discussions
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 applied via Naukri.com and was interviewed before Nov 2020. There were 3 interview rounds.
Cognos deployment process involves planning, testing, and executing the deployment of Cognos software to production environment.
The deployment process should be planned carefully to avoid any issues during the deployment.
Testing should be done in a non-production environment to ensure that the deployment is successful.
The deployment should be executed in a phased manner to minimize downtime and ensure that the system i...
I applied via Recruitment Consultant and was interviewed in Jun 2021. There was 1 interview round.
posted on 1 Aug 2020
I applied via Recruitment Consultant and was interviewed in Feb 2020. There were 3 interview rounds.
posted on 15 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 75 minutes
Round difficulty - Easy
This was the coding round which consisted of three coding questions and the time limit was of 75 minutes. The platform used was Co-Cubes. 3 questions were asked of 2, 3 and 5 marks respectively with varying difficulty.
Given an integer N
, find the nearest multiple of 10. If there are multiple nearest multiples, return the smallest one.
The first line contains an integer ...
Given an integer, find the nearest multiple of 10. If multiple nearest multiples, return the smallest one.
Iterate through each test case
Calculate the remainder when dividing N by 10
If remainder is less than or equal to 5, nearest multiple is N - remainder
If remainder is greater than 5, nearest multiple is N + (10 - remainder)
Your task is to create a function that determines the day of the week for any given date, whether in the past or the future.
The first line consists of an integer 'T',...
Create a function to determine the day of the week for any given date.
Parse the input integers to create a date object
Use a library or algorithm to calculate the day of the week for the given date
Return the corresponding day of the week as a string
Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...
Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.
Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.
Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.
Continue this process until the end of the linked list is reached.
Update the next pointers accordingly to skip 'N' nodes...
Round duration - 30 minutes
Round difficulty - Easy
This was a written round and we were expected to write fully functional code, without any bugs and errors. Library functions used if any, had to be explained and if possible, code for that too (not that rigorous). Pseudocode and algorithms were also allowed. All the assumptions made had to be explained as well.
The Look-And-Say sequence is a series of positive integers generated in a specific pattern:
1, 11, 21, 1211, 111221, 312211, 13112221,...
To construct this sequen...
The Look-And-Say sequence is a series of positive integers generated in a specific pattern based on the count of digits in the previous number.
Implement a function to generate the Nth term of the Look-And-Say sequence efficiently.
Use a loop to iterate through the sequence generation process.
Keep track of the count of consecutive digits in each number to generate the next number.
Handle the constraints of the number of t...
Given an array ARR
consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.
Rearrange the array elements to form the largest possible number by concatenating them.
Sort the array elements in a custom way to form the largest number.
Convert integers to strings for comparison while sorting.
Handle edge cases like leading zeros in the final number.
Example: For input [12, 5, 34], the output should be '53412'.
Round duration - 50 minutes
Round difficulty - Easy
The interviewer was very friendly and started asking me questions by making me comfortable.
You are provided with a directory path in Unix-style notation, and your task is to simplify it according to given rules.
In a Unix-style file system:
The task is to simplify a directory path in Unix-style notation according to given rules.
Use a stack to keep track of directories while iterating through the input path.
Handle cases for '.', '..', and multiple slashes to simplify the path.
Return the simplified path starting with a slash and without a trailing slash.
You are provided with two arrays representing the coefficients and degrees of a polynomial expression. Your task is to simplify this polynomial into its general...
Simplify a polynomial expression by combining like terms and arranging them in descending order of degrees.
Iterate through the coefficients and degrees arrays to combine like terms
Create a map to store coefficients based on degrees
Sort the map keys in descending order to get the simplified polynomial
Round duration - 40 minutes
Round difficulty - Easy
This round was focused on resume and projects
Round duration - 30 minutes
Round difficulty - Easy
This round was basically a mix of HR and creative design round. The interviewer wanted to check whether the candidate can think out-of-the-box with regard to any given problem and come up with unique, optimized solutions.
Tip 1 : I would suggest practicing as many questions on data structures and algorithms as you can because it is the question practice that would help you in building your concepts strong. I practiced a lot of questions on InterviewBit and completed all modules of data structures and algorithms because there you can find the recent interview questions that you should know.
Tip 2 : If you have time for your interviews, I would recommend going through Leetcode as it has a good variety of questions sorted on topic wise difficulty level where you can try to solve at least 20-30 questions for each data structure and algorithm. Moreover, you should regularly participate in the weekly contests happening there so that you could know about your weak areas to improve.
Tip 3 : Along with coding you should be clear about some basic concepts of Operating systems and Databases that would help in your interviews. One more thing is that do some good research about the company's goal and vision and be prepared to ask some company-related queries that show your interest in the company.
Tip 1 : Your Resume should consist of mainly skills, projects, and achievements. Projects would play a crucial part in your interview and you should have at least one most relevant and good project that shows how strong your concepts are in development.
Tip 2 : The most important tip is that never lie on your resume and like If you have worked upon some technology for the project part only and don't know the proper depth you could write basics only in your resume.
posted on 19 Jan 2021
I applied via Referral and was interviewed before Jan 2021. There were 5 interview rounds.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Devops Engineer
7
salaries
| ₹20 L/yr - ₹41.6 L/yr |
Front end Engineer
7
salaries
| ₹7.5 L/yr - ₹7.5 L/yr |
Executive Accountant
7
salaries
| ₹25 L/yr - ₹46 L/yr |
Data Engineer
7
salaries
| ₹28 L/yr - ₹75 L/yr |
Software Engineer
6
salaries
| ₹24 L/yr - ₹36 L/yr |
Teleperformance
Amazon
iEnergizer
Deloitte