Filter interviews by
I applied via Job Portal and was interviewed before May 2023. There were 2 interview rounds.
90 min coding test with 4-5 problems to solve
I applied via Naukri.com and was interviewed before Dec 2021. There were 4 interview rounds.
Use SQL query to find salary department wise
Use GROUP BY clause to group salaries by department
Use SUM() function to calculate total salary for each department
Join with department table if necessary to get department names
posted on 17 Feb 2024
I applied via Naukri.com and was interviewed before Feb 2023. There were 2 interview rounds.
Medium DSA question on dynamic programming
posted on 25 Aug 2022
I applied via Campus Placement and was interviewed before Aug 2021. There were 4 interview rounds.
Duration: 1hr
Topics: Array, LinkedList,Stack
Code for insertion in a binary tree
Create a new node with the given data
If the tree is empty, make the new node as root
Else, traverse the tree to find the appropriate position to insert the new node
If the data is less than the current node, go to the left subtree
If the data is greater than the current node, go to the right subtree
Repeat until an appropriate position is found
Set the new node as the child of the appropri
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into two sub-arrays.
Choose a pivot element from the array
Partition the array around the pivot element
Recursively apply quick sort to the left and right sub-arrays
Combine the sorted sub-arrays to get the final sorted array
I applied via Naukri.com and was interviewed in Mar 2021. There were 5 interview rounds.
I applied via Campus Placement and was interviewed in Jan 2021. There were 5 interview rounds.
posted on 15 Oct 2022
I applied via Recruitment Consulltant and was interviewed in Sep 2022. There were 5 interview rounds.
Design and optimize a hashmap
Choose a good hash function to minimize collisions
Implement dynamic resizing to handle increasing load factor
Consider using open addressing or separate chaining for collision resolution
Use an efficient data structure for storing key-value pairs, such as an array or linked list
Custom recyclerview with appropriate data structures
Create a custom adapter extending RecyclerView.Adapter
Implement onCreateViewHolder() and onBindViewHolder() methods
Use appropriate data structures like ArrayList or HashMap for efficient data handling
Implement onClickListener for item clicks
Use ViewHolder pattern for efficient view recycling
I expect fair compensation for my skills and experience, and a challenging work environment that allows for growth and learning.
I am looking for a salary that is commensurate with my experience and skills.
I am open to negotiation and willing to discuss salary and benefits.
I am looking for a challenging work environment that allows me to learn and grow as a software engineer.
I am interested in opportunities for professi...
posted on 3 Jun 2024
I applied via LinkedIn and was interviewed in Dec 2023. There were 3 interview rounds.
based on 1 interview
Interview experience
based on 23 reviews
Rating in categories
Consultant
1.1k
salaries
| ₹7 L/yr - ₹24.1 L/yr |
Data Engineer
771
salaries
| ₹7.5 L/yr - ₹25.5 L/yr |
Senior Consultant
633
salaries
| ₹11 L/yr - ₹38 L/yr |
Data Scientist
495
salaries
| ₹8.5 L/yr - ₹31 L/yr |
Engineer
206
salaries
| ₹7.5 L/yr - ₹25.1 L/yr |
Subex
Kiya.ai
MathCo
Innovatiview India Ltd