Filter interviews by
Program to print binary tree bottom view
Traverse the tree in level order and store the horizontal distance of each node from the root
Store the nodes in a map with their horizontal distance as key
Print the nodes in the map in ascending order of their horizontal distance
Backend fastapi questions
Electronics for Imaging interview questions for popular designations
Map coding in C++ : what data structure to use which is fastest for retrieval of data
Hash table is the fastest data structure for retrieval by providing the key value.
Hash table uses a hash function to compute an index into an array of buckets or slots, from which the desired value can be found.
Example: Python dictionary, Java HashMap, C++ unordered_map.
Complexity: O(1) on average for retrieval.
Face to Face interview
Face to Face round
1. Reverse LinkedList
2. Find an element in BSt
I applied via Naukri.com and was interviewed in Dec 2022. There were 5 interview rounds.
Next round with Director - i got few case study and i have give solution for the same
I applied via Job Portal and was interviewed in Apr 2023. There were 3 interview rounds.
Aptitude question + 2 coding question
based on 14 interviews
Interview experience
based on 117 reviews
Rating in categories
QA Engineer
124
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
105
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
94
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Engineer
83
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior QA Engineer
54
salaries
| ₹0 L/yr - ₹0 L/yr |
Helmerich & Payne
Canon
Xerox
Ricoh