Filter interviews by
Clear (1)
Good questions around data structures and algorithms
Good questions around data structures and algorithms
Good questions around datastructures and algorithms
Top trending discussions
I applied via Naukri.com and was interviewed before Nov 2020. There were 5 interview rounds.
DFMEA stands for Design Failure Mode and Effects Analysis, VAVE stands for Value Analysis/Value Engineering.
DFMEA is a systematic approach to identify and mitigate potential failures in a design.
It involves analyzing the potential failure modes, their effects, and the likelihood of occurrence.
DFMEA helps in prioritizing and implementing design changes to improve reliability and reduce risks.
VAVE is a systematic approac...
I applied via Campus Placement and was interviewed in Nov 2021. There were 4 interview rounds.
I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Apr 2021. There were 3 interview rounds.
My resume
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
Puzzles, Psychometric Test
I applied via Company Website and was interviewed before Sep 2021. There were 2 interview rounds.
2 coding questions which are of easy level
based on 1 interview
Interview experience
Technical Support Engineer
935
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Consultant
327
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
270
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Member of Technical Staff
249
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Technical Consultant
229
salaries
| ₹0 L/yr - ₹0 L/yr |
SAP
Zoho
Oracle
Adobe