Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
Check if a string of parenthesis is valid or not.
Use a stack to keep track of opening parenthesis.
Iterate through the string and push opening parenthesis onto the stack.
When encountering a closing parenthesis, pop from the stack and check if it matches the corresponding opening parenthesis.
If stack is empty at the end and all parenthesis have been matched, the string is valid.
Top trending discussions
I applied via Job Portal and was interviewed in Sep 2023. There were 2 interview rounds.
I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
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 was interviewed before Oct 2021.
There are technical and objective questions
They asked about projects and asked to speak on any topics.
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 2 interview rounds.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
Puzzles, Psychometric Test
based on 1 interview
Interview experience
Senior Software Engineer
219
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
146
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
126
salaries
| ₹0 L/yr - ₹0 L/yr |
Devops Engineer
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Software Engineer
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Salesforce
Yodlee
SAP
Oracle