Faster and better experience!
Filter interviews by
I applied via Company Website and was interviewed in Nov 2024. There were 2 interview rounds.
Top trending discussions
I applied via Approached by Company and was interviewed before Oct 2023. There were 3 interview rounds.
Task to setup lab and share results
posted on 6 Nov 2015
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
Leet code medium level questions
I was interviewed 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.
I applied via Referral and was interviewed before Aug 2023. There were 3 interview rounds.
4 questions, 1 easy, 2 medium, 1 hard.
based on stack, DP and String.
Coding test was simple with 3 questions, 1 with SQL and other 2 with dsa questions
based on 3 interviews
Interview experience
Software Engineer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
MongoDB
Redis Labs
Elastic
Cloudera