Filter interviews by
Coding test was simple with 3 questions, 1 with SQL and other 2 with dsa questions
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
4 coding questions on hackerrank.
You are given D
dice, each having F
faces numbered from 1 to F
. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up num...
The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up numbers equals the given 'target' sum.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the number of ways to achieve each sum with the given number of dice.
Iterate through the dice and faces to calculate the number of ways to reach each sum.
Return the result modulo 10^9 + 7.
Optim...
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Implement a stack using two queues to store integer values with specified functions.
Use two queues to simulate stack operations efficiently.
Maintain the top element in one of the queues for easy access.
Ensure proper handling of edge cases like empty stack.
Example: Push elements 5, 10, 15; Pop elements; Check top element.
Example: Check if stack is empty; Get stack size.
Given an array 'ARR' of integers with length 'N', the task is to determine the sum of the subarray (including an empty subarray) that yields the maximum sum among al...
Find the maximum sum of a subarray in an array of integers.
Iterate through the array and keep track of the maximum sum subarray ending at each index.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Consider the case where all elements are negative to handle edge cases.
Example: For input [1, -2, 3, -1, 2], the maximum subarray sum is 4.
Round duration - 60 minutes
Round difficulty - Medium
My 1st technical round began with a small introduction and a discussion on my projects. After that, my complete interview revolved around Object-oriented principles and 1 basic coding question. The interviewer asked all the pillars of Object-oriented along with use cases and where have I implemented them in my projects.
Round duration - 45 minutes
Round difficulty - Easy
In my 2nd technical round, the interviewer began with the complete discussion of my projects. He asked me everything about them like which technologies I have used, why I have used them, what are the alternatives, what are the real-life applications of these projects. After this, He asked questions on Computer Networks, Operating system, Database Management system and at the end, some of the SQL queries. SQL queries were quite easy, I found one of the queries tricky and harder as compared to other i.e print nth largest salary of the employees. The interviewer also asked me why I was not able to code one of the questions in the coding round. I explained the complete approach of that question and he was quite satisfied. This technical round was of 1 hour long.
Find the nth largest salary from a list of salaries.
Sort the list of salaries in descending order.
Remove duplicates from the sorted list.
Return the salary at index n-1 from the sorted list.
Round duration - 35 minutes
Round difficulty - Easy
There were two panellists in this round and they began with a small introduction. One of them asked me about my capstone project which was based on object recognition task and deep learning. He just told me to explain deep learning in complete detail and how can it be used on my college campus. Then, He asked me what technologies are being used and how I trained my model as the model was quite heavy and computationally intensive. Then, they asked me how I cope up with my team members in the pandemic situation and how I managed to interact with them.
Deep learning has applications in image and speech recognition, natural language processing, autonomous vehicles, etc.
Image recognition - identifying objects in images, used in self-driving cars, medical imaging, etc.
Speech recognition - converting spoken language into text, used in virtual assistants like Siri, Alexa, etc.
Natural language processing - understanding and generating human language, used in chatbots, lang...
Tip 1 : Practice at least 600 questions from leetcode.
Tip 2 : Make sure you participate in every long challenge of CodeChef.
Tip 3 : Focus more on your projects.
Tip 1 : Do not put false things on a resume.
Tip 2 : Have some projects on a resume.
Top trending discussions
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Numerical and logical aptitude test
There are 5 rounds on datastructure and algorithm
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.
based on 1 interview experience
based on 1 review
Rating in categories
Customer Operations Engineer
58
salaries
| ₹10.3 L/yr - ₹20 L/yr |
Software Engineer
43
salaries
| ₹7.5 L/yr - ₹30 L/yr |
Senior Customer Operations Engineer
34
salaries
| ₹16.5 L/yr - ₹31.5 L/yr |
Software Engineer2
33
salaries
| ₹18 L/yr - ₹36 L/yr |
Senior Software Engineer
26
salaries
| ₹26 L/yr - ₹47.7 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer